ECMNET |
Привіт Гість ( Вхід | Реєстрація )
ECMNET |
nikelong |
Feb 9 2009, 20:58
Пост
#1
|
Тера ранчер Група: Trusted Members Повідомлень: 11 909 З нами з: 19-March 05 Користувач №: 92 Стать: Чол |
Introduction to ECM
What does ECM mean? ECM stands for Elliptic Curve Method. It is currently the best algorithm known, among those whose complexity depends mainly on the size of the factor found (and not on the total size of the number to be factored, as in QS or NFS). History. Richard Brent has predicted in 1985 in a paper entitled Some Integer Factorization Algorithms using Elliptic Curves that factors up to 50 digits could by found by ECM. Indeed, Peter Montgomery found in November 1995 a factor of 47 digits of 5^256+1, and Richard Brent set in October 1997 a new genuine record with a factor of 48 digits of 24^121+1. Goal. The goal of ECMNET is to find large factors by ecm, mainly by contributing to the Cunningham project. http://www.loria.fr/~zimmerma/records/ecmnet.html http://www.rechenkraft.net/wiki/index.php?title=ECMNET -------------------- |
Lo-Fi Версія | Поточний час: 26th April 2024 - 14:05 |