- The code designed with P. Gaudry and P.-J. Spaenlehauer to experiment our point-counting algorithm for genus-3 hyperelliptic curves with explicit real multiplication can be found here.
- Using the above code, P.~Gaudry, P.-J. Spaenlehauer and I counted points on a genus-3 hyperelliptic curve with explicit RM defined over a 64-bit prime field. This gives a 192-bit Jacobian, which is a record size.