Shortest vector from lattice sieving: a few dimensions for free
From MaRDI portal
Publication:1648783
DOI10.1007/978-3-319-78381-9_5zbMath1423.94069OpenAlexW2795008797MaRDI QIDQ1648783
Publication date: 9 July 2018
Full work available at URL: https://ir.cwi.nl/pub/27649
Related Items (30)
Dual lattice attacks for closest vector problems (with preprocessing) ⋮ Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography ⋮ Lower bounds on lattice sieving and information set decoding ⋮ Sieve, Enumerate, Slice, and Lift: ⋮ Solving the search-LWE problem over projected lattices ⋮ Predicting the concrete security of LWE against the dual attack using binary search ⋮ Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS ⋮ Sieve algorithms for some orthogonal integer lattices ⋮ Generalized attack on ECDSA: known bits in arbitrary positions ⋮ A thorough treatment of highly-efficient NTRU instantiations ⋮ EHNP strikes back: analyzing SM2 implementations ⋮ Handle the traces: revisiting the attack on ECDSA with EHNP ⋮ A non-heuristic approach to time-space tradeoffs and optimizations for BKW ⋮ Development and analysis of massive parallelization of a lattice basis reduction algorithm ⋮ Does the dual-sieve attack on learning with errors even work? ⋮ Finding short integer solutions when the modulus is small ⋮ Estimating the hidden overheads in the BDGL lattice sieving algorithm ⋮ Estimating quantum speedups for lattice sieves ⋮ A lattice reduction algorithm based on sublattice BKZ ⋮ Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation ⋮ Analysis of DeepBKZ reduction for finding short lattice vectors ⋮ Approximate Voronoi cells for lattices, revisited ⋮ Learning strikes again: the case of the DRS signature scheme ⋮ A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge ⋮ A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP ⋮ On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem ⋮ Advanced lattice sieving on GPUs, with tensor cores ⋮ Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes ⋮ A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths ⋮ Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Lovász' lattice reduction and the nearest lattice point problem
- Factoring polynomials with rational coefficients
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Sieving for shortest vectors in ideal lattices: a practical perspective
- Progressive lattice sieving
- Second order statistical behavior of LLL and BKZ
- Fast lattice basis reduction suitable for massive parallelization and its application to the shortest vector problem
- Practical, Predictable Lattice Basis Reduction
- Tuning GaussSieve for Speed
- Two Halves Make a Whole
- Tuple lattice sieving
- Gauss Sieve Algorithm on GPUs
- BKZ 2.0: Better Lattice Security Estimates
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Sieve algorithms for the shortest vector problem are practical
- Lattice Enumeration Using Extreme Pruning
- Similarity estimation techniques from rounding algorithms
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- On the power of commutativity in cryptography
- On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
- New directions in nearest neighbor searching with applications to lattice sieving
- A sieve algorithm for the shortest lattice vector problem
- Floating-Point LLL: Theoretical and Practical Aspects
- Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
- Hashing, Load Balancing and Multiple Choice
- Fast Lattice Point Enumeration with Minimal Overhead
- Predicting Lattice Reduction
- Improved Algorithms for the Approximate k-List Problem in Euclidean Norm
- Random Sampling Revisited: Lattice Enumeration with Discrete Pruning
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Shortest vector from lattice sieving: a few dimensions for free
