Description
The McEliece cryptosystem is based on classical Goppa codes over F_2. Generalizations of the McEliece cryptosystem using Goppa codes over larger fields F_q were investigated but not found to offer advantages for small q. We showed that codes over F_31 offer advantages in key size compared to codes over F_2 while maintaining the same security level against all attacks known. However, codes over smaller fields such as F_3 were still not competitive in key size with binary codes.<br/> The "wild McEliece cryptosystem" uses wild Goppa codes over finite fields to achieve smaller public key sizes compared to the original McEliece cryptosystem. This proposal makes "larger tiny fields" attractive and bridges the gap between F_2 and F_31. We added an extra shield to the wild McEliece cryptosystem, slightly increasing key sizes but drastically increasing the pool of Goppa polynomials to choose from.
Prochains exposés
-
Adelic reduction of module lattices
Orateur : Henry Bambury - DGA-MI et Inria Rennes
We give a strict generalisation of the LLL algorithm over number fields, based on the reduction theory of $GL(n)$ over the adele ring of a number field. Our algorithm is free of heuristics, with rigorous bounds on output quality and complexity. -- based on joint work with Seungki Kim, Changmin Lee and Phong Nguyen ---
Cryptography
-
-
European Cyber Week: atelier cryptographie post-quantique
Dans la continuité des éditions 2021, 2022 et 2024, la DGA — en partenariat avec CREACH LABS et avec le soutien de l'ANSSI, de l'IRISA, de l'IRMAR et du Pôle d'Excellence Cyber — organise la 4e édition de l'atelier consacré à la cryptographie post-quantique dans le cadre de l'European Cyber Week 2026. Attention, il faut s'inscrire (gratuitement) au préalable — s'inscrire à la conférence Les[…] -
Post-quantum day of the cryptography seminar
A scientific day devoted to post-quantum cryptography, held in the wake of the European Cyber Week, with talks more technical than those presented at the ECW.