Improving Lattice Based Cryptosystems Using the Hermite Normal Form

This publication has 24 references indexed in Scilit:

• Approximating-CVP to within almost-polynomial factors is NP-hard
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Cryptanalysis of the Original McEliece Cryptosystem
  Published by Springer Nature ,2000
• Tensor-Based Trapdoors for CVP and Their Application to Public Key Cryptography (Extended Abstract)
  Published by Springer Nature ,1999
• A Lattice-Based Public-Key Cryptosystem
  Information and Computation, 1999
• The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations
  Journal of Computer and System Sciences, 1997
• A public-key cryptosystem with worst-case/average-case equivalence
  Published by Association for Computing Machinery (ACM) ,1997
• Generating hard instances of lattice problems (extended abstract)
  Published by Association for Computing Machinery (ACM) ,1996
• An upper bound on the average number of iterations of the LLL algorithm
  Theoretical Computer Science, 1994
• Random oracles are practical
  Published by Association for Computing Machinery (ACM) ,1993
• On Lovász’ lattice reduction and the nearest lattice point problem
  Combinatorica, 1986