Prime Numbers and Factorization
Alan G. Konheim · 2006
This chapter contains sections titled: Number Theory and Cryptography Prime Numbers and the Sieve of Eratosthenes Pollard's p – 1 Method Pollard's ρ-Algorithm Quadratic Residues Random Factorization The Quadratic Sieve (QS) Testing if an Integer is a Prime The RSA Challenge Perfect Numbers and the Mersenne Primes Multiprecision Arithmetic Prime Number Testing and Factorization Problems