Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric

DOI10.1007/978-3-030-81293-5_3zbMATH Open1485.94068arXiv2104.12810OpenAlexW3165281604MaRDI QIDQ2118524FDOQ2118524

Simona Etinski, Thomas Debris-Alazard, André Chailloux

Publication date: 22 March 2022

Abstract: The security of code-based cryptography usually relies on the hardness of the syndrome decoding (SD) problem for the Hamming weight. The best generic algorithms are all improvements of an old algorithm by Prange, and they are known under the name of Information Set Decoding (ISD) algorithms. This work aims to extend ISD algorithms' scope by changing the underlying weight function and alphabet size of SD. More precisely, we show how to use Wagner's algorithm in the ISD framework to solve SD for a wide range of weight functions. We also calculate the asymptotic complexities of ISD algorithms both in the classical and quantum case. We then apply our results to the Lee metric, which currently receives a significant amount of attention. By providing the parameters of SD for which decoding in the Lee weight seems to be the hardest, our study could have several applications for designing code-based cryptosystems and their security analysis, especially against quantum adversaries.

Full work available at URL: https://arxiv.org/abs/2104.12810

zbMATH Keywords

code-based cryptographyWagner's algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Decoding (94B35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
• Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
• Title not available (Why is that?)
• On the inherent intractability of certain coding problems (Corresp.)
• Title not available (Why is that?)
• Ternary Syndrome Decoding with large weight
• On the asymptotic behaviour of Lee-codes
• An algebraic attack on rank metric code-based cryptosystems
• Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
• On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
• Durandal: a rank metric based signature scheme
• Title not available (Why is that?)
• Quantum information set decoding algorithms
• Title not available (Why is that?)
• Improvements of algebraic attacks for solving the rank decoding and MinRank problems

Cited In (8)

• An algorithm for generalized syndrome decoding problem
• Hybrid decoding -- classical-quantum trade-offs for information set decoding
• On the hardness of the Lee syndrome decoding problem
• Information set decoding for Lee-metric codes using restricted balls
• Wave Parameter Selection
• Interleaved Prange: a new generic decoder for interleaved codes
• \textsf{FuLeeca}: a Lee-based signature scheme
• On the (in)security of optimized Stern-like signature schemes

Uses Software

• Durandal

This page was built for publication: Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118524)