Computational cryptography[electronic resource] :algorithmic aspects of cryptology

  • 其他作者: Bos, Joppe W. , Stam, Martijn.
  • 出版: Cambridge : Cambridge University Press 2021.
  • 稽核項: xii, 387 p. :ill., digital ;24 cm.
  • 叢書名: London Mathematical Society lecture note series ;469
  • 標題: Cryptography.
  • ISBN: 1108795935 , 9781108795937
  • 試查全文@TNUA:
  • 附註: Title from publisher's bibliographic system (viewed on 11 Nov 2021).
  • 摘要: 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.
  • 電子資源: https://dbs.tnua.edu.tw/login?url=https://doi.org/10.1017/9781108854207
  • 系統號: 005331472
  • 資料類型: 電子書
  • 讀者標籤: 需登入
  • 引用網址: 複製連結