The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Consideramos o desempenho de criptossistemas de curva hiperelíptica sobre os campos Fp vs F2n. Analisamos a complexidade da lei de grupo dos jacobianos JC(Fp) e JC(F2n) e compare seu desempenho levando em consideração a eficácia do tamanho da palavra (32 bits ou 64 bits) da CPU aplicada (Alpha e Pentium) na aritmética do campo de definição. Nossos resultados experimentais mostram que JC(F2n) é mais rápido do que JC(Fp) em um Alfa, enquanto JC(Fp) é mais rápido do que JC(F2n) em um Pentium. Além disso, investigamos o algoritmo do jacobiano e a aritmética do campo de definição para esclarecer nossos resultados do ponto de vista prático, com análise teórica.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Yasuyuki SAKAI, Kouichi SAKURAI, "On the Practical Performance of Hyperelliptic Curve Cryptosystems in Software Implementation" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 4, pp. 692-703, April 2000, doi: .
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_4_692/_p
Copiar
@ARTICLE{e83-a_4_692,
author={Yasuyuki SAKAI, Kouichi SAKURAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On the Practical Performance of Hyperelliptic Curve Cryptosystems in Software Implementation},
year={2000},
volume={E83-A},
number={4},
pages={692-703},
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.},
keywords={},
doi={},
ISSN={},
month={April},}
Copiar
TY - JOUR
TI - On the Practical Performance of Hyperelliptic Curve Cryptosystems in Software Implementation
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 692
EP - 703
AU - Yasuyuki SAKAI
AU - Kouichi SAKURAI
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2000
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.
ER -