Free Delivery Over $100
|
|
|||
|
||||
OverviewThe 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. Full Product DetailsAuthor: Joppe Bos , Martijn StamPublisher: Cambridge University Press Imprint: Cambridge University Press Dimensions: Width: 15.30cm , Height: 2.10cm , Length: 22.90cm Weight: 0.580kg ISBN: 9781108795937ISBN 10: 1108795935 Pages: 398 Publication Date: 02 December 2021 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Manufactured on demand  We will order this item for you from a manufactured on demand supplier. Table of Contents1. 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é.Reviews'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 Author InformationJoppe 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 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. Tab Content 6Author Website:Countries AvailableAll regions |
||||
