Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
integer factorization algorithm
|
| gptkbp:category |
gptkb:algorithm
factorization algorithm |
| gptkbp:complexity |
O(sqrt(p))
|
| gptkbp:field |
cryptography
number theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Pollard's rho algorithm
|
| gptkbp:input |
composite integer n
|
| gptkbp:introducedIn |
1975
|
| gptkbp:inventedBy |
gptkb:John_Pollard
|
| gptkbp:namedAfter |
gptkb:John_Pollard
|
| gptkbp:notableFor |
efficiency for numbers with small factors
|
| gptkbp:output |
nontrivial factor of n
|
| gptkbp:purpose |
factorization of composite numbers
|
| gptkbp:relatedTo |
gptkb:Floyd's_cycle-finding_algorithm
gptkb:Pollard's_p-1_algorithm |
| gptkbp:uses |
randomized algorithm
|
| gptkbp:bfsParent |
gptkb:Floyd's_cycle-finding_algorithm
gptkb:Jon_Pollard |
| gptkbp:bfsLayer |
6
|