Computing Hasse-Witt matrices of hyperelliptic curves in average polynomial time
Number Theory
2015-12-15 v1
Abstract
We present an efficient algorithm to compute the Hasse-Witt matrix of a hyperelliptic curve C/Q modulo all primes of good reduction up to a given bound N, based on the average polynomial-time algorithm recently introduced by Harvey. An implementation for hyperelliptic curves of genus 2 and 3 is more than an order of magnitude faster than alternative methods for N = 2^26.
Cite
@article{arxiv.1402.3246,
title = {Computing Hasse-Witt matrices of hyperelliptic curves in average polynomial time},
author = {David Harvey and Andrew V. Sutherland},
journal= {arXiv preprint arXiv:1402.3246},
year = {2015}
}
Comments
17 pages