A New Algebraic Approach to the Regular Syndrome Decoding Problem and Implications for PCG Constructions - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

A New Algebraic Approach to the Regular Syndrome Decoding Problem and Implications for PCG Constructions

Résumé

The Regular Syndrome Decoding (RSD) problem, a variant of the Syndrome Decoding problem with a particular error distribution, was introduced almost 20 years ago by Augot et al.. In this problem, the error vector is divided into equally sized blocks, each containing a single noisy coordinate. More recently, the last five years have seen increased interest in this assumption due to its use in MPC and ZK applications. Generally referred to as "LPN with regular noise" in this context, the assumption allows to achieve better efficiency when compared to plain LPN. In all previous works of cryptanalysis, it has not been shown how to exploit the special feature of this problem in an attack. We present the first algebraic attack on RSD. Based on a careful theoretical analysis of the underlying polynomial system, we propose concrete attacks that are able to take advantage of the regular noise distribution. In particular, we can identify several examples of concrete parameters where our techniques outperform other algorithms.
Fichier principal
Vignette du fichier
eprint_briaud_oygarden.pdf (546.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03984470 , version 1 (12-02-2023)

Licence

Paternité

Identifiants

Citer

Pierre Briaud, Morten Øygarden. A New Algebraic Approach to the Regular Syndrome Decoding Problem and Implications for PCG Constructions. Eurocrypt 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Apr 2023, Lyon, France. pp.391--422, ⟨10.1007/978-3-031-30589-4_14⟩. ⟨hal-03984470⟩
65 Consultations
125 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More