Algebraic-group factorisation algorithm

Algebraic-group factorisation algorithm
Results: 2

#	Item
1	THE ELLIPTIC CURVE METHOD PAUL ZIMMERMANN The Elliptic Curve Method (ECM for short) was invented in 1985 by H. W. Lenstra, Jr[removed]It is suited to find small — say 9 to 30 digits — prime factors of large numbers. Am Add to Reading List Source URL: www.loria.fr Language: English - Date: 2004-09-06 05:03:02 Cryptography Lenstra elliptic curve factorization Quadratic sieve Integer factorization Elliptic curve Primality test Prime number Prime factor Algebraic-group factorisation algorithm Integer factorization algorithms Abstract algebra Mathematics
2	Edwards Curves and the ECM Factorisation Method Peter Birkner Eindhoven University of Technology Fields Cryptography Retrospective Meeting Add to Reading List Source URL: www.fields.utoronto.ca Language: English - Date: 2009-05-14 13:31:42 Group theory Lenstra elliptic curve factorization Elliptic curve Elliptic curve cryptography Torsion Edwards curve Elliptic curve primality testing Algebraic-group factorisation algorithm Abstract algebra Finite fields Integer factorization algorithms

UPDATE