Table of contents

  • This session has been presented June 27, 2008.

Description

  • Speaker

    Jeroen Demeyer - Universiteit Gent

Consider the projective space P^n over a finite field F_q. A hypersurface is defined by one homogenous equation with coefficients in F_q. For d going to infinity, we show that the probability that a hypersurface of degree d is nonsingular approaches 1/\zeta_{P^n (n+1)}. This is analogous to the well-known fact that the probability that an integer is squarefree equals 1/\zeta(2) = 6/\pi^2. This is a special case of the results in Bjorn Poonen's paper ``Bertini Theorems over Finite Fields'', where he computes the probability that a given variety intersects a random hypersurface. Poonen uses the full power of algebraic geometry, whereas the special case can be proven using only elementary linear algebra and properties of finite fields.

Next sessions

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

  • 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

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

  • 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. 

  • Chiffrement homomorphe à l'aide des groupes après Nuida

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

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

    Speaker : Pierre Guillot - Ravel Technologies/Université de strasbourg

    Nuida et d'autres ont montré comment on peut obtenir un protocole de chiffrement pleinement homomorphe si l'on sait chiffrer les éléments d'un groupe G convenable, tout en sachant faire l'opération de G "en homomorphe".   Les exemples étaient jusqu'à présent limités au chiffrement d'un bit à la fois, avec beaucoup d'opérations à effectuer pour "simuler" les portes logiques usuelles. Je vais[…]

    • Cryptography

Show previous sessions
Page top