Table of contents

  • This session has been presented April 17, 2009.

Description

  • Speaker

    Damien Robert - LORIA

Isogenies are an essential tool in Elliptic Curves cryptography, where they are used in a wide variety of area: fast point counting, complex multiplication methods... Velu's formulas give an efficient method for computing such isogenies, but there are no formula known for curves of higher genera or general abelian varieties (except some special case for isogenies of degree 2). In this talk we will present the framework of the theta structure on an abelian variety, developped by Mumford in 1967, which allows us to compute isogenies. For this we lift a theta null point of level $l$, corresponding to an abelian variety B, to the modular space of theta null points of level $lk$. We use a specialized Groebner algorithm that considerably speed-up this phase, and we show how to detect degenerate solutions. To each lifted point corresponds an isogeny of degree $\pi: A \to B$ of degree $k$. We then explain how to compute their dual efficiently.<br/> This is a joint work with Jean-Charles Faugere and David Lubicz.

Next sessions

  • Key Attack on the ACDGV Matrix Encryption Scheme

    • September 25, 2026 (13:45 - 14:45)

    • Batiment 32A salle 15

    Speaker : Anmoal Porwal - Technical University of Munich

    I will present our key-recovery attack on the ACDGV public-key encryption scheme proposed at ASIACRYPT 2024 by Aragon, Couvreur, Dyseryn, Gaborit, and Vinçotte. The secret key is a Gabidulin code hidden by appending random rows and columns and by left- and right-multiplication with invertible matrices. Our attack exploits the resulting algebraic structure to recover an equivalent secret key. It[…]
    • Cryptography

    • Asymmetric primitive

  • Module Learning With Errors and Structured Extrapolated Dihedral Cosets

    • October 02, 2026 (13:45 - 14:45)

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

    Speaker : Jinwei Zheng - Télécom Paris

    The Module Learning With Errors (MLWE) problem is the fundamental hardness assumption underlying the key encapsulation and signature schemes ML-KEM and ML-DSA, which have been selected by NIST for post-quantum cryptography standardization. Understanding its quantum hardness is crucial for assessing the security of these standardized schemes.   Inspired by the equivalence between LWE and[…]
    • Cryptography

Show previous sessions