687 résultats

• • Séminaire

  • SoSysec

  Les jeux vidéo de l’écran au réel : enjeux juridiques et (géo)politiques au prisme de la cybersécurité

  • 11 février 2026 (14:00 - 15:30)

  • Pôle Numérique Rennes Beaulieu (PNRB)

  Orateur : Léandre Lebon, Sandrine Turgis - Univ Rennes, IODE

  Protection des droits d’auteur, lutte contre les techniques de triche, interactions avec la guerre et les conflits hybrides, enjeux de démocratie ... Sous l’angle de la cybersécurité les enjeux juridiques et (géo)politiques des jeux video sont nombreux. Cette présentation du groupe de travail sur les jeux video (GTJV) permettra d’alimenter la réflexion sur l’articulation entre jeux video et[…]

  • Law

• • Séminaire

  • Cryptographie

  Attacks and Remedies for Randomness in AI: Cryptanalysis of PHILOX and THREEFRY

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

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

  Orateur : Yevhen Perehuda - Ruhr-University Bochum

  In this work, we address the critical yet understudied question of the security of the most widely deployed pseudorandom number generators (PRNGs) in AI applications. We show that these generators are vulnerable to practical and low-cost attacks. With this in mind, we conduct an extensive survey of randomness usage in current applications to understand the efficiency requirements imposed in[…]

  • Cryptography

• • Séminaire

  • Cryptographie

  Journées C2: pas de séminaire

  • 03 avril 2026 (13:45 - 14:45)

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

• • Séminaire

  • Cryptographie

  On the average hardness of SIVP for module lattices of fixed rank

  • 06 mars 2026 (13:45 - 14:45)

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

  Orateur : Radu Toma - Sorbonne Université

  In joint work with Koen de Boer, Aurel Page, and Benjamin Wesolowski, we study the hardness of the approximate Shortest Independent Vectors Problem (SIVP) for random module lattices. We use here a natural notion of randomness as defined originally by Siegel through Haar measures. By proving a reduction, we show it is essentially as hard as the problem for arbitrary instances. While this was[…]

• • Séminaire

  • Cryptographie

  Endomorphisms via Splittings

  • 10 avril 2026 (13:45 - 14:45)

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

  Orateur : Min-Yi Shen - No Affiliation

  One of the fundamental hardness assumptions underlying isogeny-based cryptography is the problem of finding a non-trivial endomorphism of a given supersingular elliptic curve. In this talk, we show that the problem is related to the problem of finding a splitting of a principally polarised superspecial abelian surface. In particular, we provide formal security reductions and a proof-of-concept[…]

  • Cryptography

• • Séminaire

  • Cryptographie

  Verification of Rust Cryptographic Implementations with Aeneas

  • 13 février 2026 (13:45 - 14:45)

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

  Orateur : Aymeric Fromherz - Inria

  From secure communications to online banking, cryptography is the cornerstone of most modern secure applications. Unfortunately, cryptographic design and implementation is notoriously error-prone, with a long history of design flaws, implementation bugs, and high-profile attacks. To address this issue, several projects proposed the use of formal verification techniques to statically ensure the[…]