Table of contents

  • This session has been presented June 07, 2002.

Description

  • Speaker

    Alan Lauder - Oxford University

I will describe an algorithm for computing the zeta function of an arbitrary hyperelliptic curve in characteristic 2. This is a generalisation of an earlier method of myself and Wan, which tackled a restricted class of curves. The algorithm reduces the problem to that of computing the L-function of an additive character sum over an open subset of the projective line. This latter task can be achieved using the Dwork-Reich trace formula, Dwork's analytic construction of an additive character, and a method for `cohomological reduction' similar to the `Hermite reduction' algorithm used in the symbolic integration of rational functions. The talk is based upon joint work with Daqing Wan. See http://web.comlab.ox.ac.uk/oucl/work/alan.lauder/ for a version of the earlier paper, which has now appeared in LMS JCM, and also two other related papers.

Next sessions

  • Journées C2: pas de séminaire

    • April 03, 2026 (13:45 - 14:45)

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

  • Endomorphisms via Splittings

    • April 10, 2026 (13:45 - 14:45)

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

    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

Show previous sessions
Page top