Improved Upper Bounds on the Hermite and KZ Constants

04/20/2019
by   Jinming Wen, et al.
0

The Korkine-Zolotareff (KZ) reduction is a widely used lattice reduction strategy in communications and cryptography. The Hermite constant, which is a vital constant of lattice, has many applications, such as bounding the length of the shortest nonzero lattice vector and orthogonality defect of lattices. The KZ constant can be used in quantifying some useful properties of KZ reduced matrices. In this paper, we first develop a linear upper bound on the Hermite constant and then use the bound to develop an upper bound on the KZ constant. These upper bounds are sharper than those obtained recently by the first two authors. Some examples on the applications of the improved upper bounds are also presented.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/17/2022

Sharper Bounds on Four Lattice Constants

The Korkine–Zolotareff (KZ) reduction, and its generalisations, are wide...
research
07/09/2021

Constant Delay Lattice Train Schedules

The following geometric vehicle scheduling problem has been considered: ...
research
04/20/2018

On the Post Selection Inference constant under Restricted Isometry Properties

Uniformly valid confidence intervals post model selection in regression ...
research
05/30/2020

New bounds on the density of lattice coverings

We obtain new upper bounds on the minimal density of lattice coverings o...
research
02/28/2022

Bounds on quantum evolution complexity via lattice cryptography

We address the difference between integrable and chaotic motion in quant...
research
05/31/2021

Halt Properties and Complexity Evaluations for Optimal DeepLLL Algorithm Families

DeepLLL algorithm (Schnorr, 1994) is a famous variant of LLL lattice bas...
research
05/13/2018

Forbidden formations in 0-1 matrices

Keszegh (2009) proved that the extremal function ex(n, P) of any forbidd...

Please sign up or login with your details

Forgot password? Click here to reset