Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
From MaRDI portal
Publication:5199206
DOI10.1007/978-3-642-22792-9_25zbMath1287.94072OpenAlexW139993337MaRDI QIDQ5199206
Damien Stehlé, Xavier Pujol, Guillaume Hanrot
Publication date: 12 August 2011
Published in: Advances in Cryptology – CRYPTO 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22792-9_25
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Lattices and convex bodies (number-theoretic aspects) (11H06)
Related Items (38)
Bounding basis reduction properties ⋮ Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance ⋮ Towards faster polynomial-time lattice reduction ⋮ 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 ⋮ A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors ⋮ PotLLL: a polynomial time version of LLL with deep insertions ⋮ Individual discrete logarithm with sublattice reduction ⋮ Self-dual DeepBKZ for finding short lattice vectors ⋮ EHNP strikes back: analyzing SM2 implementations ⋮ Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem ⋮ On the asymptotic complexity of solving LWE ⋮ On module unique-SVP and NTRU ⋮ Dynamic Cantor Derivative Logic ⋮ Improving convergence and practicality of slide-type reductions ⋮ A lattice reduction algorithm based on sublattice BKZ ⋮ A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$ ⋮ Second order statistical behavior of LLL and BKZ ⋮ On the complexity of the BKW algorithm on LWE ⋮ Analysis of DeepBKZ reduction for finding short lattice vectors ⋮ Revisiting Lattice Attacks on Overstretched NTRU Parameters ⋮ On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL ⋮ Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme ⋮ Learning strikes again: the case of the DRS signature scheme ⋮ A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge ⋮ Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes ⋮ The convergence of slide-type reductions ⋮ On the success probability of solving unique SVP via BKZ ⋮ A Subfield Lattice Attack on Overstretched NTRU Assumptions ⋮ A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths ⋮ A new parallel lattice reduction algorithm for BKZ reduced bases ⋮ A polynomial-time algorithm for solving the hidden subset sum problem ⋮ Fast reduction of algebraic lattices over cyclotomic fields ⋮ Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) ⋮ Slide reduction, revisited -- filling the gaps in SVP approximation ⋮ A physical study of the LLL algorithm ⋮ A sieve algorithm based on overlattices ⋮ Revisiting orthogonal lattice attacks on approximate common divisor problems
Uses Software
This page was built for publication: Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
