International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

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

Authors:
Izuru Kitamura
Masanobu Katagi
Download:
URL: http://eprint.iacr.org/2003/248
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2003-11961,
  title={Efficient Implementation of Genus Three Hyperelliptic Curve Cryptography over GF(2^n)},
  booktitle={IACR Eprint archive},
  keywords={implementation / hyperelliptic curve, SIMD},
  url={http://eprint.iacr.org/2003/248},
  note={ Masanobu.Katagi@jp.sony.com 12384 received 28 Nov 2003},
  author={Izuru Kitamura and Masanobu Katagi},
  year=2003
}