Chapman and Hall/CRC
304 pages | 10 B/W Illus.
Although much literature exists on the subject of RSA and public-key cryptography, until now there has been no single source that reveals recent developments in the area at an accessible level. Acclaimed author Richard A. Mollin brings together all of the relevant information available on public-key cryptography (PKC), from RSA to the latest applications of PKC, including electronic cash, secret broadcasting, secret balloting systems, various banking and payment protocols, high security logins, smart cards, and biometrics. Moreover, he covers public-key infrastructure (PKI) and its various security applications.
Throughout the book, Mollin gives a human face to cryptography by including nearly 40 biographies of the individuals who helped develop cryptographic concepts. He includes a number of illustrative and motivating examples, as well as optional topics that go beyond the basics, such as Lenstra's elliptic curve method and the number field sieve. From history and basic concepts to future trends and emerging applications, this book provides a rigorous and detailed treatment of public-key cryptography. Accessible to anyone from the senior undergraduate to the research scientist, RSA and Public-Key Cryptography offers challenging and inspirational material for all readers.
"It is intended as a textbook, and features a nice selection of problems at the end of each section. It is good to see a book pitched for the mathematics"
"This textbook is a welcome addition to the existing cryptographic literature. It provides all the necessary preliminaries, such as primality testing and integer factorization algorithms. Additionally, such practically important issues as timing and power attacks as well as small public exponent attacks are described."
-Mathematics of Computation
HISTORY AND BASIC CRYPTOGRAPHIC CONCEPTS
Classification of Attacks
PROTOCOLS, DISCRETE LOG, AND DIFFIE-HELLMAN
The Discrete Log Problem
Exponentiation Ciphers and Diffie-Hellman
Public-Key Cryptosystems and RSA
Symmetric vs. Asymmetric Cryptosystems
Secret History of Public-Key Cryptography
PROBABILISTIC PRIMALITY TESTS
Pseudoprimes and Carmichael Numbers
Universal Exponent Method
Pollard's p - 1 Method
Lenstra's Elliptic Curve Method
Multipolynomial Quadratic Sieve
The Number Field Sieve
SECURITY OF RSA
Generation of Random Primes
Identification, Impersonation, & Signatures
Digital Signature Schemes
Digital Cash and Electronic Commerce
Public-Key Infrastructure (PKI)
APPLICATIONS AND THE FUTURE
Secrecy and Authentication
Other Threats to System Security
Smart Cards and Biometrics
Letter Frequency Analysis
Elementary Complexity Theory
Solutions to Odd-Numbered Exercises
List of Symbols