Explicit Hard Instances of the Shortest Vector Problem
From MaRDI portal
Publication:3535352
DOI10.1007/978-3-540-88403-3_6zbMath1177.94132OpenAlexW2141299465MaRDI QIDQ3535352
Richard Lindner, Markus Rückert, Johannes A. Buchmann
Publication date: 11 November 2008
Published in: Post-Quantum Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-88403-3_6
Related Items (5)
Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients ⋮ Bounding basis reduction properties ⋮ Post-quantum cryptography: lattice signatures ⋮ Explicit Hard Instances of the Shortest Vector Problem ⋮ Optimum commutative group codes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
- Dirichlet's theorem on Diophantine approximation and homogeneous flows
- A hierarchy of polynomial time lattice basis reduction algorithms
- Diophantine approximation
- Factoring polynomials with rational coefficients
- New bounds in some transference theorems in the geometry of numbers
- On the limits of nonapproximability of lattice problems
- Explicit Hard Instances of the Shortest Vector Problem
- Lattice problems in NP ∩ coNP
- Trapdoors for hard lattices and new cryptographic constructions
- Block Reduced Lattice Bases and Successive Minima
- Quantum Computation and Lattice Problems
- Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
- On the Random Character of Fundamental Constant Expansions
- A sieve algorithm for the shortest lattice vector problem
- Algorithms and Computation
- Floating-Point LLL Revisited
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Predicting Lattice Reduction
- Random Generators and Normal Numbers
- Algorithmic Number Theory
- Algorithmic Number Theory
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Explicit Hard Instances of the Shortest Vector Problem
