Generalization of the ball-collision algorithm
From MaRDI portal
Publication:5855596
Abstract: In this paper we generalize the Ball-Collision Algorithm by Bernstein, Lange, Peters from the binary field to a general finite field. We also provide a complexity analysis and compare the asymptotic complexity to other generalized information set decoding algorithms.
Recommendations
- Smaller decoding exponents: ball-collision decoding
- Information-set decoding for linear codes over \(\mathbb F_q\)
- 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})\)
- Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
Cites work
- scientific article; zbMATH DE number 4070796 (Why is no real title available?)
- scientific article; zbMATH DE number 4123671 (Why is no real title available?)
- scientific article; zbMATH DE number 1302794 (Why is no real title available?)
- scientific article; zbMATH DE number 493091 (Why is no real title available?)
- A Statistical Decoding Algorithm for General Linear Block Codes
- 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
- A new identification scheme based on syndrome decoding
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- DAGS: key encapsulation using dyadic GS codes
- 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})\)
- Enhanced public key security for the McEliece cryptosystem
- Fast multiplication of large numbers
- Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
- Information-set decoding for linear codes over \(\mathbb F_q\)
- Minimal vectors in linear codes
- New generic algorithms for hard knapsacks
- On computing nearest neighbors with applications to decoding of binary linear codes
- On lower bounds for information set decoding over \(\mathbb F_q\) and on the effect of partial knowledge
- On the complexity of minimum distance decoding of long linear codes
- On the inherent intractability of certain coding problems (Corresp.)
- Security bounds for the design of code-based cryptosystems
- Smaller decoding exponents: ball-collision decoding
- Two decoding algorithms for linear codes
- Variations of the McEliece cryptosystem
Cited in
(11)- An algorithm for generalized syndrome decoding problem
- Information-set decoding with hints
- On the design and security of Lee metric McEliece cryptosystems
- Theoretical analysis of decoding failure rate of non-binary QC-MDPC codes
- Information set decoding in the Lee metric with applications to cryptography
- Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems
- On the hardness of the Lee syndrome decoding problem
- S-semantics -- an example
- Another generalization of the box–ball system with many kinds of balls
- Improved Generic Algorithms for 3-Collisions
- Improved information set decoding algorithms over Galois ring in the Lee metric
This page was built for publication: Generalization of the ball-collision algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5855596)
