Computational Cryptography: Algorithmic Aspects of Cryptology

The area of computational cryptography is dedicated to developing effective methods in algorithmic number theory to improve cryptosystem implementation and cryptanalysis. This book is a tribute to Arjen K. Lenstra, covering his best-known scientific achievements in the field, and is designed for students and security engineers to understand the hard mathematical problems used in cryptography and their practical applications.

\n Format: Paperback / softback
\n Length: 398 pages
\n Publication date: 02 December 2021
\n Publisher: Cambridge University Press
\n

The field of computational cryptography is dedicated to the development of effective methods in algorithmic number theory that enhance the implementation of cryptosystems or further their cryptanalysis. In honor of Arjen K. Lenstra, one of the field's key contributors, this book celebrates his 65th birthday by showcasing his most renowned scientific achievements. Students and security engineers will find this straightforward introduction to the challenging mathematical problems used in cryptography and on which cybersecurity is built invaluable. It provides an overview of recent advancements in solving these problems from both theoretical and practical applied perspectives. The book begins with polynomials and delves into the celebrated Lenstra–Lenstra–Lovász lattice reduction algorithm, before progressing to integer factorization and its implications for selecting strong cryptographic keys for widespread use in standards.

\n Weight: 582g\n
Dimension: 153 x 230 x 28 (mm)\n
ISBN-13: 9781108795937\n \n