Rankin’s Constant and Blockwise Lattice Reduction

DOI10.1007/11818175_7zbMath1129.11058OpenAlexW1515987896MaRDI QIDQ5756630

Phong Q. Nguyen, N. A. Howgrave-Graham, Nicolas Gama, Henrik Koy

Publication date: 4 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11818175_7

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (17)

Bounding basis reduction properties ⋮ Sharper bounds on four lattice constants ⋮ Subfield attacks on HSVP in ideal lattices ⋮ A sharper lower bound on Rankin's constant ⋮ Improving convergence and practicality of slide-type reductions ⋮ Systematics of aligned axions ⋮ Sieve algorithms for the shortest vector problem are practical ⋮ 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 ⋮ Hermite’s Constant and Lattice Algorithms ⋮ Rigorous and Efficient Short Lattice Vectors Enumeration ⋮ Predicting Lattice Reduction ⋮ Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes ⋮ Quantum Codes from High-Dimensional Manifolds ⋮ Slide reduction, revisited -- filling the gaps in SVP approximation ⋮ A sieve algorithm based on overlattices

This page was built for publication: Rankin’s Constant and Blockwise Lattice Reduction