New bounds of the smoothing parameter for lattices

Heng Guo, Fengxia Liu, Linlin Wang and Kun Tian

PLOS ONE, 2025, vol. 20, issue 7, 1-16

Abstract: The smoothing parameter on lattices is crucial for lattice-based cryptographic design. In this study, we establish a new upper bound for the lattice smoothing parameter, which represents an improvement over several significant classical findings. For one-dimensional integer lattices, under specific and optimized conditions, we have achieved a more precise upper bound compared to previous research. Regarding general high-dimensional lattices, when the lattice dimension is large enough and the error parameter is within a particular range, we have derived a new upper bound. In the practical applications of lattice-based cryptography, where the lattice dimension is typically large, our new bound enables a more natural and smaller setting for the error parameter, thereby improving the upper bounds on all known smoothing parameters.

Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0328688 (text/html)
https://journals.plos.org/plosone/article/file?id= ... 28688&type=printable (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:plo:pone00:0328688

DOI: 10.1371/journal.pone.0328688

Access Statistics for this article

More articles in PLOS ONE from Public Library of Science
Bibliographic data for series maintained by plosone ().