Arjen K. Lenstra is Professor of Computer Science at École Polytechnique Fédérale de Lausanne. His research focuses on cryptography and computational number theory, especially in areas such as integer factorization. He was closely involved in the development of the number field sieve method for integer factorization as well as several other cryptologic results. He is the recipient of the Excellence in the Field of Mathematics RSA Conference 2008 Award and a Fellow of the International Association for Cryptologic Research (IACR).
4 Ebooks bởi Arjen K. Lenstra
Arjen K. Lenstra & Hendrik W.Jr. Lenstra: Development of the Number Field Sieve
The number field sieve is an algorithm for finding the prime factors of large integers. It depends on algebraic number theory. Proposed by John Pollard in 1988, the method was used in 1990 to factor …
PDF
Anh
DRM
€44.80
Juan Garay & Arjen K. Lenstra: Information Security
The 10th Information Security Conference (ISC 2007) was held in Valpara’ ?so, Chile, October 9-12, 2007. ISC is an annual international conference covering research in theory and applications of info …
PDF
Anh
DRM
€57.46