Factoring & RSA
3 problems
IFPInteger factorizationFind the prime factorization of a composite integer N; distinguish input length log N from the integer N itself.6 variants · 13 entriesSmall-factor IFPFinding small prime factorsFind a prime divisor p of an integer N; running time can depend on p independently of the bitlength of N.1 variants · 1 entriesRSA factoringFactoring RSA moduliFactor balanced semiprimes without supplied structure or partial key information. Asymptotic bounds are separate from concrete challenge factorizations.2 variants · 3 entries