The Two Faces of Lattices in Cryptology

This publication has 73 references indexed in Scilit:

• The hardness of the closest vector problem with preprocessing
  IEEE Transactions on Information Theory, 2001
• Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
  Information Processing Letters, 1999
• NTRU: A ring-based public key cryptosystem
  Published by Springer Nature ,1998
• A Montgomery-like square root for the Number Field Sieve
  Published by Springer Nature ,1998
• Eliminating decryption errors in the Ajtai-Dwork Cryptosystem
  Published by Springer Nature ,1997
• Improved low-density subset sum algorithms
  computational complexity, 1992
• Cryptanalysis of short RSA secret exponents
  IEEE Transactions on Information Theory, 1990
• A more efficient algorithm for lattice basis reduction
  Journal of Algorithms, 1988
• Hiding information and signatures in trapdoor knapsacks
  IEEE Transactions on Information Theory, 1978
• New directions in cryptography
  IEEE Transactions on Information Theory, 1976