Statistical decoding 2.0: reducing decoding to LPN
From MaRDI portal
Publication:6175988
DOI10.1007/978-3-031-22972-5_17arXiv2208.02201MaRDI QIDQ6175988
Jean-Pierre Tillich, Thomas Debris-Alazard, Charles Meyer-Hilfiger, Kevin Carrier
Publication date: 21 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.02201
Related Items (3)
A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions ⋮ Statistical decoding 2.0: reducing decoding to LPN ⋮ Expand-convolute codes for pseudorandom correlation generators from LPN
Cites Work
- Unnamed Item
- Unnamed Item
- Two decoding algorithms for linear codes
- Decoding linear codes with high error rate and its impact for LPN security
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
- Analysis of Information Set Decoding for a Sub-linear Error Weight
- 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})$
- Modern Coding Theory
- Modeling Bit Flipping Decoding Based on Nonorthogonal Check Sums With Application to Iterative Decoding Attack of McEliece Cryptosystem
- Security Bounds for the Design of Code-Based Cryptosystems
- A new identification scheme based on syndrome decoding
- A Statistical Decoding Algorithm for General Linear Block Codes
- A Moment Ratio Bound for Polynomials and Some Extremal Properties of Krawchouk Polynomials and Hamming Spheres
- Smaller Decoding Exponents: Ball-Collision Decoding
- Statistical Decoding Revisited
- Statistical decoding 2.0: reducing decoding to LPN
This page was built for publication: Statistical decoding 2.0: reducing decoding to LPN
