Cryptology ePrint Archive: Report 2021/752

Quantum Reduction of Finding Short Code Vectors to the Decoding Problem

Thomas Debris-Alazard and Maxime Remaud and Jean-Pierre Tillich

Abstract: 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é-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.

Category / Keywords: public-key cryptography / Quantum Reduction, Code-based Cryptography , Generic Decoding Problem

Date: received 4 Jun 2021

Contact author: thomas debris at inria fr,jean-pierre tillich@inria fr,maxime remaud@atos net

Available format(s): PDF | BibTeX Citation

Version: 20210607:062938 (All versions of this report)

Short URL: ia.cr/2021/752


[ Cryptology ePrint archive ]