Привіт Гість ( Вхід | Реєстрація )
![]() ![]() |
| nikelong |
Feb 22 2009, 12:23
Пост
#1
|
|
Тера ранчер ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() Група: Trusted Members Повідомлень: 11 909 З нами з: 19-March 05 Користувач №: 92 Стать: Чол |
![]() ECCp-109 www.nd.edu/~cmonico/eccp109 http://www.rechenkraft.net/wiki/index.php?title=ECCp-109 The ECCp-109 Challenge was a distributed effort to solve Certicom's ECCp-109 challenge and set "a new world record in characteristic p elliptic curve discrete log computation." The project won Certicom's $10,000 (US) prize: each of the two people who found the winning curve received $1,000 (US) and the remaining $8,000 (US) was given to the Free Software Foundation. After 68,228,567 total distinguished points were found, the solution was discovered to be k=281183840311601949668207954530684. http://tech.groups.yahoo.com/group/ECCChallenge/ Количество участников - 10,308 Це повідомлення відредагував nikelong: Mar 9 2009, 22:13 |
![]() ![]() |
|
Lo-Fi Версія | Поточний час: 3rd November 2025 - 01:23 |