1 citations · 1 across the 2 of their papers we have counts for
4 papers
Counting points on abelian surfaces over finite fields with Elkies's method
Jean Kieffer
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. ab…
Certified Newton schemes for the evaluation of low-genus theta functions
Jean Kieffer
Theta functions and theta constants in low genus, especially genus 1 and 2, can be evaluated at any given point in quasi-linear time in the required precision using Newton schemes…
Towards practical key exchange from ordinary isogeny graphs
Luca De Feo, Jean Kieffer, Benjamin Smith
We revisit the ordinary isogeny-graph based cryptosystems of Couveignes and Rostovtsev-Stolbunov, long dismissed as impractical. We give algorithmic improvements that accelerate ke…
Accelerating the Couveignes Rostovtsev Stolbunov key exchange protocol
Jean Kieffer
We study a key exchange protocol based on isogenies between ordinary elliptic curves over a finite field, first mentioned by Couveignes and investigated by Rostovtsev and Stolbunov…