Paper 2020/057 Original: eprint.iacr.org/2020/057 ↗
On the smoothing parameter and last minimum of random orthogonal lattices
Abstract
Let $X \in {\mathbb{Z}}^{n \times m}$, with each entry independently and identically distributed from an integer Gaussian distribution. We consider the orthogonal lattice $\Lambda^\perp(X)$ of $X$, i.e., the set of vectors $\mathbf{v} \in {\mathbb{Z}}^m$ such that $X \mathbf{v}= \mathbf{0}$. In this work, we prove probabilistic upper bounds on the smoothing parameter and the $(m-n)$-th minimum of $\Lambda^\perp(X)$. These bounds improve and the techniques build upon prior works of Agrawal, Gentry, Halevi and Sahai [Asiacrypt'13], and of Aggarwal and Regev [Chicago J. Theoret. Comput. Sci.'16].
Metadata
- Available format(s)
PDF
- Category
- Foundations
- Publication info
- Preprint.
- History
- 2020-01-21: last updated
- 2020-01-21: published
- Short URL
- https://ia.cr/2020/057
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2020/057,
author = {Elena Kirshanova and Huyen Nguyen and Damien Stehlé and Alexandre Wallet},
title = {On the smoothing parameter and last minimum of random orthogonal lattices},
howpublished = {Cryptology {ePrint} Archive, Paper 2020/057},
year = {2020},
url = {https://eprint.iacr.org/2020/057}
}