Computing Hasse-Witt matrices of hyperelliptic curves in average   polynomial time, II
  We present an algorithm that computes the Hasse-Witt matrix of given hyperelliptic curve over Q at all primes of good reduction up to a given bound N. It is simpler and faster than the previous algorithm developed by the authors. 
David Harvey and Andrew V. Sutherland
math.NT