Finding short lattice vectors within Mordell's inequality

zbMATH Open1230.11153MaRDI QIDQ3549702FDOQ3549702

Publication date: 5 January 2009

Recommendations

Hermite’s Constant and Lattice Algorithms
Progress on LLL and lattice reduction
scientific article; zbMATH DE number 3972987
Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr's algorithm for the shortest vector problem
A sieve algorithm for the shortest lattice vector problem

algorithmic version of Mordell's inequality on Hermite's constant approximation factor for shortest vector problem polynomial time blockwise reduction algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Lattices and convex bodies (number-theoretic aspects) (11H06) Number-theoretic algorithms; complexity (11Y16)

Cited In (45)

Dual lattice attacks for closest vector problems (with preprocessing)
On module unique-SVP and NTRU
Improved lattice enumeration algorithms by primal and dual reordering methods
Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
Rigorous and Efficient Short Lattice Vectors Enumeration
On the modular inversion hidden number problem
Improving convergence and practicality of slide-type reductions
Self-dual DeepBKZ for finding short lattice vectors
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
Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP)
A sharper lower bound on Rankin's constant
Predicting Lattice Reduction
Subfield attacks on HSVP in ideal lattices
Advanced lattice sieving on GPUs, with tensor cores
Algorithms for the shortest and closest lattice vector problems
Partially Known Nonces and Fault Injection Attacks on SM2 Signature Algorithm
Second order statistical behavior of LLL and BKZ
Short Stickelberger class relations and application to Ideal-SVP
A Subfield Lattice Attack on Overstretched NTRU Assumptions
Cryptographic functions from worst-case complexity assumptions
Hermite’s Constant and Lattice Algorithms
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
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
Sharper bounds on four lattice constants
On the success probability of solving unique SVP via BKZ
The convergence of slide-type reductions
A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge
BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices
Provable lattice reduction of $$\mathbb {Z}^n$$ with blocksize n/2
Quantum lattice enumeration in limited depth
Lattice problems beyond polynomial time
Bounding basis reduction properties
EHNP strikes back: analyzing SM2 implementations
A complete analysis of the BKZ lattice reduction algorithm
On the smallest ratio problem of lattice bases
Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes
Towards faster polynomial-time lattice reduction
A lattice reduction algorithm based on sublattice BKZ
Lattice Point Enumeration on Block Reduced Bases
Fast reduction of algebraic lattices over cyclotomic fields
Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP
A time-distance trade-off for GDD with preprocessing: instantiating the DLW heuristic

This page was built for publication: Finding short lattice vectors within Mordell's inequality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549702)