Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms

Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskriftPeer review


The Learning with Errors (LWE) problem receives much attention in cryptography, mainly due to its fundamental significance in post-quantum cryptography. Among its solving algorithms, the Blum-Kalai-Wasserman (BKW) algorithm, originally proposed for solving the Learning Parity with Noise (LPN) problem, performs well, especially for certain parameter settings with cryptographic importance. The BKW algorithm consists of two phases, the reduction phase and the solving phase. In this work, we study the performance of distinguishers used in the solving phase. We show that the Fast Fourier Transform (FFT) distinguisher from Eurocrypt’15 has the same sample complexity as the optimal distinguisher, when making the same number of hypotheses. We also show via simulation that it performs much better than previous theory predicts and develop a sample complexity model that matches the simulations better. We also introduce an improved, pruned version of the FFT distinguisher. Finally, we indicate, via extensive experiments, that the sample dependency due to both LF2 and sample amplification is limited.
Sidor (från-till)331-350
Antal sidor20
TidskriftCryptography and Communications
Tidigt onlinedatum2022 aug. 9
StatusPublished - 2023

Ämnesklassifikation (UKÄ)

  • Systemvetenskap, informationssystem och informatik


Utforska forskningsämnen för ”Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här