A Cryptography Primer - Philip N. Klein

A Cryptography Primer

Secrets and Promises

(Autor)

Buch | Hardcover
186 Seiten
2014
Cambridge University Press (Verlag)
978-1-107-01788-7 (ISBN)
92,25 inkl. MwSt
This accessible introduction for undergraduates explains the cryptographic protocols for privacy and the use of digital signatures for certifying the integrity of messages and programs. It provides a guide to the principles and elementary mathematics underlying modern cryptography, giving readers a look under the hood for security techniques and the reasons they are thought to be secure.
Cryptography has been employed in war and diplomacy from the time of Julius Caesar. In our Internet age, cryptography's most widespread application may be for commerce, from protecting the security of electronic transfers to guarding communication from industrial espionage. This accessible introduction for undergraduates explains the cryptographic protocols for achieving privacy of communication and the use of digital signatures for certifying the validity, integrity, and origin of a message, document, or program. Rather than offering a how-to on configuring web browsers and e-mail programs, the author provides a guide to the principles and elementary mathematics underlying modern cryptography, giving readers a look under the hood for security techniques and the reasons they are thought to be secure.

Philip N. Klein is Professor of Computer Science at Brown University. He was a recipient of the National Science Foundation's Presidential Young Investigator Award, and has received multiple research grants from the National Science Foundation. He has been made an ACM Fellow in recognition of his contributions to research on graph algorithms. He is a recipient of Brown University's Award for Excellence in Teaching in the Sciences.

1. Introduction; 2. Modular arithmetic; 3. The addition cypher, an insecure block cypher; 4. Functions; 5. Probability theory; 6. Perfect secrecy and perfectly secure cryptosystems; 7. Number theory; 8. Euclid's algorithm; 9. Some uses of perfect secrecy; 10. Computational problems, easy and hard; 11. Modular exponentiation, modular logarithm, and one-way functions; 12. Diffie and Hellman's exponential-key-agreement protocol; 13. Computationally secure single-key cryptosystems; 14. Public-key cryptosystems and digital signatures.

Zusatzinfo 72 Line drawings, unspecified
Verlagsort Cambridge
Sprache englisch
Maße 155 x 235 mm
Gewicht 420 g
Themenwelt Informatik Netzwerke Sicherheit / Firewall
Informatik Theorie / Studium Kryptologie
ISBN-10 1-107-01788-2 / 1107017882
ISBN-13 978-1-107-01788-7 / 9781107017887
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Konzepte – Verfahren – Protokolle

von Claudia Eckert

Buch | Hardcover (2023)
De Gruyter Oldenbourg (Verlag)
94,95