Talk:Elliptic curve primality
Latest comment: 2 years ago by Mfb in topic Larger prime found
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||||
| |||||||||||||||||||||
 | Text and/or other creative content from this version of Elliptic curve primality proving was copied or moved into Elliptic curve primality testing with this edit. The former page's history now serves to provide attribution for that content in the latter page, and it must not be deleted as long as the latter page exists. |
Merge
editThis page should be merged with the page the same topic at Elliptic curve primality proving. This one is more detailed. I won't find time for this. TLange (talk) 19:33, 28 February 2010 (UTC)
Alternative link
editThe link for Morain, Francois, Implementation of the Atkin–Goldwasser–Kilian Primality Testing Algorithm, https://eprints.kfupm.edu.sa/44864/1/44864.pdf is broken. I've found another version at http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.6932 but I'm unsure how to proceed / how "stable" the citeseer URL would be. jmbreuer (talk) 18:30, 13 September 2013 (UTC)
Larger prime found
editApparently 10^50,000 + 65,859 is prime, as verified by this method. Announcement here, but an independent source would be better. --mfb (talk) 10:03, 14 May 2022 (UTC)