Paper 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.

Metadata
Available format(s)
PDF PS
Category
Implementation
Publication info
Published elsewhere. Unknown where it was published
Keywords
hyperelliptic curveSIMD
Contact author(s)
Masanobu Katagi @ jp sony com
History
2003-11-30: received
Short URL
https://ia.cr/2003/248
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2003/248,
      author = {Izuru Kitamura and Masanobu Katagi},
      title = {Efficient Implementation of Genus Three Hyperelliptic Curve Cryptography over GF(2^n)},
      howpublished = {Cryptology ePrint Archive, Paper 2003/248},
      year = {2003},
      note = {\url{https://eprint.iacr.org/2003/248}},
      url = {https://eprint.iacr.org/2003/248}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.