First Page | Document Content | |
---|---|---|
![]() Date: 2010-12-10 09:14:54Number theory Finite fields Primality tests Integer sequences Quadratic sieve Lenstra elliptic curve factorization Prime numbers General number field sieve Miller–Rabin primality test Integer factorization algorithms Abstract algebra Mathematics | Source URL: fs.gallup.unm.eduDownload Document from Source WebsiteFile Size: 5,03 MBShare Document on Facebook |
![]() | 02157 Functional Programming - SequencesDocID: 1rsIU - View Document |
![]() | Annales Univ. Sci. Budapest., Sect. Comp–27 PRIMALITY PROOFS WITH ELLIPTIC CURVES: HEURISTICS AND ANALYSIS Wieb Bosma, Eric Cator (Nijmegen, The Netherlands)DocID: 1r1GB - View Document |
![]() | Algorithmic Number Theory MSRI Publications Volume 44, 2008 Four primality testing algorithms RENE´ SCHOOFDocID: 1qY4T - View Document |
![]() | DIMACS Technical ReportJuly 1995 A Formal Framework for Evaluating Heuristic Programs 1 byDocID: 1qhCO - View Document |
![]() | The Million-Key Question—Investigating the Origins of RSA Public Keys Petr Švenda, Matúš Nemec, Peter Sekan, Rudolf Kvašňovský, David Formánek, David Komárek, and Vashek Matyáš, Masaryk University https://wwwDocID: 1q9Fs - View Document |