A sharper lower bound on Rankin's constant

DOI10.1016/j.ipl.2023.106379OpenAlexW4319874546MaRDI QIDQ6161436

Kang Li, Jinming Wen, Bingpeng Zhou, Fengjun Xiao

Publication date: 5 June 2023

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2023.106379

zbMATH Keywords

cryptographylower boundlattice reductionRankin's constant

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on the Hermite-Rankin constant
• A hierarchy of polynomial time lattice basis reduction algorithms
• Factoring polynomials with rational coefficients
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Higher-dimensional analogs of Hermite's constant
• Sharper bounds on four lattice constants
• Practical, Predictable Lattice Basis Reduction
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
• Approximating the densest sublattice from Rankin’s inequality
• On the KZ Reduction
• Closest point search in lattices
• Hermite’s Constant and Lattice Algorithms
• Rankin’s Constant and Blockwise Lattice Reduction
• On Positive Definite Quadratic Forms

This page was built for publication: A sharper lower bound on Rankin's constant