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.
"synopsis" may belong to another edition of this title.
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 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.
"About this title" may belong to another edition of this title.
£ 10.81 shipping from U.S.A. to United Kingdom
Destination, rates & speedsSeller: Books From California, Simi Valley, CA, U.S.A.
paperback. Condition: Good. Shipping lable on the front of the cover from past owner. Seller Inventory # mon0003746431
Quantity: 1 available
Seller: Books From California, Simi Valley, CA, U.S.A.
paperback. Condition: Very Good. Seller Inventory # mon0003746068
Quantity: 6 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition. Seller Inventory # 42947783
Quantity: 4 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 42947783-n
Quantity: 4 available
Seller: Chiron Media, Wallingford, United Kingdom
Paperback. Condition: New. Seller Inventory # 6666-IUK-9781108795937
Quantity: 10 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9781108795937_new
Quantity: Over 20 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 42947783
Quantity: 4 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 580. Seller Inventory # C9781108795937
Quantity: Over 20 available
Seller: CitiRetail, Stevenage, United Kingdom
Paperback. Condition: new. Paperback. 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 LenstraLenstraLovasz 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. 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9781108795937
Quantity: 1 available
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 400 pages. 9.06x5.94x0.87 inches. In Stock. This item is printed on demand. Seller Inventory # __1108795935
Quantity: 1 available