Cryptology ePrint Archive: Report 2003/248

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

Izuru Kitamura and 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.

Category / Keywords: implementation / hyperelliptic curve, SIMD

Date: received 28 Nov 2003

Contact author: Masanobu Katagi at jp sony com

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20031130:210454 (All versions of this report)

Short URL: ia.cr/2003/248