Generalization of the Ball-Collision Algorithm
arXiv:1812.10955v120 citations
Originality Synthesis-oriented
AI Analysis
This work addresses incremental improvements in coding theory for researchers in cryptography and error correction.
The paper generalizes the Ball-Collision Algorithm from binary to general finite fields, providing a complexity analysis and comparing asymptotic complexity to other generalized information set decoding algorithms.
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.