Explicit Hard Instances of the Shortest Vector Problem
From MaRDI portal
Recommendations
- Hardness of approximating the shortest vector problem in lattices
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms
- Improved hardness results for unique shortest vector problem
- scientific article; zbMATH DE number 1775383
- Tensor-based hardness of the shortest vector problem to within almost polynomial factors
- Inapproximability of the shortest vector problem: toward a deterministic reduction
- Faster exponential time algorithms for the shortest vector problem
- Polynomially Solvable Instances of the Shortest and Closest Vector Problems With Applications to Compute-and-Forward
- Algorithms for the shortest and closest lattice vector problems
- scientific article; zbMATH DE number 1852143
Cites work
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1088230 (Why is no real title available?)
- scientific article; zbMATH DE number 1962809 (Why is no real title available?)
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- scientific article; zbMATH DE number 1852137 (Why is no real title available?)
- A hierarchy of polynomial time lattice basis reduction algorithms
- A sieve algorithm for the shortest lattice vector problem
- Algorithmic Number Theory
- Algorithmic Number Theory
- Algorithms and Computation
- Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
- Block Reduced Lattice Bases and Successive Minima
- Diophantine approximation
- Dirichlet's theorem on Diophantine approximation and homogeneous flows
- Explicit Hard Instances of the Shortest Vector Problem
- Factoring polynomials with rational coefficients
- Floating-Point LLL Revisited
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
- Lattice problems in NP ∩ coNP
- New bounds in some transference theorems in the geometry of numbers
- On lattices, learning with errors, random linear codes, and cryptography
- On the Random Character of Fundamental Constant Expansions
- On the limits of nonapproximability of lattice problems
- Predicting Lattice Reduction
- Quantum Computation and Lattice Problems
- Random Generators and Normal Numbers
- Trapdoors for hard lattices and new cryptographic constructions
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(11)- A new random sampling method and its application in improving progressive BKZ algorithm
- Generating shorter bases for hard random lattices
- Optimization of search space for finding very short lattice vectors
- A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
- Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients
- Application of mixed integer quadratic program to shortest vector problems
- Optimum commutative group codes
- Explicit Hard Instances of the Shortest Vector Problem
- PBKZ algorithm and its application in lattice challenge
- Bounding basis reduction properties
- Post-quantum cryptography: lattice signatures
This page was built for publication: Explicit Hard Instances of the Shortest Vector Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3535352)
