International audienceIn this article we discus a probability problem applied in the code based cryptography. It is related to the shape of the polynomials with exactly t different roots. We will show that the structure is very dense and the probability that this type of polynomials has at least one coefficient equal to zero is extremelly low. We treated this issue in our research of natural countermeasures to a timing attack against the polynomial evaluation
Modeling efficient algorithms as polynomial size circuits rather than as polynomial time Turing mach...
Cryptographic attacks are typically constructed by black-box methods and combinations of simpler pro...
This is a preprint of a book chapter published in Lecture Notes in Computer Science,1751, Springer-V...
International audienceIn this article we discus a probability problem applied in the code based cryp...
International audienceThis paper presents a practical cryptanalysis of the Identification Scheme pro...
International audienceModerate Density Parity Check (MDPC) codes are defined here as codes which hav...
This article gives improved algorithms to evaluate a multivariate Boolean polynomial over all the...
International audienceThe simple roots problem is a natural question related to the structure of the...
International audienceIn this paper, we present a new algebraic attack against some special cases of...
We give a polynomial time attack on the McEliece public key cryptosystem based on algebraic geometry...
International audienceIn this paper, we detail two side-channel attacks against the McEliece public-...
La cryptographie à base de codes correcteurs, introduite par Robert McEliece en 1978, est un candida...
International audienceA long standing open question is whether the distinguisher of high rate altern...
International audienceIn this paper we propose a new approach to investigate the security of the McE...
The Goppa Code Distinguishing (GD) problem consists in distinguishing the matrix of Goppa code from ...
Modeling efficient algorithms as polynomial size circuits rather than as polynomial time Turing mach...
Cryptographic attacks are typically constructed by black-box methods and combinations of simpler pro...
This is a preprint of a book chapter published in Lecture Notes in Computer Science,1751, Springer-V...
International audienceIn this article we discus a probability problem applied in the code based cryp...
International audienceThis paper presents a practical cryptanalysis of the Identification Scheme pro...
International audienceModerate Density Parity Check (MDPC) codes are defined here as codes which hav...
This article gives improved algorithms to evaluate a multivariate Boolean polynomial over all the...
International audienceThe simple roots problem is a natural question related to the structure of the...
International audienceIn this paper, we present a new algebraic attack against some special cases of...
We give a polynomial time attack on the McEliece public key cryptosystem based on algebraic geometry...
International audienceIn this paper, we detail two side-channel attacks against the McEliece public-...
La cryptographie à base de codes correcteurs, introduite par Robert McEliece en 1978, est un candida...
International audienceA long standing open question is whether the distinguisher of high rate altern...
International audienceIn this paper we propose a new approach to investigate the security of the McE...
The Goppa Code Distinguishing (GD) problem consists in distinguishing the matrix of Goppa code from ...
Modeling efficient algorithms as polynomial size circuits rather than as polynomial time Turing mach...
Cryptographic attacks are typically constructed by black-box methods and combinations of simpler pro...
This is a preprint of a book chapter published in Lecture Notes in Computer Science,1751, Springer-V...