Generalization of the Ball-Collision Algorithm

Autor:	Carmelo Interlando, Joachim Rosenthal, Nicole Rohrer, Violetta Weger, Karan Khathuria
Přispěvatelé:	University of Zurich, Khathuria, Karan
Jazyk:	angličtina
Rok vydání:	2018
Předmět:	FOS: Computer and information sciences Computer Science - Cryptography and Security Computer science Computer Science - Information Theory 340 Law 610 Medicine & health 0102 computer and information sciences 02 engineering and technology 01 natural sciences Binary fields 510 Mathematics ISD 0202 electrical engineering electronic engineering information engineering Discrete Mathematics and Combinatorics Ball (mathematics) Algebra and Number Theory Information set Information Theory (cs.IT) lcsh:Mathematics 020206 networking & telecommunications Asymptotic complexity Coding theory lcsh:QA1-939 16. Peace & justice Collision 10123 Institute of Mathematics Finite field Ball-collision 010201 computation theory & mathematics 2607 Discrete Mathematics and Combinatorics Cryptography and Security (cs.CR) Algorithm Decoding methods 2602 Algebra and Number Theory
Zdroj:	Journal of Algebra Combinatorics Discrete Structures and Applications, Vol 7, Iss 2 (2020)
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a30eb2cc7dc37339d8fe5f0e760f3ab4 http://arxiv.org/abs/1812.10955 Zobrazit plný text záznamu