000			a
999			_c30659 _d30659
008			220419b xxu||||| |||| 00| 0 eng d
020			_a9781108795937
082			_a005.824 _bBOS
100			_aBos, Joppe W. ed.
245			_aComputational cryptography : algorithmic aspects of cryptology
260			_bCambridge University Press, _c2022 _aCambridge :
300			_axii, 387 p. ; _bill., _c23 cm
365			_b75.00 _cGBP _d104.80
490			_aLondon Mathematical Society lecture note series ; _v469
504			_aIncludes bibliographical references and index.
520			_aThe 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.
650			_aCryptography
650			_aApproximation regime
650			_a BKZ
650			_aCFRAC
650			_aCoppersmith method
650			_aDigital signature
650			_a ElGamel encryption
650			_aGaussian heuristic
650			_aHash function
650			_aIPsec
650			_aL-function
650			_aModular multiplication
650			_aNIST
650			_arho method
650			_aP1 method
650			_aQuantum computer
650			_aSSl
650			_aWiener's attack
650			_aHash function
700			_aStam, Martijn _eed.
942			_2ddc _cBK