Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ

Abstract

In this paper, we present several improvements on the best known explicit formulæ for hyperelliptic curves of genus three and four in characteristic two, including the issue of reducing memory requirements.

Keywords

• elliptic and hyperelliptic curves
• cryptography
• efficient implementation
• explicit formulæ