output
20162025
most citedA Fast Randomized Geometric Algorithm for Computing Riemann-Roch Spaces

14 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing math.NTShow all

5 papers · 1 filter

math.NT2025

Fast evaluation of Riemann theta functions in any dimension

Noam D. Elkies, Jean Kieffer

We describe an algorithm to numerically evaluate Riemann theta functions in any dimension in quasi-linear time in terms of the required precision, uniformly on reduced input. This…

math.NT2025

Computing Isomorphisms between Products of Supersingular Elliptic Curves

Pierrick Gaudry, Julien Soumier, Pierre-Jean Spaenlehauer

The Deligne-Ogus-Shioda theorem guarantees the existence of isomorphisms between products of supersingular elliptic curves over finite fields. In this paper, we present methods for…

math.NT2020

Evaluating modular equations for abelian surfaces

Jean Kieffer

We design efficient algorithms to evaluate modular equations of Siegel and Hilbert type for abelian surfaces over number fields or finite fields using complex approximations. Their…

math.NT2017

Improved Complexity Bounds for Counting Points on Hyperelliptic Curves

Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer

We present a probabilistic Las Vegas algorithm for computing the local zeta function of a hyperelliptic curve of genus defined over . It is based on the approache…

math.NT2016★ 2 cited

Twelve new primitive binary trinomials

Richard P. Brent, Paul Zimmermann

We exhibit twelve new primitive trinomials over GF(2) of record degrees , , and . In addition we report the first Mersenne exponent not ruled out by S…