Sharper bounds on four lattice constants

DOI10.1007/s10623-022-01048-wzbMath1493.11103arXiv2204.08021OpenAlexW4224286454WikidataQ114849745 ScholiaQ114849745MaRDI QIDQ2672303

Xiao-Wen Chang, Jinming Wen

Publication date: 8 June 2022

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.08021

zbMATH Keywords

Hermite's constantKZ constantKZ reductionRankin's constantSchnorr's constant

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Lattices and convex bodies (number-theoretic aspects) (11H06) Relations with coding theory (11H71)

Related Items (2)

Euclidean minima of algebraic number fields ⋮ A sharper lower bound on Rankin's constant

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the Hermite-Rankin constant
• Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
• Inequalities for the gamma function
• The LLL algorithm. Survey and applications
• A hierarchy of polynomial time lattice basis reduction algorithms
• Higher-dimensional analogs of Hermite's constant
• Bounding basis reduction properties
• Practical, Predictable Lattice Basis Reduction
• Decoding by Embedding: Correct Decoding Radius and DMT Optimality
• Lattice-based Cryptography
• Euler constants for arithmetic progressions
• On the Proximity Factors of Lattice Reduction-Aided Decoding
• Boosted KZ and LLL Algorithms
• On the KZ Reduction
• Closest point search in lattices
• The densest lattice in twenty-four dimensions
• Rankin’s Constant and Blockwise Lattice Reduction
• On Positive Definite Quadratic Forms

This page was built for publication: Sharper bounds on four lattice constants