Improved information set decoding algorithms over Galois ring in the Lee metric
From MaRDI portal
Publication:6131036
DOI10.1007/s11424-023-1512-6MaRDI QIDQ6131036
No author found.
Publication date: 3 April 2024
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ternary Syndrome Decoding with large weight
- Information set decoding in the Lee metric with applications to cryptography
- Two decoding algorithms for linear codes
- Some new NP-complete coding problems
- Improved identification schemes based on error-correcting codes
- On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
- Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation
- 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
- On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
- A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Decoding One Out of Many
- Attacking and Defending the McEliece Cryptosystem
- Information-Set Decoding for Linear Codes over F q
- 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
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
- Smaller Decoding Exponents: Ball-Collision Decoding
- Generalization of the Ball-Collision Algorithm
- Introduction to Coding Theory
This page was built for publication: Improved information set decoding algorithms over Galois ring in the Lee metric
