Lattice Enumeration Using Extreme Pruning
From MaRDI portal
Publication:3563839
DOI10.1007/978-3-642-13190-5_13zbMath1280.94056OpenAlexW1845765495WikidataQ57567978 ScholiaQ57567978MaRDI QIDQ3563839
Nicolas Gama, Phong Q. Nguyen, Oded Regev
Publication date: 1 June 2010
Published in: Advances in Cryptology – EUROCRYPT 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13190-5_13
Related Items (51)
Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance ⋮ Towards faster polynomial-time lattice reduction ⋮ Lower bounds on lattice sieving and information set decoding ⋮ Sieve, Enumerate, Slice, and Lift: ⋮ Partially Known Nonces and Fault Injection Attacks on SM2 Signature Algorithm ⋮ Solving the search-LWE problem over projected lattices ⋮ An extension of Kannan's embedding for solving ring-based LWE problems ⋮ On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes ⋮ Shortest vector from lattice sieving: a few dimensions for free ⋮ \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption ⋮ A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors ⋮ Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing ⋮ Finding shortest lattice vectors faster using quantum search ⋮ Predicting the concrete security of LWE against the dual attack using binary search ⋮ Estimation of the hardness of the learning with errors problem with a restricted number of samples ⋮ On the hardness of the finite field isomorphism problem ⋮ Self-dual DeepBKZ for finding short lattice vectors ⋮ On the asymptotic complexity of solving LWE ⋮ Development and analysis of massive parallelization of a lattice basis reduction algorithm ⋮ Improved broadcast attacks against subset sum problems via lattice oracle ⋮ Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation ⋮ Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation ⋮ Sieving for closest lattice vectors (with preprocessing) ⋮ Lattice-based cryptography: a survey ⋮ The irreducible vectors of a lattice: some theory and applications ⋮ Gauss Sieve Algorithm on GPUs ⋮ Another 80-dimensional extremal lattice ⋮ Comment on: ``Sum of squares of uniform random variables by I. Weissman ⋮ Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Algorithms for the Shortest and Closest Lattice Vector Problems ⋮ Second order statistical behavior of LLL and BKZ ⋮ Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors ⋮ On the complexity of the BKW algorithm on LWE ⋮ Analysis of DeepBKZ reduction for finding short lattice vectors ⋮ Random Sampling Revisited: Lattice Enumeration with Discrete Pruning ⋮ Just a Little Bit More ⋮ Approximate Voronoi cells for lattices, revisited ⋮ Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme ⋮ Better Key Sizes (and Attacks) for LWE-Based Encryption ⋮ Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices ⋮ A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge ⋮ Modular lattice signatures, revisited ⋮ The randomized slicer for CVPP: sharper, faster, smaller, batchier ⋮ On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem ⋮ Advanced lattice sieving on GPUs, with tensor cores ⋮ Parallel Implementation of BDD Enumeration for LWE ⋮ A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices ⋮ Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) ⋮ Improved lattice enumeration algorithms by primal and dual reordering methods ⋮ A sieve algorithm based on overlattices
This page was built for publication: Lattice Enumeration Using Extreme Pruning
