An algorithm for generalized syndrome decoding problem
From MaRDI portal
Publication:6112190
DOI10.3934/amc.2022080zbMath1522.94130MaRDI QIDQ6112190
Publication date: 7 July 2023
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ternary Syndrome Decoding with large weight
- Decoding linear codes with high error rate and its impact for LPN security
- Encryption scheme based on expanded Reed-Solomon codes
- Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Algebraic Attack against Variants of McEliece with Goppa Polynomial of a Special Form
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Information-Set Decoding for Linear Codes over F q
- Code-based cryptography
- Security Bounds for the Design of Code-Based Cryptosystems
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- The complexity of information set decoding
- On the inherent intractability of certain coding problems (Corresp.)
- A new identification scheme based on syndrome decoding
- On the Security of Subspace Subcodes of Reed–Solomon Codes for Public Key Encryption
- Smaller Decoding Exponents: Ball-Collision Decoding
- Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$
- Generalization of the Ball-Collision Algorithm
This page was built for publication: An algorithm for generalized syndrome decoding problem
