Computational Cryptography
Algorithmic Aspects of Cryptology
£78.99
Part of London Mathematical Society Lecture Note Series
- Editors:
- Joppe Bos, NXP Semiconductors, Belgium
- Martijn Stam, Simula UiB, Norway
- Date Published: December 2021
- availability: Available
- format: Paperback
- isbn: 9781108795937
£
78.99
Paperback
Other available formats:
eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
The area of computational cryptography is dedicated to the development of effective methods in algorithmic number theory that improve implementation of cryptosystems or further their cryptanalysis. This book is a tribute to Arjen K. Lenstra, one of the key contributors to the field, on the occasion of his 65th birthday, covering his best-known scientific achievements in the field. Students and security engineers will appreciate this no-nonsense introduction to the hard mathematical problems used in cryptography and on which cybersecurity is built, as well as the overview of recent advances on how to solve these problems from both theoretical and practical applied perspectives. Beginning with polynomials, the book moves on to the celebrated Lenstra–Lenstra–Lovász lattice reduction algorithm, and then progresses to integer factorization and the impact of these methods to the selection of strong cryptographic keys for usage in widely used standards.
Read more- Featuring contributions by the leading experts in the field, this text covers the various hard mathematical problems used in cryptography and the asymptotically best algorithms to solve these problems
- Presents 20 algorithms with in-depth descriptions on their utility in solving hard problems
- Teaches students what problems are actually used as the foundation to secure all our digital assets, and about the security assessment used in cryptography and how it relates to selecting key-sizes in practice
- Advises security engineers how to avoid common pitfalls when deploying security solutions
- Written in tribute to the scientific research career of Professor Arjen K. Lenstra, on the occasion of his 65th birthday
Reviews & endorsements
'This volume celebrates the research career of Arjen Lenstra. The volume covers the latest research in many areas of applied cryptography: from algorithms for factoring and discrete log, to fast implementations of computer algebra, to the selection of cryptographic key sizes. Each topic is masterfully covered by a top researcher in the respective area. The information covered in this volume will serve readers for many years to come, and is sure to inspire further research on these topics.' Dan Boneh, Stanford University
See more reviews'This book demonstrates the breathtaking diversity of Arjen Lenstra's research over the last forty years, and the deep influence his work has had on computational aspects of cryptography. Each chapter is written by a leading domain expert and provides an “in a nutshell” overview of a specific topic. The book is sure to become an important reference for experts and beginners alike.' Kenneth Paterson, ETH Zurich
'With highly accessible surveys by leading cryptographers, this book hits all pins with a single strike: framing the important area of "computational cryptography" through its fascinating history, peeking into its (no less prominent) future, and celebrating the impactful research career of one of its principal architects, Arjen Lenstra.' Ronald Cramer, CWI Amsterdam and Leiden University
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: December 2021
- format: Paperback
- isbn: 9781108795937
- length: 398 pages
- dimensions: 229 x 153 x 21 mm
- weight: 0.58kg
- availability: Available
Table of Contents
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é.
Related Books
related journals
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email [email protected]
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×