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