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](https://www.pdfsearch.io/img/30c597212cb568aaf8d455e33f94111c.jpg "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") | 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. AmAdd to Reading ListSource URL: www.loria.frLanguage: English - Date: 2004-09-06 05:03:02 |
2 | Edwards Curves and the ECM Factorisation Method Peter Birkner Eindhoven University of Technology Fields Cryptography Retrospective MeetingAdd to Reading ListSource URL: www.fields.utoronto.caLanguage: English - Date: 2009-05-14 13:31:42 |