Sommaire

Description

  • Orateur

    Mingjie Chen - KU Leuven

In 2006, de Graaf et al. proposed a strategy based on Lie algebras for finding a linear transformation in the projective linear group that connects two linearly equivalent projective varieties defined over the rational numbers. Their method succeeds for several families of “classical” varieties, such as Veronese varieties, which are known to have large automorphism groups.

 

In this talk, we explain how to extend their Lie algebra method to finite fields, which introduces additional technical difficulties because of the positive characteristic. We show that the method works for Veronese varieties of dimension at least two over finite fields whose characteristic is greater than three and does not divide the dimension plus one.

 

We demonstrate that this leads to polynomial-time attacks against two candidate post-quantum key exchange protocols that are based on disguised Veronese surfaces and threefolds, which were recently proposed by Alzati et al. Furthermore, we provide strong evidence for the vulnerability of a digital signature scheme that relies on secant varieties of Grassmannians of projective lines, although for now this does not amount to a complete attack because the scheme operates over finite fields of characteristic two.

Infos pratiques

  • Date

    07 novembre 2025 (13:45 - 14:45)
  • Emplacement

    IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes Amphi Lebesgue
    Localiser sur Google Maps
  • Ajouter l'exposé à mon agenda

  • Video meet

    The seminar is systematically visible by videoconference

    Accèder à la visio-conférence

Prochains exposés

  • Dual attacks in code-based (and lattice-based) cryptography

    • 19 septembre 2025 (13:45 - 14:45)

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

    Orateur : Charles Meyer-Hilfiger - Inria Rennes

    The hardness of the decoding problem and its generalization, the learning with errors problem, are respectively at the heart of the security of the Post-Quantum code-based scheme HQC and the lattice-based scheme Kyber. Both schemes are to be/now NIST standards. These problems have been actively studied for decades, and the complexity of the state-of-the-art algorithms to solve them is crucially[…]
    • Cryptography

Voir les exposés passés