Computational Cryptography

Herausgeber: Bos, Joppe; Stam, Martijn

• Broschiertes Buch

Produktbeschreibung

This book covers the various hard mathematical problems used in cryptography and on which cybersecurity is built, as well as recent advances on how to solve these problems from a theoretic and practical applied perspective. Students and security engineers will benefit from these leading experts' overviews of computational cryptography.

Produktdetails

• London Mathematical Society Lecture Note Series
• Verlag: Cambridge University Press
• Seitenzahl: 400
• Erscheinungstermin: 1. Februar 2022
• Englisch
• Abmessung: 229mm x 152mm x 23mm
• Gewicht: 582g
• ISBN-13: 9781108795937
• ISBN-10: 1108795935
• Artikelnr.: 62111112

Inhaltsangabe

1. Introduction Joppe Bos and Martijn Stam
Part I. Crytanalysis: 2. Lattice attacks on NTRU and LWE - a history of refinements Martin Albrecht and Léo Ducas
3. History of integer factorization Samuel Wagstaff, Jr.
4. Lattice-based integer factorization - an introduction to Coppersmith's Method Alexander May
5. Computing discrete logarithms Rob Granger and Antoine Joux
6. RSA, DH, and DSA in the wild Nadia Heninger
7. A survey of chosen-prefix collisions attacks Marc Stevens
Part II. Implementations: 8. Efficient modular arithmetic Joppe Bos, Thorsten Kleinjung and Daniel Page
9. Arithmetic software libraries Victor Shoup
10. XTR and Tori Martijn Stam
11. History of cryptographic key sizes Nigel Smart and Emmanuel Thomé.