The inapproximability of lattice and coding problems with preprocessing

This publication has 18 references indexed in Scilit:

• Improved cryptographic hash functions with worst-case/average-case connection
  Published by Association for Computing Machinery (ACM) ,2002
• Improving Lattice Based Cryptosystems Using the Hermite Normal Form
  Published by Springer Nature ,2001
• Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation
  Published by Springer Nature ,2001
• The hardness of the closest vector problem with preprocessing
  IEEE Transactions on Information Theory, 2001
• The rise and fall of knapsack cryptosystems
  Published by American Mathematical Society (AMS) ,1991
• The hardness of solving subset sum with preprocessing
  IEEE Transactions on Information Theory, 1990
• The hardness of decoding linear codes with preprocessing
  IEEE Transactions on Information Theory, 1990
• Solvability by radicals is in polynomial time
  Journal of Computer and System Sciences, 1985
• Integer Programming with a Fixed Number of Variables
  Mathematics of Operations Research, 1983
• Factoring polynomials with rational coefficients
  Mathematische Annalen, 1982