The shortest vector in a lattice is hard to approximate to within some constant
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear EquationsJournal of Computer and System Sciences, 1997
- “Pseudo-random” number generation within cryptographic algorithms: The DDS casePublished by Springer Nature ,1997
- Solving Simultaneous Modular Equations of Low DegreeSIAM Journal on Computing, 1988
- Reconstructing Truncated Integer Variables Satisfying Linear CongruencesSIAM Journal on Computing, 1988
- On the Lagarias-Odlyzko Algorithm for the Subset Sum ProblemSIAM Journal on Computing, 1986
- Factoring multivariate polynomials over finite fieldsJournal of Computer and System Sciences, 1985
- Solving low-density subset sum problemsJournal of the ACM, 1985
- Factoring multivariate integral polynomialsTheoretical Computer Science, 1984
- Improved algorithms for integer programming and related lattice problemsPublished by Association for Computing Machinery (ACM) ,1983
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982