On the Practical Performance of Hyperelliptic Curve Cryptosystems in Software Implementation(Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• We consider the performance of hyperelliptic curve cryptosystems over the fields F_p vs. F_2n. We analyze the complexity of the group law of the jacobians J_C(F_p) and J_C(F_2n) 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 J_C(F_2n) is faster than J_C(F_p) on an Alpha, whereas J_C(F_p) is faster than J_C(F_2n) 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.

• 社団法人電子情報通信学会の論文
• 2000-04-25

著者

• Sakurai K

  Kyushu Univ. Fukuoka‐shi Jpn

• SAKAI Yasuyuki

  The author is with Information Technology R&D Center, Mitsubishi Electric Corporation

• SAKURAI Kouichi

  The author is with the Faculty of Kyusyu University

• Sakai Y

  Mitsubishi Electric Corp. Kamakura‐shi Jpn

• Sakai Yasuyuki

  The Author Is With Information Technology R&d Center Mitsubishi Electric Corporation

• Sakurai Kouichi

  The Author Is With The Faculty Of Engineering Kyushu University

関連論文

• On the Practical Performance of Hyperelliptic Curve Cryptosystems in Software Implementation(Special Section on Discrete Mathematics and Its Applications)
• On Non-Pseudorandomness from Block Ciphers with Provable Immunity Against Linear Cryptanalysis (Special Section on Cryptography and Information Security)
• On Distributed Cryptographic Protocols for Threshold RSA Signing and Decrypting with No Dealer (Special Section on Discrete Mathematics and Its Applications)
• Efficient Scalar Multiplications on Elliptic Curves with Direct Computations of Several Doublings : Special Section on Cryptography and Information Security
• Speeding Up Elliptic Scalar Multiplication Using Multidoubling(Special Section on Discrete Mathematics and Its Applications)
• A Theory of Demonstrating Program Result-Correctness with Cryptographic Applications (Special lssue on Selected Papers from LA Synposium)

スポンサーリンク