scientific article
From MaRDI portal
Publication:3549702
zbMath1230.11153MaRDI QIDQ3549702
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmic version of Mordell's inequality on Hermite's constantapproximation factor for shortest vector problempolynomial time blockwise reduction algorithm
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Lattices and convex bodies (number-theoretic aspects) (11H06)
Related Items (38)
Dual lattice attacks for closest vector problems (with preprocessing) ⋮ Bounding basis reduction properties ⋮ Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance ⋮ Towards faster polynomial-time lattice reduction ⋮ Partially Known Nonces and Fault Injection Attacks on SM2 Signature Algorithm ⋮ Sharper bounds on four lattice constants ⋮ Lattice Point Enumeration on Block Reduced Bases ⋮ Self-dual DeepBKZ for finding short lattice vectors ⋮ EHNP strikes back: analyzing SM2 implementations ⋮ On the modular inversion hidden number problem ⋮ Subfield attacks on HSVP in ideal lattices ⋮ On module unique-SVP and NTRU ⋮ A sharper lower bound on Rankin's constant ⋮ Improving convergence and practicality of slide-type reductions ⋮ A lattice reduction algorithm based on sublattice BKZ ⋮ Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) ⋮ 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 ⋮ Short Stickelberger Class Relations and Application to Ideal-SVP ⋮ Cryptographic Functions from Worst-Case Complexity Assumptions ⋮ Rigorous and Efficient Short Lattice Vectors Enumeration ⋮ Predicting Lattice Reduction ⋮ 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 ⋮ The convergence of slide-type reductions ⋮ On the success probability of solving unique SVP via BKZ ⋮ A time-distance trade-off for GDD with preprocessing: instantiating the DLW heuristic ⋮ A Subfield Lattice Attack on Overstretched NTRU Assumptions ⋮ 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)}\) ⋮ Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP ⋮ Slide reduction, revisited -- filling the gaps in SVP approximation ⋮ Improved lattice enumeration algorithms by primal and dual reordering methods
This page was built for publication:
