arXiv · 1402.3246
Computing Hasse-Witt matrices of hyperelliptic curves in average polynomial time
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.
Explore related subjects
Keep this discovery
David Harvey, Andrew V. Sutherland. 2014-02-13. Computing Hasse-Witt matrices of hyperelliptic curves in average polynomial time. https://doi.org/10.1112/s1461157014000187
Cite the original work for its findings. Save a collection to share your selection of sources.