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 2025Show all

3 papers · 1 filter

quant-ph2025

A Tight Quantum Algorithm for Multiple Collision Search

Xavier Bonnetain, Johanna Loyer, André Schrottenloher +1

Searching for collisions in random functions is a fundamental computational problem, with many applications in symmetric and asymmetric cryptanalysis. When one searches for a singl…

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…