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 language | English |
|---|---|
| Title of host publication | Information Security and Cryptology - ICISC 1999 - 2nd International Conference, Proceedings |
| Editors | JooSeok Song |
| Publisher | Springer Verlag |
| Pages | 82-101 |
| Number of pages | 20 |
| ISBN (Print) | 3540673806, 9783540673804 |
| DOIs | |
| Publication status | Published - Jan 1 2000 |
| Event | 2nd International Conference on Information Security and Cryptology, ICISC 1999 - Seoul, Korea, Republic of Duration: Dec 9 1999 → Dec 10 1999 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 1787 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 2nd International Conference on Information Security and Cryptology, ICISC 1999 |
|---|---|
| Country | Korea, Republic of |
| City | Seoul |
| Period | 12/9/99 → 12/10/99 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
Cite this
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 proceeding › Conference contribution
}
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 -