Sommaire

  • Cet exposé a été présenté le 01 avril 2011.

Description

  • Orateur

    Christiane Peters - Technische Universiteit Eindhoven

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

  • Polytopes in the Fiat-Shamir with Aborts Paradigm

    • 29 novembre 2024 (13:45 - 14:45)

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Orateur : Hugo Beguinet - ENS Paris / Thales

    The Fiat-Shamir with Aborts paradigm (FSwA) uses rejection sampling to remove a secret’s dependency on a given source distribution.&nbsp; Recent results revealed that unlike the uniform distribution in the hypercube, both the continuous Gaussian and the uniform distribution within the hypersphere minimise the rejection rate and the size of the proof of knowledge. However, in practice both these[…]
    • Cryptographie

    • Primitive asymétrique

    • Mode et protocole

  • Post-quantum Group-based Cryptography

    • 20 décembre 2024 (13:45 - 14:45)

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Orateur : Delaram Kahrobaei - The City University of New York

Voir les exposés passés