[PDF][PDF] Status report on the third round of the NIST post-quantum cryptography standardization process
Abstract The National Institute of Standards and Technology is in the process of selecting
publickey cryptographic algorithms through a public, competition-like process. The new …
publickey cryptographic algorithms through a public, competition-like process. The new …
Algebraic properties of polar codes from a new polynomial formalism
Polar codes form a very powerful family of codes with a low complexity decoding algorithm
that attains many information theoretic limits in error correction and source coding. These …
that attains many information theoretic limits in error correction and source coding. These …
[图书][B] Concise encyclopedia of coding theory
Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …
Revisiting algebraic attacks on MinRank and on the rank decoding problem
Abstract The Rank Decoding problem (RD) is at the core of rank-based cryptography.
Cryptosystems such as ROLLO and RQC, which made it to the second round of the NIST …
Cryptosystems such as ROLLO and RQC, which made it to the second round of the NIST …
Polynomial time attack on wild McEliece over quadratic extensions
We present a polynomial-time structural attack against the McEliece system based on Wild
Goppa codes defined over a quadratic finite field extension. We show that such codes can …
Goppa codes defined over a quadratic finite field extension. We show that such codes can …
Enhanced public key security for the McEliece cryptosystem
This paper studies a variant of the McEliece cryptosystem able to ensure that the code used
as the public key is no longer permutation equivalent to the secret code. This increases the …
as the public key is no longer permutation equivalent to the secret code. This increases the …
A new approach based on quadratic forms to attack the McEliece cryptosystem
We introduce a novel algebraic approach for attacking the McEliece cryptosystem which is
currently at the 4-th round of the NIST competition. The contributions of the article are …
currently at the 4-th round of the NIST competition. The contributions of the article are …
Polynomial time key-recovery attack on high rate random alternant codes
M Bardet, R Mora, JP Tillich - IEEE Transactions on Information …, 2023 - ieeexplore.ieee.org
A long standing open question is whether the distinguisher of high rate alternant codes or
Goppa codes from Faugère, Gauthier-Uma na, Otmani, Perret, and Tillich in 2011 can be …
Goppa codes from Faugère, Gauthier-Uma na, Otmani, Perret, and Tillich in 2011 can be …
Correlated pseudorandomness from the hardness of quasi-abelian decoding
A recent paradigm put forth by Boyle et al.(CCS 2018, Crypto 2019) showed how
pseudorandom correlation generators (PCG) can be used to generate large amounts of …
pseudorandom correlation generators (PCG) can be used to generate large amounts of …
Cryptanalysis of the McEliece public key cryptosystem based on polar codes
Polar codes discovered by Arikan form a very powerful family of codes attaining many
information theoretic limits in the fields of error correction and source coding. They have in …
information theoretic limits in the fields of error correction and source coding. They have in …