An Introduction to Cryptography

INTRODUCTION FOR THE UNINITIATED Heretofore, there has been no suitable introductory book that provides a solid mathematical treatment of cryptography for students with little or no background in number theory. By presenting the necessary mathematics as needed, An Introduction to Cryptography superbly fills that void. Although it is intended for the undergraduate student needing an introduction to the subject of cryptography, it contains enough optional, advanced material to challenge even the most informed reader, and provides the basis for a second course on the subject. Beginning with an overview of the history of cryptography, the material covers the basics of computer arithmetic and explores complexity issues. The author then presents three comprehensive chapters on symmetric-key cryptosystems, public-key cryptosystems, and primality testing. There is an optional chapter on four factoring methods: Pollard's p-1 method, the continued fraction algorithm, the quadratic sieve, and the number field sieve. Another optional chapter contains detailed development of elliptic curve cryptosystems, zero-knowledge, and quantum cryptography. He illustrates all methods with worked examples and includes a full, but uncluttered description of the numerous cryptographic applications. SUSTAINS INTEREST WITH ENGAGING MATERIAL Throughout the book, the author gives a human face to cryptography by including more than 50 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 presented in the core data. With an extensive index and a list of symbols for easy reference, An Introduction to Cryptography is the essential fundamental text on cryptography.