Skip to content
Register Sign in Wishlist

Computational Cryptography
Algorithmic Aspects of Cryptology

$104.00 (C)

Part of London Mathematical Society Lecture Note Series

Joppe Bos, Martijn Stam, Martin Albrecht, Léo Ducas, Samuel Wagstaff, Jr., Alexander May, Rob Granger, Antoine Joux, Nadia Heninger, Marc Stevens, Thorsten Kleinjung, Daniel Page, Victor Shoup, Nigel Smart, Emmanuel Thomé
View all contributors
  • Date Published: February 2022
  • availability: Available
  • format: Paperback
  • isbn: 9781108795937

$ 104.00 (C)

Add to cart Add to wishlist

Other available formats:

Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • 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.

    • 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
    Read more

    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

    ‘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

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: February 2022
    • 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é.

  • Editors

    Joppe Bos, NXP Semiconductors, Belgium
    Joppe W. Bos is a cryptographic researcher in the Competence Center for Crypto & Security at NXP Semiconductors, Leuven, Belgium. Previously, he was a post-doctoral researcher in the Cryptography Research Group at Microsoft Research and obtained his PhD at EPFL, Lausanne, Switzerland. His research focuses on computational number theory and high-performance arithmetic as used in (post-quantum) public-key cryptography. He is the editor of the book Topics in Computational Number Theory Inspired by Peter L. Montgomery and serves as the Editor of the Cryptology ePrint Archive, and he is elected as the Secretary of the International Association for Cryptologic Research.

    Martijn Stam, Simula UiB, Norway
    Martijn Stam is a Chief Research Scientist in cryptology at Simula UiB, Bergen, Norway. Previously, he was a Reader in Cryptology at the University of Bristol, UK and a postdoc at EPFL Switzerland. He obtained his PhD at the TU Eindhoven in the Netherlands. His research ranges a wide area of cryptologic research, with an emphasis on a mathematical and algorithmic perspective. He has won two FSE Best Paper Awards and served as elected Secretary of the IACR from 2011 to 2016.


    Joppe Bos, Martijn Stam, Martin Albrecht, Léo Ducas, Samuel Wagstaff, Jr., Alexander May, Rob Granger, Antoine Joux, Nadia Heninger, Marc Stevens, Thorsten Kleinjung, Daniel Page, Victor Shoup, Nigel Smart, Emmanuel Thomé

Related Books

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

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.

Please fill in the required fields in your feedback submission.