Improved cryptographic hash functions with worst-case/average-case connection

This publication has 10 references indexed in Scilit:

• Complexity of Lattice Problems
  Published by Springer Nature ,2002
• Improving Lattice Based Cryptosystems Using the Hermite Normal Form
  Published by Springer Nature ,2001
• A sieve algorithm for the shortest lattice vector problem
  Published by Association for Computing Machinery (ACM) ,2001
• The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
  SIAM Journal on Computing, 2001
• On the Limits of Nonapproximability of Lattice Problems
  Journal of Computer and System Sciences, 2000
• On the complexity of computing short linearly independent vectors and short bases in a lattice
  Published by Association for Computing Machinery (ACM) ,1999
• Generating hard instances of lattice problems (extended abstract)
  Published by Association for Computing Machinery (ACM) ,1996
• Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
  Combinatorica, 1990
• On Lovász’ lattice reduction and the nearest lattice point problem
  Combinatorica, 1986
• The complexity of computing the covering radius of a code
  IEEE Transactions on Information Theory, 1984