Integer Factoring (Integer Factoring)

Description

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 "first category" algorithms, the running time depends on the size of smallest prime factor.

Related Problems

Related: Smallest Factor

Parameters

n: number of bits in the integer

B: bound parameter (if needed)

Table of Algorithms

Currently no algorithms in our database for the given problem.

Time Complexity graph

Space Complexity graph

Pareto Decades graph