activity
20082023
most citedElliptic periods and primality proving

1 citations · 2 across the 6 of their papers we have counts for

collaborators
Showing math.NTShow all

6 papers · 1 filter

math.NT2023

Bad witnesses for a composite number

Johnathan Djella Legnongo, Tony Ezome, Florian Luca

We describe the average sizes of the set of bad witnesses for a pseudo-primality test which is the product of a multiple-rounds Miller-Rabin test by the Galois test.

math.NT2023

Rational Points of some genus curves from the rank quotient strategy

Tony Ezome, Brice Miayoka Moussolo, Régis Freguin Babindamana

In 1922, Mordell conjectured that the set of rational points on a smooth curve over with genus is finite. This has been proved by Faltings in 1983. Howev…

math.NT2021

The equivariant complexity of multiplication in finite field extensions

Jean-Marc Couveignes, Tony Ezome

We study the complexity of multiplication of two elements in a finite field extension given by their coordinates in a normal basis. We show how to control this complexity using the…

math.NT2020

On finite field arithmetic in characteristic

Tony Ezome, Mohamadou Sall

We are interested in extending normal bases of to bases of which allow fast arithmetic in $\mathbf{F}…

math.NT2012★ 1 cited

A faster pseudo-primality test

Jean-Marc Couveignes, Tony Ezome, Reynald Lercier

We propose a pseudo-primality test using cyclic extensions of . For every positive integer , this test achieves the security of Miller-Rab…

math.NT2008★ 1 cited

Elliptic periods and primality proving

Jean-Marc Couveignes, Tony Ezome, Reynald Lercier

We define the ring of elliptic periods modulo an integer and give an elliptic version of the AKS primality criterion.