Practical Algebraic Attack on DAGS

Autor: Alain Couvreur, Manon Bertin, Ayoub Otmani, Magali Bardet

Publikováno v: CBC 2019-7th Code-Based Cryptography Workshop
CBC 2019-7th Code-Based Cryptography Workshop, May 2019, Darmstadt, Germany. pp.86-101, ⟨10.1007/978-3-030-25922-8_5⟩
Code-Based Cryptography ISBN: 9783030259211
CBC

DAGS scheme is a key encapsulation mechanism (KEM) based on quasi-dyadic alternant codes that was submitted to NIST standardization process for a quantum resistant public key algorithm. Recently an algebraic attack was devised by Barelli and Couvreur

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::966cb7976704a2caf839bbf597f7fcf4
https://hal.archives-ouvertes.fr/hal-02125330

A Note on Linear Codes over Semigroup Rings

Autor: Tariq Shah, Antonio Aparecido de Andrade, Atlas Khan

Publikováno v: Trends in Computational and Applied Mathematics. 12:79-89

In this paper, we introduced new construction techniques of BCH, alternant, Goppa, Srivastava codes through the semigroup ring B[X; 13Z0] instead of the polynomial ring B[X; Z0], where B is a finite commutative ring with identity, and for these const

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::edcbd91c5a0968919b0c357ea9ead0a5
https://doi.org/10.5540/tema.2011.012.02.0079

Reducing Key Length of the McEliece Cryptosystem

Autor: Pierre-Louis Cayrel, Ayoub Otmani, Philippe Gaborit, Thierry P. Berger

Publikováno v: Proceedings of Second International Conference on Cryptology-AFRICACRYPT 2009
Proceedings of Second International Conference on Cryptology-AFRICACRYPT 2009, Jun 2009, Gammarth, Tunisia. pp.77-97, ⟨10.1007/978-3-642-02384-2_6⟩
Progress in Cryptology – AFRICACRYPT 2009 ISBN: 9783642023835
AFRICACRYPT

The McEliece cryptosystem is one of the oldest public-key cryptosystems ever designed. It is also the first public-key cryptosystem based on linear error-correcting codes. Its main advantage is to have very fast encryption and decryption functions. H

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::96a3f3090d1374a148903d853815618f
https://hal.archives-ouvertes.fr/hal-01081727/file/ACTI-BERGER-2009-2.pdf

The true dimension of certain alternant codes

Autor: Dianwu Yue, Guangzeng Feng

Publikováno v: Journal of Electronics (China). 17:352-356

By applying a result from geometric Goppa codes, due to H.Schtenoth, the true dimension of certain alternant codes is calculated. The results lead in many cases to an improvement of the usual lower bound for the dimension.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::072f78970fffee79b8021cbd308fb4fa
https://doi.org/10.1007/s11767-000-0010-3

Simplified high-speed high-distance list decoding for alternant codes

Autor: Bernstein, D.J., Yang, B.Y.

Publikováno v: Post-Quantum Cryptography ISBN: 9783642254048
PQCrypto
Post-Quantum Cryptography (4th International Workshop, PQCrypto 2011, Taipei, Taiwan, November 29-December 2, 2011. Proceedings), 200-216
STARTPAGE=200;ENDPAGE=216;TITLE=Post-Quantum Cryptography (4th International Workshop, PQCrypto 2011, Taipei, Taiwan, November 29-December 2, 2011. Proceedings)

This paper presents a simplified list-decoding algorithm to correct any number w of errors in any alternant code of any length n with any designed distance t+1 over any finite field Fq ; in particular, in the classical Goppa codes used in the McEliec

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f8781e87c6d1d4910bd98264e55b517
https://research.tue.nl/en/publications/7a1f42b0-fbd1-4bd2-aa75-2d67295abfa2