Although a vast 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.
Richard A. Mollin
Chapman & Hall/CRC
Country of Publication:
12 November 2002
Professional and scholarly
Professional & Vocational
A / AS level
Further / Higher Education
History and Basic Cryptographic Concepts. Protocols, Discrete Log, and Diffie-Hellman. Public-Key Cryptography. Probabilistic Primality Tests. Factoring. Security of RSA. Authentication. Key Management. Applications and the Future. Appendices. Solutions to Odd-Numbered Exercises. Bibliography. List of Symbols. Index.
Reviews for RSA and Public-Key Cryptography
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 -Mathematical Reviews 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