Sommaire

  • Cet exposé a été présenté le 26 octobre 2007.

Description

  • Orateur

    Robert Carls - University of Ulm

This talk is about joint work with David Lubicz. By a classical result of Serre and Tate the deformation space of an ordinary abelian variety is given by a formal torus. In Serre-Tate coordinates the problem of canonical lifting is trivial. Unfortunately, in general it is difficult to compute the Serre-Tate parameters of a given abelian variety. Alternatively, one may use canonical coordinates which are induced by a canonical theta structure. Mumford introduced theta structures in order to construct an arithmetic moduli space of abelian varieties. We apply a multi-variate Hensel lifting procedure to a certain set of p-adic theta identities which are obtained using Mumford's formalism of algebraic theta functions. As an application we give a point counting algorithm for ordinary abelian varieties over a finite field which is quasi-quadratic in the degree of the finite field.

Prochains exposés

  • Predicting Module-Lattice Reduction

    • 19 décembre 2025 (13:45 - 14:45)

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

    Orateur : Paola de Perthuis - CWI

    Is module-lattice reduction better than unstructured lattice reduction? This question was highlighted as `Q8' in the Kyber NIST standardization submission (Avanzi et al., 2021), as potentially affecting the concrete security of Kyber and other module-lattice-based schemes. Foundational works on module-lattice reduction (Lee, Pellet-Mary, Stehlé, and Wallet, ASIACRYPT 2019; Mukherjee and Stephens[…]
    • Cryptography

  • Attacking the Supersingular Isogeny Problem: From the Delfs–Galbraith algorithm to oriented graphs

    • 23 janvier 2026 (13:45 - 14:45)

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

    Orateur : Arthur Herlédan Le Merdy - COSIC, KU Leuven

    The threat of quantum computers motivates the introduction of new hard problems for cryptography.One promising candidate is the Isogeny problem: given two elliptic curves, compute a “nice’’ map between them, called an isogeny.In this talk, we study classical attacks on this problem, specialised to supersingular elliptic curves, on which the security of current isogeny-based cryptography relies. In[…]
    • Cryptography

Voir les exposés passés