Work

Faster Dual Lattice Attacks by Using Coding Theory

Year: 2024

Type: preprint

Abstract: We present a faster dual lattice attack on the Learning with Errors (LWE) problem, based on ideas from coding theory. Basically, it consists of revisiting the most recent dual attack of [MATZOV22] and replacing modulus switching by a decoding algorithm. This replacement achieves a reduction from small LWE to plain LWE with a very significant reduction of the secret dimension. We also replace the enumeration part of this attack by betting that the secret is zero on the part where we want to enumerate it and iterate this bet over other choices of the enumeration part. We estimate the complexity of this attack by making the optimistic, but realistic guess that we can use polar codes for this decoding task. We show that under this assumption the best attacks on Kyber and Saber can be improved by 1 and 6 bits

Source: HAL (Le Centre pour la Communication Scientifique Directe)

Authors: Carrier, Kévin, Shen, Yixin, Tillich, Jean-Pierre

Institutions: CY Cergy Paris Université, Equipes Traitement de l'Information et Systèmes, Royal Holloway University of London, Institut national de recherche en sciences et technologies du numérique, COSMIQ: Cryptologie symétrique, cryptologie fondée sur les codes et information quantique

Language: English

Topic: Cryptography and Data Security

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Engineering and Physical Sciences Research Council

Award: The limits of Quantum Computing: an approach via Post-Quantum Cryptography

OpenAlex ID: W4393137754

Cites:

Cited by: 3

Related to: 10