Abstract
The Korkine–Zolotareff (KZ) reduction and its generalisations, are widely used lattice reduction strategies in communications and cryptography. The KZ constant and Schnorr’s constant were defined by Schnorr in 1987. The KZ constant can be used to quantify some useful properties of KZ reduced matrices. Schnorr’s constant can be used to characterize the output quality of his block 2k-reduction and is used to define his semi block 2k-reduction, which was also developed in 1987. Hermite’s constant, which is a fundamental lattice constant, has many applications, such as bounding the length of the shortest nonzero lattice vector and the orthogonality defect of lattices. Rankin’s constant was introduced by Rankin in 1953 as a generalization of Hermite’s constant. It plays an important role in characterizing the output quality of block-Rankin reduction, proposed by Gama et al. in 2006. In this paper, we first develop a linear upper bound on Hermite’s constant and then use it to develop an upper bound on the KZ constant. These upper bounds are sharper than those obtained recently by the authors, and the ratio of the new linear upper bound to the nonlinear upper bound, developed by Blichfeldt in 1929, on Hermite’s constant is asymptotically 1.0047. Furthermore, we develop lower and upper bounds on Schnorr’s constant. The improvement to the lower bound over the sharpest existing one developed by Gama et al. is around 1.7 times asymptotically, and the improvement to the upper bound over the sharpest existing one which was also developed by Gama et al. is around 4 times asymptotically. Finally, we develop lower and upper bounds on Rankin’s constant. The improvements of the bounds over the sharpest existing ones, also developed by Gama et al., are exponential in the parameter defining the constant.
Similar content being viewed by others
References
Agrell E., Eriksson T., Vardy A., Zeger K.: Closest point search in lattices. IEEE Trans. Inf. Theory 48(8), 2201–2214 (2002).
Ajtai M.: Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr’s algorithm for the shortest vector problem. Theory Comput. 4(1), 21–51 (2008).
Batir N.: Inequalities for the gamma function. Arch. Math. 91, 554–563 (2008).
Blichfeldt H.F.: The minimum value of quadratic forms, and the closest packing of spheres. Math. Ann. 101(1), 605–608 (1929).
Cohn H., Kumar A.: The densest lattice in twenty-four dimensions. Electron. Res. Announc. Am. Math. Soc. 10(7), 58–67 (2004).
Euler L.: Exercitationes analyticae. Novi commentarii academiae scientiarum Petropolitanae 173–204 (1773).
Gama N., Howgrave-Graham N., Koy H., Nguyen P.Q.: Rankin’s constant and blockwise lattice reduction. In: Dwork C. (eds.) Advances in Cryptology—CRYPTO 2006. Lecture Notes in Computer Science, pp. 112– 130. Springer (2006).
Gama N., Nguyen P.Q.: Finding short lattice vectors within Mordell’s inequality. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 207–216 (2008).
Golub G., Van Loan C.: Matrix Computations, 4th edn Johns Hopkins, Baltimore (2013).
Hanrot G., Stehlé D.: Worst-case Hermite-Korkine-Zolotarev reduced lattice bases. arxiv preprint arxiv:0801.3331 (2008).
Lagarias J.C., Lenstra H.W., Schnorr C.P.: Korkin-zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica 10(4), 333–348 (1990).
Lehmer D.H.: Euler constants for arithmetical progressions. Acta Arith. 27(1), 125–142 (1975).
Ling C.: On the proximity factors of lattice reduction-aided decoding. IEEE Trans. Signal Process. 59(6), 2795–2808 (2011).
Luzzi L., Stehlé D., Ling C.: Decoding by embedding: correct decoding radius and DMT optimality. IEEE Trans. Inf. Theory 59(5), 2960–2973 (2013).
Lyu S., Ling C.: Boosted KZ and LLL algorithms. IEEE Trans. Signal Process. 65(18), 4784–4796 (2017).
Martinet J.: Perfect Lattices in Euclidean Spaces, vol. 327. Springer, Berlin (2013).
Micciancio D., Walter M.: Practical, predictable lattice basis reduction. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 820– 849. Springer (2016).
Micciancio D., Regev O.: Lattice-based cryptography. In: Bernstein D.J., Buchmann J. (eds.) Post-Quantum Cryptography. Springer, Berlin (2008).
Neumaier A.: Bounding basis reduction properties. Des. Codes Cryptogr. 84(1–2), 237–259 (2017).
Nguyen P.Q., Vallée B. (eds.): The LLL Algorithm. Survey and Applications. Springer, Berlin (2010).
Ordentlich O., Erez U., Nazer B.: Successive integer-forcing and its sum-rate optimality. In: 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 282–292. IEEE (2013).
Rankin R.A.: On positive definite quadratic forms. J. Lond. Math. Soc. 28, 309–314 (1953).
Sakzad A., Harshan J., Viterbo E.: Integer-forcing MIMO linear receivers based on lattice reduction. IEEE Trans. Wirel. Commun. 12(10), 4905–4915 (2013).
Sawatani K., Watanabe T.: A note on the Hermite-Rankin constant. J. Thorie des Nombres de Bordeaux 22(1), 209–217 (2010).
Schnorr C.P.: A hierarchy of polynomial time lattice basis reduction algorithms. Theoret. Comput. Sci. 53, 201–224 (1987).
Thunder J.L.: Higher-dimensional analogs of Hermite’s constant. Mich. Math. J. 45(2), 301–314 (1998).
Wen J., Chang X., Weng J.: Improved upper bounds on the hermite and KZ constants. In: Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp. 1742– 1746 (2019).
Wen J., Chang X.: On the KZ reduction. IEEE Trans. Inf. Theory 65(3), 1921–1935 (2019).
Acknowledgements
We are grateful to the two anonymous referees for their valuable and thoughtful suggestions, which improve the presentation of our work significantly.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by S. D. Galbraith.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Part of the work was presented in 2019 IEEE International Symposium on Information Theory, July 7–12, Paris, France.
This work was partially supported by National Natural Science Foundation of China (No. 11871248), the Guangdong Province Universities and Colleges Pearl River Scholar Funded Scheme (2019), Natural Science Foundation of Guangdong Province of China (2021A515010857, 2022A1515010029), Guangdong Major Project of Basic and Applied Basic Research (2019B030302008), and the Natural Sciences and Engineering Research Council of Canada (NSERC) Grant RGPIN-2017-05138.
Appendices
Appendix A Proof of Lemma 1
Proof
The left hand side of (14) is referred to as the midpoint rule for approximating the integral on the right hand side in numerical analysis. It is well known that
for some \(z \in (a,b)\). This formula can be easily proved as follows. By Taylor’s theorem,
where \(\zeta (s)\) depends on \(s\in (a, b)\). Integrating both sides of the above equality over [a, b] and using the Mean-Value-Theorem for integrals immediately lead to (A.1). Then using the condition that \(f''(t)\ge 0\) for \(t\in [a,b]\), we obtain (14). \(\square \)
Appendix B Proof of Lemma 2
Proof
By some direct calculations, we have
Then,
where
Hence, to show \(f''(t)> 0\), it sufficient to show that \(g(t)>0\) for \(t>0\).
By some direct calculations, we have
Clearly, \(g''(t)>0\) when \(t\ge 0\), hence \(g'(t)\) is increasing with t. Furthermore, \(g'(0)>0\), therefore \(g'(t)>0\) for \(t\ge 0\). By some direct calculations, \(g(0)>0\). Therefore, \(g(t)>0\) for \(t> 0\). \(\square \)
Appendix C Proof of Corollary 1
Proof
Since
by (26), to show (30), we show
Let
then
Hence, to show Corollary 1, we only need to show that
To this end, let \(g(x)=\ln (f(x))\), then
Let
then
Hence, h(x) is monotonically decreasing. Furthermore, by some direct calculations, one can show that \(h(11)>0, h(12)<0\), therefore, \(h(x)>0\) for \(x\le 11\) and \(h(x)<0\) for \(x\ge 12\). Hence \(g'(x)>0\) for \(x\le 11\) and \(g'(x)<0\) for \(x\ge 12\). Since \(g(x)=\ln (f(x))\), f(x) is increasing for \(x\le 11\) and decreasing for \(x\ge 12\), therefore (C.4) holds. \(\square \)
Appendix D Proof of Lemma 4
Proof
By the definition of \(\zeta (s)\), we have
Furthermore, for \(i\ge 3\), we have
where the second inequality follows from [6]. Then, we have
Since \(\zeta (i)>1\) for \(i\ge k+1\), we have
\(\square \)
Appendix E Proof of Lemma 5
Proof
By [3, Theorem 1.6], for \(x\ge 1\), we have
Therefore,
In the following, we give a lower bound on the last term of the right-hand side of (E.5). Since \(x\ln x\) is an increasing function for \(x\ge \frac{1}{e}\), we have
where (a) follows from the following inequalities,
where the last inequality is from \(k\ge 2\). Hence, we have
Rights and permissions
About this article
Cite this article
Wen, J., Chang, XW. Sharper bounds on four lattice constants. Des. Codes Cryptogr. 90, 1463–1484 (2022). https://doi.org/10.1007/s10623-022-01048-w
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-022-01048-w