Quantum Reduction of Finding Short Code Vectors to the Decoding Problem - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2022

Quantum Reduction of Finding Short Code Vectors to the Decoding Problem

Résumé

We give a quantum reduction from finding short codewords in a random linear code to decoding for the Hamming metric. This is the first time such a reduction (classical or quantum) has been obtained. Our reduction adapts to linear codes Stehl\'{e}-Steinfield-Tanaka-Xagawa' re-interpretation of Regev's quantum reduction from finding short lattice vectors to solving the Closest Vector Problem. The Hamming metric is a much coarser metric than the Euclidean metric and this adaptation has needed several new ingredients to make it work. For instance, in order to have a meaningful reduction it is necessary in the Hamming metric to choose a very large decoding radius and this needs in many cases to go beyond the radius where decoding is unique. Another crucial step for the analysis of the reduction is the choice of the errors that are being fed to the decoding algorithm. For lattices, errors are usually sampled according to a Gaussian distribution. However, it turns out that the Bernoulli distribution (the analogue for codes of the Gaussian) is too much spread out and can not be used for the reduction with codes. Instead we choose here the uniform distribution over errors of a fixed weight and bring in orthogonal polynomials tools to perform the analysis and an additional amplitude amplification step to obtain the aforementioned result.

Dates et versions

hal-04276190 , version 1 (17-01-2022)
hal-04276190 , version 2 (08-11-2023)

Identifiants

Citer

Thomas Debris-Alazard, Maxime Remaud, Jean-Pierre Tillich. Quantum Reduction of Finding Short Code Vectors to the Decoding Problem. 2022. ⟨hal-04276190v1⟩
79 Consultations
8 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More