Smallest Factor (Integer Factoring)

From Algorithm Wiki
Jump to navigation Jump to search


Given an $n$-bit integer $N$, find a non-trivial factorization $N=pq$ (where $p, q>1$ are integers) or return that $N$ is prime. For "second category" algorithms, the running time depends solely on the size of the integer to be factored

Related Problems

Related: Integer Factoring


$n$: number of bits in the integer

Table of Algorithms

Currently no algorithms in our database for the given problem.