Counting Points on Genus 2 Curves over Finite Fields (Notes de l'exposé plus bas)
Jeudi, 4 Mai, 2017 - 10:30
Résumé :
We recap the algorithm of Schoof, Elkies, and Atkin for efficient point counting on elliptic curves over finite fields, and show how to generalise the algorithm to genus 2 curves over finite fields (with maximal real multiplication). Under some heuristic assumptions, this is the fastest known algorithm to count points on genus 2 curves over large prime fields.
Fichier:
Institution de l'orateur :
Université de Leiden
Thème de recherche :
Théorie des nombres
Salle :
Salle 4