Overview
- 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
Part of the book series: Springer Undergraduate Mathematics Series (SUMS)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (20 chapters)
-
Front Matter
Keywords
About this book
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.
Reviews
“The present book presents a good undergraduate introduction to cryptography from its earliest roots to contemporary cryptosystems. It also contains all the necessary mathematical background for its comprehension and a large selection of problems.” (Dimitros Poulakis, zbMATH 1408.94001, 2019)
“There is certainly a lot of interesting mathematics to be learned here, and the reader will have fun learning it. If I were teaching a course in cryptography, this text would definitely be on my very short list; people teaching a course in number theory who want to discuss some cryptography might also want to keep acopy of this book within easy reach.” (Mark Hunacek, MAA Reviews, January, 2019)Authors and Affiliations
About the author
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.
Bibliographic Information
Book Title: Cryptography
Authors: Simon Rubinstein-Salzedo
Series Title: Springer Undergraduate Mathematics Series
DOI: https://doi.org/10.1007/978-3-319-94818-8
Publisher: Springer Cham
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: Springer Nature Switzerland AG 2018
Softcover ISBN: 978-3-319-94817-1Published: 17 October 2018
eBook ISBN: 978-3-319-94818-8Published: 27 September 2018
Series ISSN: 1615-2085
Series E-ISSN: 2197-4144
Edition Number: 1
Number of Pages: XII, 259
Number of Illustrations: 10 b/w illustrations, 7 illustrations in colour
Topics: Number Theory, Combinatorics