Testing an integer for prime or composite character. Probabilisitc tests yield an answer with high probability of correctness, primality proofs yield an answer which is certain to be correct, often with a certificate of primality which can be verified more easily than the original proof.
Least Primitive Root of Prime Numbers
-
Empirical and statistical results showing the smallest base required to prove a number is prime. Includes theory and conjectures.
4.
Lucas Sequences in Cryptography
-
Focus on their use in primality testing, with pseudo-code. Includes an explanation of the strong Lucas PRP test.