Table of contents
Generating Strong Prime Numbers Using Probabilistic Tests for Primality
Prime Numbers
Probabilistic Primality Testing
Strong Pseudoprime
Rabin-Miller Strong Pseudoprime Test
Rabin-Miller Algorithm
Eliminating Composites
Rabin-Miller algorithm characteristics
Minimal number of Iterations required to obtain prob. Error < 2-100
Time of Rabin-Miller Test
Lucas-Lehmer Test
Strong Lucas Probable Prime Test with parameter (P,Q)
Lucas Test Algorithm
Continued
Speed of Strong Lucas Test
Speed of Lucas-Lehmer Test
Rabin-Miller vs.Lucas Lehmer Test
Grantham-Frobenius
Grantham-Frobenius Algorithm
Quadratic Frobenius Test
Finding Prime Numbers of N-bit
Continued
Continued
|