Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
From MaRDI portal
Publication:2118524
DOI10.1007/978-3-030-81293-5_3zbMath1485.94068arXiv2104.12810OpenAlexW3165281604MaRDI QIDQ2118524
Simona Etinski, Thomas Debris-Alazard, André Chailloux
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/2104.12810
Related Items (5)
On the hardness of the Lee syndrome decoding problem ⋮ Interleaved Prange: a new generic decoder for interleaved codes ⋮ An algorithm for generalized syndrome decoding problem ⋮ On the (in)security of optimized Stern-like signature schemes ⋮ Information set decoding for Lee-metric codes using restricted balls
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ternary Syndrome Decoding with large weight
- On the asymptotic behaviour of Lee-codes
- Quantum information set decoding algorithms
- An algebraic attack on rank metric code-based cryptosystems
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- Durandal: a rank metric based signature scheme
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- On the inherent intractability of certain coding problems (Corresp.)
This page was built for publication: Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
