Rigorous and Efficient Short Lattice Vectors Enumeration
From MaRDI portal
Publication:3600387
DOI10.1007/978-3-540-89255-7_24zbMath1206.94086OpenAlexW141781985MaRDI QIDQ3600387
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
Related Items (4)
Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography ⋮ List-decoding Barnes-Wall lattices ⋮ Another 80-dimensional extremal lattice ⋮ Algorithms for the Shortest and Closest Lattice Vector Problems
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Rigorous and Efficient Short Lattice Vectors Enumeration
