On the practical performance of hyperelliptic curve cryptosystems in software implementation

Yasuyuki Sakai, Kouichi Sakurai

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

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
VolumeE83-A
Issue number4
Publication statusPublished - Jan 1 2000

Fingerprint

Hyperelliptic Curves
Cryptosystem
Cryptography
Software
Program processors
Theoretical Analysis
Experimental Results

All Science Journal Classification (ASJC) codes

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

Cite this

@article{3937d6e4ee5a49d89cc93dae806d608c,
title = "On the practical performance of hyperelliptic curve cryptosystems in software implementation",
abstract = "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.",
author = "Yasuyuki Sakai and Kouichi Sakurai",
year = "2000",
month = "1",
day = "1",
language = "English",
volume = "E83-A",
pages = "692--701",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "4",

}

TY - JOUR

T1 - On the practical performance of hyperelliptic curve cryptosystems in software implementation

AU - Sakai, Yasuyuki

AU - Sakurai, Kouichi

PY - 2000/1/1

Y1 - 2000/1/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=0033685799&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033685799&partnerID=8YFLogxK

M3 - Article

VL - E83-A

SP - 692

EP - 701

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 4

ER -