Description
In constructive Galois theory, there are two main questions: the direct problem and the inverse problem. For the inverse problem the question is whether it is possible to find a polynomial such that the Galois group of that polynomial is a given finite group. In this talk, we will focus on the direct problem. Given a polynomial f we explain how to compute the Galois group of this polynomial. The presented algorithms are implemented in KASH and work up to degree 23 for polynomials over number fields and function fields (in one variable).<br/> In a second part of the talk, we report on a database containing number fields up to degree 15. The database is complete in the sense that for each transitive group up to degree 15 there is at least one polynomial in the database which has this given Galois group.
Next sessions
-
Adelic reduction of module lattices
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
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
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.