Counting Points on Hyperelliptic Curves over Finite Fields

We describe some algorithms for computing the cardinality of hyperelliptic curves and their Jacobians over finite fields. They include several methods for obtaining the result modulo small primes and prime powers, in particular an algorithm à la Schoof for genus 2 using Cantor’s division polynomials...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Gaudry, Pierrick, Harley, Robert
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Abelian Variety Algorithmics. Computability. Computer arithmetics Applied sciences Characteristic Polynomial Computer Science Computer science control theory systems Cryptography and Security Elliptic Curf Exact sciences and technology Finite Field Prime Power Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!