Factoring RSA moduli
Factor balanced semiprimes without supplied structure or partial key information. Asymptotic bounds are separate from concrete challenge factorizations.
2 variants · 3 entries. Compare bounds only within the same variant.
COMPARISON VARIANTREGIME / INSTANCEENTRIESBEST c
RSA factoringBalanced semiprimes · classical heuristicClassical · HeuristicNo special polynomial form, partial factors or weak keys suppliedRSA-type balanced semiprimes21.901884 RSA factoringBalanced semiprimes · quantumQuantum · ProvableLogical quantum computation with polynomial classical post-processingRSA-type balanced semiprimes1—