First Page | Document Content | |
---|---|---|
Date: 2003-03-04 03:28:40Mathematics Primality tests Number theory Cryptography Integer sequences Prime number Primality certificate Integer factorization Fermat number Mersenne prime Pseudoprime Randomized algorithm | LNCSFaster Primality TestingAdd to Reading ListSource URL: www.math.ru.nlDownload Document from Source WebsiteFile Size: 331,82 KBShare Document on Facebook |
Pseudoprimes and Carmichael Numbers Emily Riemer MATH0420 May 3,DocID: 1mNn0 - View Document | |
FourQ: four dimensional decompositions on a Q-curve over the Mersenne primeDocID: 1lWqr - View Document | |
LNCSFaster Primality TestingDocID: 1lq38 - View Document | |
On the largest prime factor of the Mersenne numbers Kevin Ford Department of Mathematics The University of Illinois at Urbana-Champaign Urbana Champaign, IL 61801, USADocID: 1lcEp - View Document | |
University of Utah Department of Mathematics January 2004 Volume 4, Number 4DocID: 19K5y - View Document |