Lattice Reduction Algorithms: Theory and Practice

No abstract is available for this paper.

• Publication year

  2011

• Venue

  International Conference on the Theory and Application of Cryptographic Techniques

• Publication date

  2011-05-15

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-20465-4_2
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Improved Nguyen-Vidick heuristic sieve algorithm for shortest vector problem

  2011cited by this paper
• Inapproximability Results for Computational Problems on Lattices

  2010cited by this paper
• Floating-Point LLL: Theoretical and Practical Aspects

  2010cited by this paper
• On the Complexity of Lattice Problems with Polynomial Approximation Factors

  2010cited by this paper
• A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations

  2010cited by this paper
• Using LLL-Reduction for Solving RSA and Factorization Problems

  2010cited by this paper
• Faster exponential time algorithms for the shortest vector problem

  2010cited by this paper
• Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30 - June 3, 2010. Proceedings

  2010cited by this paper
• Hermite's Constant and Lattice Algorithms

  2010cited by this paper
• Lattice Enumeration Using Extreme Pruning

  2010cited by this paper
• An LLL Algorithm with Quadratic Complexity

  2009cited by this paper
• Recent Trends in Cryptography

  2009cited by this paper
• H-LLL: using householder inside LLL

  2009cited by this paper
• The LLL Algorithm - Survey and Applications

  2009influential reference
• Predicting Lattice Reduction

  2008cited by this paper
• Public-key Cryptanalysis

  2008cited by this paper
• Advances in Cryptology - EUROCRYPT 2008, 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13-17, 2008. Proceedings

  2008cited by this paper
• Sieve algorithms for the shortest vector problem are practical

  2008cited by this paper
• Finding short lattice vectors within mordell's inequality

  2008cited by this paper
• Improved Analysis of Kannan's Shortest Lattice Vector Algorithm

  2007cited by this paper
• Advances in Cryptology - CRYPTO 2007, 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007, Proceedings

  2007cited by this paper
• Advances in Cryptology - CRYPTO 2006: 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006, Proceedings (Lecture Notes in Computer Science)

  2006cited by this paper
• LLL on the Average

  2006cited by this paper
• Rankin's Constant and Blockwise Lattice Reduction

  2006cited by this paper
• Closest point search in lattices

  2002cited by this paper
• A sieve algorithm for the shortest lattice vector problem

  2001influential reference
• Segment LLL-Reduction of Lattice Bases

  2001cited by this paper
• Advances in Cryptology — EUROCRYPT ’95

  2001cited by this paper
• Cryptography and Lattices

  2001cited by this paper
• NTRU: A Ring-Based Public Key Cryptosystem

  1998cited by this paper
• The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)

  1998cited by this paper
• The Rise and Fall of Knapsack Cryptosystems

  1998cited by this paper
• Cryptology and Computational Number Theory

  1997cited by this paper
• Generating hard instances of lattice problems (extended abstract)

  1996cited by this paper
• Algorithmic number theory

  1996cited by this paper
• Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction

  1995cited by this paper
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems

  1991influential reference
• Lectures on the Geometry of Numbers

  1989cited by this paper
• A More Efficient Algorithm for Lattice Basis Reduction

  1988cited by this paper
• A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms

  1987cited by this paper
• Improved methods for calculating vectors of short length in a lattice

  1985cited by this paper
• Improved algorithms for integer programming and related lattice problems

  1983cited by this paper
• Factoring polynomials with rational coefficients

  1982influential reference
• On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications

  1981cited by this paper
• On Observing Nondeterminism and Concurrency

  1980cited by this paper
• An Introduction to the Geometry of Numbers

  1959cited by this paper
• Geometrie der Zahlen

  1911cited by this paper
• Extraits de lettres de M. Ch. Hermite à M. Jacobi sur différents objects de la théorie des nombres.

  year unknowncited by this paper
• Improved Analysis of Kannan ’ s Shortest Lattice Vector Algorithm

  year unknowncited by this paper

• Lattice basis reduction techniques

  2024cites this paper
• Short vector problems and simultaneous approximation

  2020cites this paper
• Reductions between short vector problems and simultaneous approximation

  2020cites this paper
• Generalized Approach for Analysing Quantum Key Distribution Experiments

  2019cites this paper
• Reducing Lattice Enumeration Search Trees

  2019cites this paper
• Spring 5-3-2019 Lattices in Cryptography

  2019cites this paper
• Information Security and Cryptology – ICISC 2018

  2018cites this paper
• A Hybrid Method for Lattice Basis Reduction and Applications

  2018cites this paper
• On the Complexity of the LWR-Solving BKW Algorithm

  2018cites this paper
• Securing Systems With Indispensable Entropy: LWE-Based Lossless Computational Fuzzy Extractor for the Internet of Things

  2017cites this paper
• Securing Systems with Scarce Entropy: LWE-Based Lossless Computational Fuzzy Extractor for the IoT

  2016cites this paper
• ECDSA Key Extraction from Mobile Devices via Nonintrusive Physical Side Channels

  2016cites this paper
• A Hybrid Method for Lattice-Reduction-Aided MIMO Detection

  2016cites this paper
• Post-quantum cryptography: lattice-based cryptography and analysis of NTRU public-key cryptosystem

  2016cites this paper
• Practical, Predictable Lattice Basis Reduction

  2016cites this paper
• On the concrete hardness of Learning with Errors

  2015cites this paper
• On þ-adic Expansions of Algebraic Integers

  2015cites this paper
• Better Algorithms for LWE and LWR

  2015cites this paper
• Privacy-preserving biometrics authentication systems using fully homomorphic encryption

  2015cites this paper
• Bringing Theory Closer to Practice in Post-quantum and Leakage-resilient Cryptography

  2015cites this paper
• Effectiveness of Fully Homomorphic Encryption to Preserve the Privacy of Biometric Data

  2014cites this paper
• Some algorithms for learning with errors

  2014cites this paper
• How to pick a random integer matrix? (and other questions)

  2013cites this paper
• An enhanced Jacobi method for lattice-reduction-aided MIMO detection

  2013cites this paper
• On the complexity of the BKW algorithm on LWE

  2012cites this paper
• Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields

  2012cites this paper
• Analysis of Lattice Reduction Attack against the Somewhat Homomorphic Encryption Based on Ideal Lattices

  2012cites this paper
• Generic Phenomena in Groups -- Some Answers and Many Questions

  2012cites this paper
• A Polynomial Time Jacobi Method for Lattice Basis Reduction

  2012cites this paper
• A complexity analysis of a Jacobi method for lattice basis reduction

  2012cites this paper
• On the use of Continued Fractions for Stream Ciphers

  2009cites this paper
• HOW TO PICK A RANDOM INTEGER MATRIX?

  year unknowncites this paper