Sommaire

  • Cet exposé a été présenté le 10 décembre 2021.

Description

  • Orateur

    Ba Duc Pham - Rennes

In 2005, Faure and Loidreau proposed a new rank-metric cryptosystem inspired from the Hamming metric scheme of Augot-Finiasz in 2003. In 2018, it was broken by the attack of Gaborit, Otmani and Kalachi. Recently, there are some attempts of repairing the Faure-Loidreau scheme, for example the work of Renner, Puchinger and Wachter–Zeh which is called LIGA. In this thesis, we also introduce a new cryptosystem so-called RAMESSES which is another repairing of Faure-Loidreau scheme.<br/> Besides, we also study about the recent attack of Coggia and Couveur in the Loidreau's cryptosystem (2017). Although they only propose an idea for a special case of the dimension of secret subspace, this attack can be generalized. In this thesis, we propose an analysis of Coggia-Couvreur attack on Loidreau’s rank-metric public-key encryption scheme in the general case. The last part is a study about the decoding of the sum of Gabidulin codes which is inspired from the work of Loidreau in 2005 "Welch-Berlekamp Like Algorithm for Decoding Gabidulin Codes". This work is also an attempt to repair the Loidreau's cryptosystem (2017) to avoid the Coggia-Couveur's attack.<br/> lien:

Prochains exposés

  • Efficient zero-knowledge proofs and arguments in the CL framework

    • 07 mars 2025 (13:45 - 14:45)

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

    Orateur : Agathe Beaugrand - Institut de Mathématiques de Bordeaux

    The CL encryption scheme, proposed in 2015 by Castagnos and Laguillaumie, is a linearly homomorphic encryption scheme, based on class groups of imaginary quadratic fields. The specificity of these groups is that their order is hard to compute, which means it can be considered unknown. This particularity, while being key in the security of the scheme, brings technical challenges in working with CL,[…]
  • Constant-time lattice reduction for SQIsign

    • 14 mars 2025 (13:45 - 14:45)

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

    Orateur : Sina Schaeffler - IBM Research

    SQIsign is an isogeny-based signature scheme which has recently advanced to round 2 of NIST's call for additional post-quantum signatures. A central operation in SQIsign is lattice reduction of special full-rank lattices in dimension 4. As these input lattices are secret, this computation must be protected against side-channel attacks. However, known lattice reduction algorithms like the famous[…]
  • Circuit optimisation problems in the context of homomorphic encryption

    • 21 mars 2025 (13:45 - 14:45)

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

    Orateur : Sergiu Carpov - Arcium

    Fully homomorphic encryption (FHE) is an encryption scheme that enables the direct execution of arbitrary computations on encrypted data. The first generation of FHE schemes began with Gentry's groundbreaking work in 2019. It relies on a technique called bootstrapping, which reduces noise in FHE ciphertexts. This construction theoretically enables the execution of any arithmetic circuit, but[…]
  • Cycles of pairing-friendly abelian varieties

    • 28 mars 2025 (13:45 - 14:45)

    • Salle Guernesey, ISTIC

    Orateur : Maria Corte-Real Santos - ENS Lyon

    A promising avenue for realising scalable proof systems relies on the existence of 2-cycles of pairing-friendly elliptic curves. More specifically, such a cycle consists of two elliptic curves E/Fp and E’/Fq that both have a low embedding degree and also satisfy q = #E(Fp) and p = #E’(Fq). These constraints turn out to be rather restrictive; in the decade that has passed since 2-cycles were first[…]
    • Cryptography

  • Journées C2

    • 04 avril 2025 (00:00 - 18:00)

    • Pornichet

Voir les exposés passés