[Resource Topic] 2003/248: Efficient Implementation of Genus Three Hyperelliptic Curve Cryptography over GF(2^n)

Welcome to the resource topic for 2003/248

Title:
Efficient Implementation of Genus Three Hyperelliptic Curve Cryptography over GF(2^n)

Authors: Izuru Kitamura, Masanobu Katagi

Abstract:

The optimization of the Harley algorithm is an active area of
hyperelliptic curve cryptography.
We propose an efficient method for software implementation of
genus three Harley algorithm over GF(2^n).
Our method is based on fast finite field multiplication using one SIMD operation, SSE2 on Pentium 4, and parallelized Harley algorithm.
We demonstrated that software implementation using proposed method is about 11% faster than conventional implementation.

ePrint: https://eprint.iacr.org/2003/248

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .