Practical, Predictable Lattice Basis Reduction
From MaRDI portal
Recommendations
- Low-dimensional lattice basis reduction revisited
- Algorithmic Number Theory
- A more efficient algorithm for lattice basis reduction
- scientific article; zbMATH DE number 3958726
- scientific article; zbMATH DE number 1643923
- Algorithmic Number Theory
- scientific article; zbMATH DE number 799775
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- scientific article; zbMATH DE number 1263369
Cited in
(63)- Calculation of Minkowski-reduced lattice bases
- Dual lattice attacks for closest vector problems (with preprocessing)
- On the measurement and simulation of the BKZ behavior for \(q\)-ary lattices
- Improved lattice enumeration algorithms by primal and dual reordering methods
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- TFHE: fast fully homomorphic encryption over the torus
- Current paradigms for construction of lattice-based digital signature schemes
- A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
- Improving convergence and practicality of slide-type reductions
- Fast practical lattice reduction through iterated compression
- Analysis of DeepBKZ reduction for finding short lattice vectors
- Shortest vector from lattice sieving: a few dimensions for free
- Self-dual DeepBKZ for finding short lattice vectors
- Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation
- Generalized attack on ECDSA: known bits in arbitrary positions
- A sharper lower bound on Rankin's constant
- Predicting Lattice Reduction
- Computing generator in cyclotomic integer rings. A subfield algorithm for the principal ideal problem in \(L_{|\varDelta_\mathbb {K}|}\left(\frac{1}{2}\right)\) and application to the cryptanalysis of a FHE scheme
- Subfield attacks on HSVP in ideal lattices
- Advanced lattice sieving on GPUs, with tensor cores
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Concrete analysis of quantum lattice enumeration
- \textsc{Antrag}: annular NTRU trapdoor generation. Making \textsc{Mitaka} as secure as FALCON
- Shorter hash-and-sign lattice-based signatures
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
- Analyzing pump and jump BKZ algorithm using dynamical systems
- Improved provable reduction of NTRU and hypercubic lattices
- Phoenix: hash-and-sign with aborts from lattice gadgets
- scientific article; zbMATH DE number 1643923 (Why is no real title available?)
- Predicting module-lattice reduction
- Second order statistical behavior of LLL and BKZ
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Individual discrete logarithm with sublattice reduction
- A new BKZ-type reduction with provable termination and development of its self-dual variant
- Just take the average! An embarrassingly simple \(2^n\)-time algorithm for SVP (and CVP)
- 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
- A quasi-polynomial time algorithm for the extrapolated dihedral coset problem over power-of-two moduli
- 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
- Towards compact identity-based encryption on ideal lattices
- Sharper bounds on four lattice constants
- On the success probability of solving unique SVP via BKZ
- The convergence of slide-type reductions
- BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices
- Two-round threshold signature from algebraic one-more learning with errors
- Detecting unnecessary reductions in an involutive basis computation
- Bounding basis reduction properties
- Quantum lattice enumeration in limited depth
- Two-round threshold signature from algebraic one-more learning with errors
- Heuristics on lattice basis reduction in practice
- EHNP strikes back: analyzing SM2 implementations
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Towards faster polynomial-time lattice reduction
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes
- scientific article; zbMATH DE number 1944706 (Why is no real title available?)
- Handle the traces: revisiting the attack on ECDSA with EHNP
- On the smallest ratio problem of lattice bases
- A lattice reduction algorithm based on sublattice BKZ
- Algorithmic Number Theory
- Fast reduction of algebraic lattices over cyclotomic fields
- Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP
- 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
This page was built for publication: Practical, Predictable Lattice Basis Reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820509)
