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
AbstractWe examine new approaches to the problem of decoding general linear codes under the strategi...
Two challenges in algebraic coding theory are addressed within this dissertation. The first one is t...
Decoding of random linear block codes has been long exploited as a computationally hard problem on w...
In this paper we generalize the ball-collision algorithm by Bernstein, Lange, Peters from the binary...
In this paper we generalize the ball-collision algorithm by Bernstein, Lange, Peters from the binary...
Includes bibliographical references (page 38).This paper presents a new decoding algorithm named Var...
We propose here a non asymptotic complexity analysis of some variants of information set decoding. I...
A central paradox of coding theory has been noted for many years, and concerns the existence and con...
Very few public-key cryptosystems are known that can encrypt and decrypt in time $ b^{ 2¿+¿o(1) } $w...
International audienceThe security of code-based cryptography relies primarily on the hardness of ge...
We examine new approaches to the problem of decoding general linear codes under the strategies of fu...
This paper introduces a new generic decoding algorithm that is asymptotically faster than any previo...
Two challenges in algebraic coding theory are addressed within this dissertation. The first one is ...
Decoding of random linear block codes has been long exploited as a computationally hard problem on w...
Information set decoding is an algorithm for decoding any linear code. Expressions for the complexit...
AbstractWe examine new approaches to the problem of decoding general linear codes under the strategi...
Two challenges in algebraic coding theory are addressed within this dissertation. The first one is t...
Decoding of random linear block codes has been long exploited as a computationally hard problem on w...
In this paper we generalize the ball-collision algorithm by Bernstein, Lange, Peters from the binary...
In this paper we generalize the ball-collision algorithm by Bernstein, Lange, Peters from the binary...
Includes bibliographical references (page 38).This paper presents a new decoding algorithm named Var...
We propose here a non asymptotic complexity analysis of some variants of information set decoding. I...
A central paradox of coding theory has been noted for many years, and concerns the existence and con...
Very few public-key cryptosystems are known that can encrypt and decrypt in time $ b^{ 2¿+¿o(1) } $w...
International audienceThe security of code-based cryptography relies primarily on the hardness of ge...
We examine new approaches to the problem of decoding general linear codes under the strategies of fu...
This paper introduces a new generic decoding algorithm that is asymptotically faster than any previo...
Two challenges in algebraic coding theory are addressed within this dissertation. The first one is ...
Decoding of random linear block codes has been long exploited as a computationally hard problem on w...
Information set decoding is an algorithm for decoding any linear code. Expressions for the complexit...
AbstractWe examine new approaches to the problem of decoding general linear codes under the strategi...
Two challenges in algebraic coding theory are addressed within this dissertation. The first one is t...
Decoding of random linear block codes has been long exploited as a computationally hard problem on w...
DOI
Add to ORKG