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

14 results

    • Seminar

    • Cryptography

    Cyclotomic Cosets: Hidden Subgroup and Quantum Sieving Algorithm for Prime-Power Moduli

    • November 06, 2026 (13:45 - 14:45)

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

    Speaker : Mathias Boucher - Université de Rennes

    The Dihedral Coset Problem (DCP), also known as the hidden shift problem, plays a fundamental role in post-quantum public-key cryptography, since the Learning-With-Error problem reduces to DCP. The “Simon meets Kuperberg” quantum algorithm by Bonnetain and Naya-Plasencia solves the DCP in quasi-polynomial time when the modulus is a power of two. We provide a generalization of this algorithm for[…]

    • Seminar

    • Databases

    • Machine learning

    • Economics

    • Law

    • Strategy

    • Information flow control

    Empoisonnement des données et manipulations des LLM: comment protéger nos outils d'IA conversationnelle?

    • November 13, 2026 (09:00 - 10:00)

    • Inria Center of the University of Rennes

    Speaker : Chine LABBE - NewsGuard

    De plus en plus utilisées pour obtenir et vérifier des informations, les IA conversationnelles s'imposent comme un moyen de consommation de l’information incontournable. Pourtant, elles s'appuient sur une technologie par définition peu fiable pour s'informer (l'IA générative hallucine, et fournit des réponses basées sur des calculs probabilistes et non sur des évaluations de la justesse de telle[…]

    • Seminar

    • Cryptography

    Adelic reduction of module lattices

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

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

    Speaker : Henry Bambury - DGA-MI et Inria Rennes

    We give a strict generalisation of the LLL algorithm over number fields, based on the reduction theory of  $GL(n)$ over the adele ring of a number field. Our algorithm is free of heuristics, with rigorous bounds on output quality and complexity.   -- based on joint work with Seungki Kim, Changmin Lee and Phong Nguyen --

    • Cryptography

    • Upcoming

    • Conference

    • Cryptography

    PQC 2026 - Post-Quantum Cryptography conference

    • From November 18, 2026 to November 19, 2026 (09:00 - 18:00)

    • Couvent des Jacobins (Metro lines A & B, Station: Sainte-Anne) - 20 place Sainte-Anne, 35000 Rennes

    Building on the 2021, 2022 and 2024 editions, CREACH LABS and the DGA Information Superiority organise with the support of ANSSI, IRISA, IRMAR and the Pôle d'Excellence Cyber the 4th edition of the Post-Quantum Cryptography workshop during the European Cyber Week 2026.

    • Seminar

    • Cryptography

    European Cyber Week: atelier cryptographie post-quantique

    • From November 18, 2026 to November 19, 2026 (09:00 - 18:00)

    • Couvent des jacobins, Rennes

    Dans la continuité des éditions 2021, 2022 et 2024, la DGA — en partenariat avec CREACH LABS et avec le soutien de l'ANSSI, de l'IRISA, de l'IRMAR et du Pôle d'Excellence Cyber — organise la 4e édition de l'atelier consacré à la cryptographie post-quantique dans le cadre de l'European Cyber Week 2026. Attention, il faut s'inscrire (gratuitement) au préalable — s'inscrire à la conférence Les[…]

    • Seminar

    • Cryptography

    Post-quantum day of the cryptography seminar

    • November 20, 2026 (09:30 - 15:15)

    • Amphithéâtre E - Bâtiment 02A, Campus de Beaulieu - A map of the Beaulieu campus can be viewed at: https://www.univ-rennes.fr/en/beaulieu-campus-map (the building is south of the campus)

    A scientific day devoted to post-quantum cryptography, held in the wake of the European Cyber Week, with talks more technical than those presented at the ECW. The talks will take place at Amphi E in building 02A. To register for lunch, please do so before oct 30th using this link. 
Page top