<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2011-06-18 16:29:05Numbers Strong pseudoprime Lucas pseudoprime Primality test Prime number Baillie–PSW primality test Carmichael number Integer factorization Probable prime Pseudoprimes Mathematics Number theory |
| This is a Chapter from the Handbook of Applied Cryptography, by A. Menezes, P. van Oorschot, and S. Vanstone, CRC Press, 1996. For further information, see www.cacr.math.uwaterloo.ca/hac CRC Press has granted the followiDocID: Ra8O - View Document |
| Carmichael numbers and pseudoprimes Notes by G.J.O. Jameson Introduction Recall that Fermat’s “little theorem” says that if p is prime and a is not a multiple of p, then ap−1 ≡ 1 mod p.DocID: cX8l - View Document |
| ARE THERE COUNTER-EXAMPLES TO THE BAILLIE – PSW PRIMALITY TEST? Carl Pomerance 1984 to Arjen K. Lenstra on the defense of his doctoral thesisDocID: 8Hid - View Document |
| Preliminary thoughts Primality testsDocID: 5jRe - View Document |
| PDF DocumentDocID: 1nTs - View Document |