Genus 2 point counting over prime fields
Authors:
- Pierrick GaudryPGPierrick Gaudry
- Éric SchostÉSÉric Schost
- 1 April 2012
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 47 (4) , 368-400
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Modular Polynomials for Genus 2LMS Journal of Computation and Mathematics, 2009
- Fast genus 2 arithmetic based on Theta functionsJournal of Mathematical Cryptology, 2007
- Fast computation of special resultantsJournal of Symbolic Computation, 2006
- Polynomial evaluation and interpolation on special sets of pointsJournal of Complexity, 2005
- Modular equations for hyperelliptic curvesMathematics of Computation, 2004
- Counting Points on Curves and Abelian Varieties Over Finite FieldsJournal of Symbolic Computation, 2001
- Counting Points on Curves over Finite FieldsJournal of Symbolic Computation, 1998
- Computing Frobenius maps and factoring polynomialscomputational complexity, 1992
- Fast Algorithms for Manipulating Formal Power SeriesJournal of the ACM, 1978
- Evaluating Polynomials at Fixed Sets of PointsSIAM Journal on Computing, 1975