On the practical performance of hyperelliptic curve cryptosystems in software implementation

Yasuyuki Sakai, Kouichi Sakurai

Research output: Contribution to journalArticlepeer-review

20 Citations (Scopus)


We consider the performance of hyperelliptic curve cryptosystems over the fields Fp vs. F2n. We analyze the complexity of the group law of the jacobians JC (Fp) and JC (F2n) and compare their performance taking into consideration the effectiveness of the word size (32-bit or 64-bit) of the applied CPU (Alpha and Pentium) on the arithmetic of the definition field. Our experimental results show that JC(F2n) is faster than JC (Fp) on an Alpha, whereas JC (Fp) is faster than JC(F2n) on a Pentium. Moreover, we investigate the algorithm of the jacobian and the definition-field arithmetic to clarify our results from a practical point of view, with theoretical analysis.

Original languageEnglish
Pages (from-to)692-701
Number of pages10
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number4
Publication statusPublished - Jan 1 2000

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'On the practical performance of hyperelliptic curve cryptosystems in software implementation'. Together they form a unique fingerprint.

Cite this