Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
integer factorization algorithm
|
| gptkbp:complexity |
sub-exponential
|
| gptkbp:field |
cryptography
number theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Pollard's p-1 algorithm
|
| gptkbp:input |
composite integer n
|
| gptkbp:introducedIn |
1974
|
| gptkbp:inventedBy |
gptkb:John_Pollard
|
| gptkbp:limitation |
ineffective if all p-1 have large prime factors
|
| gptkbp:namedAfter |
gptkb:John_Pollard
|
| gptkbp:notableFor |
gptkb:RSA_cryptanalysis
|
| gptkbp:output |
nontrivial factor of n
|
| gptkbp:purpose |
factorization of composite numbers
|
| gptkbp:relatedTo |
gptkb:Elliptic_curve_factorization
gptkb:Pollard's_rho_algorithm |
| gptkbp:step |
choose a bound B
compute a^M mod n compute gcd(a^M - 1, n) |
| gptkbp:suitableFor |
numbers with a prime factor p such that p-1 is smooth
|
| gptkbp:uses |
modular exponentiation
|
| gptkbp:bfsParent |
gptkb:Jon_Pollard
|
| gptkbp:bfsLayer |
6
|