Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
From MaRDI portal
Recommendations
- Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
- A new lattice sieving algorithm base on angular locality-sensitive hashing
- Sieving for shortest vectors in ideal lattices: a practical perspective
- Lattice-based locality sensitive hashing is optimal
- Sieving for closest lattice vectors (with preprocessing)
- Sieving for shortest vectors in ideal lattices
- Efficient (ideal) lattice sieving using cross-polytope LSH
- A sieve algorithm for the shortest lattice vector problem
- Optimization of search space for finding very short lattice vectors
- A locality-sensitive hash for real vectors
Cites work
- A hierarchy of polynomial time lattice basis reduction algorithms
- A three-level sieve algorithm for the shortest vector problem
- Better key sizes (and attacks) for LWE-based encryption
- Estimating key sizes for high dimensional lattice-based systems
- Factoring polynomials with rational coefficients
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
- Parallel Gauss sieve algorithm: solving the SVP challenge over a 128-dimensional ideal lattice
- Post-Quantum Cryptography
- Sieve algorithms for the shortest vector problem are practical
- Sieving for shortest vectors in ideal lattices
- Sphere packings, lattices and groups. With additional contributions by E. Bannai, R. E. Borcherds, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov.
Cited in
(51)- Shortest vector from lattice sieving: a few dimensions for free
- On the asymptotic complexity of solving LWE
- Post-quantum key exchange for the Internet and the open quantum safe project
- Sieving for closest lattice vectors (with preprocessing)
- Quantum algorithm design: techniques and applications
- A new lattice sieving algorithm base on angular locality-sensitive hashing
- Speed-ups and time-memory trade-offs for tuple lattice sieving
- Approximate Voronoi cells for lattices, revisited
- A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP
- Advanced lattice sieving on GPUs, with tensor cores
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- Revisiting orthogonal lattice attacks on approximate common divisor problems
- How to meet ternary LWE keys
- Lower bounds on lattice sieving and information set decoding
- Gadget-based iNTRU lattice trapdoors
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
- Predicting the concrete security of LWE against the dual attack using binary search
- Estimating quantum speedups for lattice sieves
- Efficient (ideal) lattice sieving using cross-polytope LSH
- Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
- Gauss sieve algorithm on GPUs
- A practical post-quantum public-key cryptosystem based on spLWE
- New directions in nearest neighbor searching with applications to lattice sieving
- Lattice-based locality sensitive hashing is optimal
- Sieve, Enumerate, Slice, and Lift:
- Hypercube LSH for approximate near neighbors
- Graph-based time-space trade-offs for approximate near neighbors
- Improved algorithms for the approximate k-List problem in Euclidean norm
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- Lattice Sieving via Quantum Random Walks
- EHNP strikes back: analyzing SM2 implementations
- A non-heuristic approach to time-space tradeoffs and optimizations for BKW
- Estimating the hidden overheads in the BDGL lattice sieving algorithm
- BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices
- New Results on the Remote Set Problem and Its Applications in Complexity Study
- Finding shortest vector using quantum NV sieve on Grover
- Concrete analysis of quantum lattice enumeration
- Asymptotics and improvements of sieving for codes
- Estimates of implementation complexity for quantum cryptanalysis of post-quantum lattice-based cryptosystems
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
- Quantum lattice enumeration in limited depth
- CryptAttackTester: high-assurance attack analysis
- Polytopes, lattices, and spherical codes for the nearest neighbor problem
- On tiny-probability lattice enumeration
- Attacking ECDSA with nonce leakage by lattice sieving: bridging the gap with Fourier analysis-based attacks
- Towards large-scale lattice attack: new lattice records by disk-based sieving
- On the practicality of quantum sieving algorithms for the shortest vector problem
- Memory adds no cost to lattice sieving for computers in 3 or more spatial dimensions
- \textsf{FrodoKEM}: a CCA-secure learning with errors key encapsulation mechanism
- Finding shortest lattice vectors faster using quantum search
This page was built for publication: Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457102)
