Preface to the Second Edition.- Preface to the First Edition.- Number-Theoretic Preliminaries.- Problems in Number Theory. Divisibility Properties. Euclid's Algorithm and Continued Fractions. Arithmetic Functions. Linear Congruences. Quadratic Congruences. Primitive Roots and Power Residues. Arithmetic of Elliptic Curves. Chapter Notes and Further Reading.- Primality Testing and Prime Generation.- Computing with Numbers and Curves. Riemann Zeta and Dirichlet L Functions. Rigorous Primality Tests. Compositeness and Pseudoprimality Tests. Lucas Pseudoprimality Test. Elliptic Curve Primality Tests. Superpolynomial-Time Tests. Polynomial-Time Tests. Primality Tests for Special Numbers. Prime Number Generation. Chapter Notes and Further Reading.- Integer Factorization and Discrete Logarithms.- Introduction. Simple Factoring Methods. Elliptic Curve Method (ECM). General Factoring Congruence. Continued FRACtion Method (CFRAC). Quadratic Sieve (QS). Number Field Sieve (NFS). Quantum Factoring Algorithm. Discrete Logarithms. kth Roots. Elliptic Curve Discrete Logarithms. Chapter Notes and Further Reading.- Number-Theoretic Cryptography.- Public-Key Cryptography. RSA Cryptosystem. Rabin Cryptography. Quadratic Residuosity Cryptography. Discrete Logarithm Cryptography. Elliptic Curve Cryptography. Zero-Knowledge Techniques. Deniable Authentication. Non-Factoring Based Cryptography. Chapter Notes and Further Reading.- Bibliography.- Index.- About the Author.

The Primality Testing Problem (PTP) has now proved to be solvable in deterministic polynomial-time (P) by the AKS (Agrawal-Kayal-Saxena) algorithm, whereas the Integer Factorization Problem (IFP) still remains unsolvable in (P). There is still no polynomial-time algorithm for IFP. Many practical public-key cryptosystems and protocols such as RSA (Rivest-Shamir-Adleman) rely their security on computational intractability of IFP.
Primality Testing and Integer Factorization in Public Key Cryptography, Second Edition, provides a survey of recent progress in primality testing and integer factorization, with implications to factoring based public key cryptography. Notable new features are the comparison of Rabin-Miller probabilistic test in RP, Atkin-Morain elliptic curve test in ZPP and AKS deterministic test.
This volume is designed for advanced level students in computer science and mathematics, and as a secondary text or reference book; suitable for practitioners and researchers in industry.