Revision #401 → #1318 · back to history
addedInteger factorizationc1a1aaf99c1f
addedComposite and prime numbers58dde2c2897b
added15 composite, 7 primeec4eb5b70865
addedFactorization of 60c2955b84ec81
addedPrime factorization theorem73146b07878b
addedTrial division3b0168695141
addedSemiprimes (hardest instances)2a89ee760e17
addedFundamental theorem of arithmetic9c176fcb60f1
addedTrial division on n = 171·p·qa78fe9293835
addedFermat's method on 13729·1372933·1884899716127b59d437677
addedRSA-240 factorizationf4affc8b2d5d
addedRSA-250 factorization2d89003e93c2
addedNo known polynomial-time factoring algorithm280d262f2e27
addedGNFS sub-exponential running timed18c6369a526
addedShor's algorithm complexitya0b7293459b6
addedFactorization in NP and co-NPead26bd11613
addedFactorization in UP and co-UP130675aefe98
addedFactorization in BQPb8deb82270f2
addedPrimality in polynomial time (AKS)ba125b2fc683
addedDecision problem (Integer factorization)56c59dbe982a
addedCategory 1 (special-purpose) algorithmsc4ad0342112e
addedGeneral-purpose (Category 2) algorithms4ebf66f0625c
addedHeuristic L-notation running time519cf3e8c4f6
addedSchnorr–Seysen–Lenstra rigorous running time4c14eeac6f05
addedClass group G_Δ of binary quadratic forms86f44a40a00e
addedSchnorr–Seysen–Lenstra algorithm1c8a285295da
addedSet P_Δ of primes with Kronecker symbol 1cd425212d7de
addedAmbiguous form5adac090b64b
addedExpected running time of Schnorr–Seysen–Lenstraee2eb1962d6a