Over Fp vs. Over F2n and on pentium vs. on alpha in software implementation of hyperelliptic curve cryptosystems

Yasuyuki Sakai, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 effiectiveness 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
Title of host publicationInformation Security and Cryptology - ICISC 1999 - 2nd International Conference, Proceedings
EditorsJooSeok Song
PublisherSpringer Verlag
Pages82-101
Number of pages20
ISBN (Print)3540673806, 9783540673804
DOIs
Publication statusPublished - Jan 1 2000
Event2nd International Conference on Information Security and Cryptology, ICISC 1999 - Seoul, Korea, Republic of
Duration: Dec 9 1999Dec 10 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1787
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2nd International Conference on Information Security and Cryptology, ICISC 1999
CountryKorea, Republic of
CitySeoul
Period12/9/9912/10/99

Fingerprint

Hyperelliptic Curves
Cryptosystem
Cryptography
Software
Program processors
Theoretical Analysis
Experimental Results

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Sakai, Y., & Sakurai, K. (2000). Over Fp vs. Over F2n and on pentium vs. on alpha in software implementation of hyperelliptic curve cryptosystems. In J. Song (Ed.), Information Security and Cryptology - ICISC 1999 - 2nd International Conference, Proceedings (pp. 82-101). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1787). Springer Verlag. https://doi.org/10.1007/10719994_8

Over Fp vs. Over F2n and on pentium vs. on alpha in software implementation of hyperelliptic curve cryptosystems. / Sakai, Yasuyuki; Sakurai, Kouichi.

Information Security and Cryptology - ICISC 1999 - 2nd International Conference, Proceedings. ed. / JooSeok Song. Springer Verlag, 2000. p. 82-101 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1787).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sakai, Y & Sakurai, K 2000, Over Fp vs. Over F2n and on pentium vs. on alpha in software implementation of hyperelliptic curve cryptosystems. in J Song (ed.), Information Security and Cryptology - ICISC 1999 - 2nd International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1787, Springer Verlag, pp. 82-101, 2nd International Conference on Information Security and Cryptology, ICISC 1999, Seoul, Korea, Republic of, 12/9/99. https://doi.org/10.1007/10719994_8
Sakai Y, Sakurai K. Over Fp vs. Over F2n and on pentium vs. on alpha in software implementation of hyperelliptic curve cryptosystems. In Song J, editor, Information Security and Cryptology - ICISC 1999 - 2nd International Conference, Proceedings. Springer Verlag. 2000. p. 82-101. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/10719994_8
Sakai, Yasuyuki ; Sakurai, Kouichi. / Over Fp vs. Over F2n and on pentium vs. on alpha in software implementation of hyperelliptic curve cryptosystems. Information Security and Cryptology - ICISC 1999 - 2nd International Conference, Proceedings. editor / JooSeok Song. Springer Verlag, 2000. pp. 82-101 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{b49aff5d994546999cc65057143ccf6c,
title = "Over Fp vs. Over F2n and on pentium vs. on alpha in software implementation of hyperelliptic curve cryptosystems",
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 effiectiveness 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",
doi = "10.1007/10719994_8",
language = "English",
isbn = "3540673806",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "82--101",
editor = "JooSeok Song",
booktitle = "Information Security and Cryptology - ICISC 1999 - 2nd International Conference, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Over Fp vs. Over F2n and on pentium vs. on alpha in software implementation of hyperelliptic curve cryptosystems

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 effiectiveness 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 effiectiveness 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=84958751100&partnerID=8YFLogxK

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

U2 - 10.1007/10719994_8

DO - 10.1007/10719994_8

M3 - Conference contribution

AN - SCOPUS:84958751100

SN - 3540673806

SN - 9783540673804

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 82

EP - 101

BT - Information Security and Cryptology - ICISC 1999 - 2nd International Conference, Proceedings

A2 - Song, JooSeok

PB - Springer Verlag

ER -