DeepAI AI Chat
Log In Sign Up

Counting points on abelian surfaces over finite fields with Elkies's method

by   Jean Kieffer, et al.

We generalize Elkies's method, an essential ingredient in the SEA algorithm to count points on elliptic curves over finite fields of large characteristic, to the setting of p.p. abelian surfaces. Under reasonable assumptions related to the distribution of Elkies primes, we obtain improvements over Schoof's method in two cases. If the abelian surface A over Fq has RM by a fixed quadratic field F, we reach the same asymptotic complexity Otilde(log4 q) as the SEA algorithm up to constant factors depending on F. If A is defined over a number field, we count points on A modulo sufficiently many primes in Otilde(log6 q) binary operations on average. Numerical experiments demonstrate the practical usability of our methods.


page 1

page 2

page 3

page 4


Algebraic geometry codes over abelian surfaces containing no absolutely irreducible curves of low genus

We provide a theoretical study of Algebraic Geometry codes constructed f...

Factorization and malleability of RSA modules, and counting points on elliptic curves modulo N

In this paper we address two different problems related with the factori...

On the distribution of orders of Frobenius action on ℓ-torsion of abelian surfaces

The computation of the order of Frobenius action on the ℓ-torsion is a p...

Counting superspecial Richelot isogenies and its cryptographic application

We give a characterization of decomposed Richelot isogenies in terms of ...

Genus 2 Supersingular Isogeny Oblivious Transfer

We present an oblivious transfer scheme that extends the proposal made b...

Low-loss connection of weight vectors: distribution-based approaches

Recent research shows that sublevel sets of the loss surfaces of overpar...

A diffusion-driven Characteristic Mapping method for particle management

We present a novel particle management method using the Characteristic M...