This text introduces cryptography, from its earliest roots to cryptosystems used today for secure online communication.
Beginning with classical ciphers and their cryptanalysis, this book proceeds to focus on modern public key cryptosystems such as Diffie-Hellman, ElGamal, RSA, and elliptic curve cryptography with an analysis of vulnerabilities of these systems and underlying mathematical issues such as factorization algorithms. Specialized topics such as zero knowledge proofs, cryptographic voting, coding theory, and new research are covered in the final section of this book.
Aimed at undergraduate students, this book contains a large selection of problems, ranging from straightforward to difficult, and can be used as a textbook for classes as well as self-study. Requiring only a solid grounding in basic mathematics, this book will also appeal to advanced high school students and amateur mathematicians interested in this fascinating and topical subject.

Outlines cryptography from its earliest roots to its modern use in daily transactions Contains numerous problems to practice techniques Examines classical ciphers, modern public key cryptosystems, and specialized topics

Autorentext

Simon Rubinstein-Salzedo received his PhD in mathematics from Stanford University in 2012. Afterwards, he taught at Dartmouth College and Stanford University. In 2015, he founded Euler Circle, a mathematics institute in the San Francisco Bay Area, dedicated to teaching college-level mathematics classes to advanced high-school students, as well as mentoring them on mathematics research. His research interests include number theory, algebraic geometry, combinatorics, probability, and game theory.

Inhalt
Introduction. -1. A quick overview. -2. Caesar ciphers. -3. Substitution ciphers. -4. A first look at number theory. -5. The Vigenère cipher. -6. The Hill Cipher. -7. Other types of ciphers. -8. Big O notion and algorithm efficiency. -9. Abstract Algebra. -10. A second look at number theory. -11. The Diffie-Hellman Cryptosystem and the Discrete Logarithm Problem. -12. The RSA Cryptosystem. -13. Clever factorization algorithms and primality testing. -14. Elliptic curves. -15. The versatility of elliptic curves. -16. Zero-Knowledge Proofs. -17. Secret sharing, visual cryptography, and voting. -18. Quantum Computing and Quantum Cryptography. -19. Markov chains. -20. Some coding theory. Bibliography. Index.