Generalization of the Ball-Collision Algorithm
Information Theory
2018-12-31 v1 Cryptography and Security
math.IT
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.
Cite
@article{arxiv.1812.10955,
title = {Generalization of the Ball-Collision Algorithm},
author = {Carmelo Interlando and Karan Khathuria and Nicole Rohrer and Joachim Rosenthal and Violetta Weger},
journal= {arXiv preprint arXiv:1812.10955},
year = {2018}
}