Filter by event type

Select one or more filters. This choice will reload the page to display the filtered results.

Filter by tag

Select one or more filters. This choice will reload the page to display the filtered results.

Remove all filters

7 results

    • Seminar

    • Cryptography

    Lie algebras and the security of cryptosystems based on classical varieties in disguise

    • November 07, 2025 (13:45 - 14:45)

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

    Speaker : 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[…]
    • Cryptography

    • Seminar

    • Cryptography

    Some applications of linear programming to Dilithium

    • November 14, 2025 (13:45 - 14:45)

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

    Speaker : Paco AZEVEDO OLIVEIRA - Thales & UVSQ

    Dilithium is a signature algorithm, considered post-quantum, and recently standardized under the name ML-DSA by NIST. Due to its security and performance, it is recommended in most use cases.   During this presentation, I will outline the main ideas behind two studies, conducted in collaboration with Andersson Calle-Vierra, Benoît Cogliati, and Louis Goubin, which provide a better understanding of[…]
    • Seminar

    • Cryptography

    Wagner’s Algorithm Provably Runs in Subexponential Time for SIS^∞

    • November 21, 2025 (13:45 - 14:45)

    • Salle Guernesey à l'ISTIC

    Speaker : Johanna Loyer - Inria Saclay

    At CRYPTO 2015, Kirchner and Fouque claimed that a carefully tuned variant of the Blum-Kalai-Wasserman (BKW) algorithm (JACM 2003) should solve the Learning with Errors problem (LWE) in slightly subexponential time for modulus q = poly(n) and narrow error distribution, when given enough LWE samples. Taking a modular view, one may regard BKW as a combination of Wagner’s algorithm (CRYPTO 2002), run[…]
    • Cryptography

    • Seminar

    • SemSecuElec

    Conformité TEMPEST et compromission d’information au travers de l’arbre d’alimentation d’un équipement

    • November 28, 2025 (10:00 - 11:00)

    • Inria Center of the University of Rennes - Espace de conférences

    Speaker : Tristan PECHERAU, David HARDY - Thalès

    THALES conçoit des équipements cryptographiques et de radiocommunication tactiques, navales et aéronautiques, embarquant des éléments de chiffrement pour la sécurité des communications. Cette sécurité notamment d’un point de vue des émanations électromagnétiques est normée. Ces normes de sécurité de l’information, sont connues sous le nom de code “TEMPEST”, correspondant aux normes OTAN SDIP-27,[…]
    • Seminar

    • SemSecuElec

    Prise de contrôle d’un infodivertissement automobile à distance

    • November 28, 2025 (11:00 - 12:00)

    • Inria Center of the University of Rennes - Espace de conférences

    Speaker : Philippe Trebuchet, Guillaume Bouffard - ANSSI

    Les véhicules connectés intègrent de nombreuses technologies de communications sans-fil à distance, comme celles exploitant les protocoles Bluetooth ou WiFi. Si le gain en confort d’utilisation et d’interaction est notable, la mise à disposition de ce type d’interfaces augmente les risques en matière de cybersécurité. Dans cet article, nous analysons l’implémentation de la pile Bluetooth embarquée[…]
    • SemSecuElec

    • Network

    • Embedded systems

    • Seminar

    • Cryptography

    CryptoVerif: a computationally-sound security protocol verifier

    • November 28, 2025 (13:45 - 14:45)

    • Batiment 32B salle 12

    Speaker : Bruno Blanchet - Inria

    CryptoVerif is a security protocol verifier sound in the computational model of cryptography. It produces proofs by sequences of games, like those done manually by cryptographers. It has an automatic proof strategy and can also be guided by the user. It provides a generic method for specifying security assumptions on many cryptographic primitives, and can prove secrecy, authentication, and[…]
    • Cryptography