Skip to main navigation Skip to search Skip to main content

Discrete Gaussian Sampling for BKZ-Reduced Basis

  • IRISA

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Discrete Gaussian sampling on lattices is a fundamental problem in lattice-based cryptography . In this paper, we revisit the Markov chain Monte Carlo (MCMC)-based Metropolis-Hastings-Klein (MHK) algorithm proposed by Wang and Ling and study its complexity under the Geometric Series Assumption (GSA) when the given basis is BKZ-reduced . We give experimental evidence that the GSA is accurate in this context, and we give a very simple approximate formula for the complexity of the sampler that is accurate over a large range of parameters and easily computable. We apply our results to the dual attack on LWE of [24] and significantly improve the complexity estimates of the attack. Finally, we provide some results of independent interest on the Gaussian mass of a random q-ary lattices.

Original languageEnglish
Title of host publicationPost-Quantum Cryptography - 16th International Workshop, PQCrypto 2025, Proceedings
EditorsRuben Niederhagen, Markku-Juhani O. Saarinen
PublisherSpringer Science and Business Media Deutschland GmbH
Pages63-88
Number of pages26
ISBN (Print)9783031866012
DOIs
Publication statusPublished - 1 Jan 2025
Event16th International Workshop on Post-Quantum Cryptography, PQCrypto 2025 - Taipei, Taiwan, Province of China
Duration: 8 Apr 202510 Apr 2025

Publication series

NameLecture Notes in Computer Science
Volume15578 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Workshop on Post-Quantum Cryptography, PQCrypto 2025
Country/TerritoryTaiwan, Province of China
CityTaipei
Period8/04/2510/04/25

Keywords

  • Discrete Gaussian Sampling
  • Geometric Series Assumption
  • Lattices

Fingerprint

Dive into the research topics of 'Discrete Gaussian Sampling for BKZ-Reduced Basis'. Together they form a unique fingerprint.

Cite this