Improvements of Addition Algorithm on Genus 3 Hyperelliptic Curves and Their Implementation

  • GONDA Masaki
    Dept. of Information and System Engineering, Chuo University
  • MATSUO Kazuto
    Graduate School of Information Security, Institute of Information Security
  • AOKI Kazumaro
    NTT Information Sharing Platform Laboratories, NTT Corporation
  • CHAO Jinhui
    Dept. of Information and System Engineering, Chuo University
  • TSUJII Shigeo
    Graduate School of Information Security, Institute of Information Security

この論文をさがす

説明

Genus 3 hyperelliptic curve cryptosystems are capable of fast-encryption on a 64-bit CPU, because a 56-bit field is enough for their definition fields. Recently, Kuroki et al. proposed an extension of the Harley algorithm, which had been known as the fastest addition algorithm of divisor classes on genus 2 hyperelliptic curves, on genus 3 hyperelliptic curves and Pelzl et al. improved the algorithm. This paper shows an improvement of the Harley algorithm on genus 3 hyperelliptic curves using Toom's multiplication. The proposed algorithm takes only I+70M for an addition and I+71M for a doubling instead of I+76M and I+74M respectively, which are the best possible of the previous works, where I and M denote the required time for an inversion and a multiplication over the definition field respectively. This paper also shows 2 variations of the proposed algorithm in order to adapt the algorithm to various platforms. Moreover this paper discusses finite field arithmetic suitable for genus 3 hyperelliptic curve cryptosystems and shows implementation results of the proposed algorithms on a 64-bit CPU. The implementation results show a 160-bit scalar multiplication can be done within 172μS on a 64-bit CPU Alpha EV68 1.25 GHz.

収録刊行物

被引用文献 (3)*注記

もっと見る

参考文献 (37)*注記

もっと見る

詳細情報 詳細情報について

  • CRID
    1570009752557477632
  • NII論文ID
    110003213214
  • NII書誌ID
    AA10826239
  • ISSN
    09168508
  • 本文言語コード
    en
  • データソース種別
    • CiNii Articles

問題の指摘

ページトップへ