Rigorous and Efficient Short Lattice Vectors Enumeration

DOI10.1007/978-3-540-89255-7_24zbMath1206.94086MaRDI QIDQ3600387

Damien Stehlé, Xavier Pujol

Publication date: 10 February 2009

Published in: Advances in Cryptology - ASIACRYPT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89255-7_24

zbMATH Keywords

numerical stability; lattices; SVP; lattice cryptanalysis

Mathematics Subject Classification ID

94A60: Cryptography

Uses Software

• NTL
• MPFR
• mctoolbox
• SWIFFT
• NTRU
• fpLLL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hierarchy of polynomial time lattice basis reduction algorithms
• Factoring polynomials with rational coefficients
• Lattice reduction: a toolbox for the cryptoanalyst
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• SWIFFT: A Modest Proposal for FFT Hashing
• Sieve algorithms for the shortest vector problem are practical
• Trapdoors for hard lattices and new cryptographic constructions
• Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
• Lattice-based Cryptography
• Maximum likelihood sequence estimation from the lattice viewpoint
• Closest point search in lattices
• Accuracy and Stability of Numerical Algorithms
• A sieve algorithm for the shortest lattice vector problem
• Floating-Point LLL: Theoretical and Practical Aspects
• Floating-Point LLL Revisited
• Lattice-Based Identification Schemes Secure Under Active Attacks
• Asymptotically Efficient Lattice-Based Digital Signatures
• Predicting Lattice Reduction
• Rankin’s Constant and Blockwise Lattice Reduction