Elliptic Curve Method of Factorization
GPTKB entity
Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Integer factorization algorithm
|
| gptkbp:alsoKnownAs |
gptkb:ECM
|
| gptkbp:category |
gptkb:Number_theory
Computational mathematics |
| gptkbp:complexity |
Sub-exponential for small factors
|
| https://www.w3.org/2000/01/rdf-schema#label |
Elliptic Curve Method of Factorization
|
| gptkbp:importantFor |
Cryptography
|
| gptkbp:improves |
Pollard's p-1 method (for some cases)
|
| gptkbp:input |
Composite integer
|
| gptkbp:introducedIn |
1985
|
| gptkbp:inventedBy |
gptkb:Hendrik_Lenstra
|
| gptkbp:notableFor |
GMP-ECM
|
| gptkbp:output |
Nontrivial factor of input integer
|
| gptkbp:relatedTo |
gptkb:Elliptic_curve_cryptography
gptkb:Integer_factorization_problem |
| gptkbp:step |
Choose random elliptic curve and point
Compute multiples of the point modulo n Find nontrivial greatest common divisor |
| gptkbp:supportsAlgorithm |
Probabilistic algorithm
|
| gptkbp:usedFor |
Integer factorization
|
| gptkbp:uses |
Elliptic curves over finite fields
|
| gptkbp:bfsParent |
gptkb:Elliptic_Curves
|
| gptkbp:bfsLayer |
8
|