Skip to main navigation Skip to search Skip to main content

On the smoothing parameter and last minimum of random orthogonal lattices

  • Immanuel Kant Baltic Federal University
  • ENS Lyon
  • Institut Universitaire de France
  • NTT Secure Platform Laboratories

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)

Abstract

Let X∈ Zn × m, with each entry independently and identically distributed from an integer Gaussian distribution. We consider the orthogonal lattice Λ(X) of X, i.e., the set of vectors v∈ Zm such that Xv= 0. In this work, we prove probabilistic upper bounds on the smoothing parameter and the (m- n) -th minimum of Λ(X). These bounds improve and the techniques build upon prior works of Agrawal et al. (Adv Cryptol 2013:97–116, 2013), and of Aggarwal and Regev (Chic J Theor Comput Sci 7:1–11, 2016).

Original languageEnglish
Pages (from-to)931-950
Number of pages20
JournalDesigns, Codes, and Cryptography
Volume88
Issue number5
DOIs
Publication statusPublished - 1 May 2020
Externally publishedYes

Keywords

  • Last minimum
  • Lattice-based cryptography
  • Lattices and convex bodies
  • Random lattices
  • Smoothing parameter

Fingerprint

Dive into the research topics of 'On the smoothing parameter and last minimum of random orthogonal lattices'. Together they form a unique fingerprint.

Cite this