Lattice Enumeration Using Extreme Pruning
Top Cited Papers
- 1 January 2010
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Finding short lattice vectors within mordell's inequalityPublished by Association for Computing Machinery (ACM) ,2008
- Predicting Lattice ReductionPublished by Springer Science and Business Media LLC ,2008
- Improved Analysis of Kannan’s Shortest Lattice Vector AlgorithmPublished by Springer Science and Business Media LLC ,2007
- Lattice problems in NP ∩ coNPJournal of the ACM, 2005
- Sampling short lattice vectors and the closest lattice vector problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Closest point search in latticesIEEE Transactions on Information Theory, 2002
- A sieve algorithm for the shortest lattice vector problemPublished by Association for Computing Machinery (ACM) ,2001
- Improved low-density subset sum algorithmscomputational complexity, 1992
- A random polynomial-time algorithm for approximating the volume of convex bodiesJournal of the ACM, 1991
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity AnalysisMathematics of Computation, 1985