Description
Soit L/K une extension de corps locaux de degré [L:K]=car K=p>0. Soit O_L l'anneau des entiers de L. Lorsque L/K est totalement ramifiée, on étudie la structure de O_L comme module sur l'ordre A associé à l'extension L/K. A l'aide d'arguments essentiellement combinatoires nous donnerons un critère purement algébrique pour que O_L soit libre sur A : ce résultat renforce des travaux récents de Aiba et Lettl et s'obtient à partir d'une preuve indépendante. Nous présenterons également un résultat plus général qui permet de calculer directement le nombre minimal de générateurs de O_L comme A-module.
Next sessions
-
Verification of Rust Cryptographic Implementations with Aeneas
Speaker : 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[…] -
On the average hardness of SIVP for module lattices of fixed rank
Speaker : 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[…] -
Endomorphisms via Splittings
Speaker : 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
-