Efficient Algorithms for Tate Pairing

• KOBAYASHI Tetsutaro

  Institute of Industrial Science Interfaculty Initiative for Information Studies, University of Tokyo

• AOKI Kazumaro

  NTT Information Sharing Platform Laboratories, NTT Corporation

• IMAI Hideki

  Institute of Industrial Science Interfaculty Initiative for Information Studies, University of Tokyo

抄録

This paper presents new algorithms for the Tate pairing on a prime field. Recently, many pairing-based cryptographic schemes have been proposed. However, computing pairings incurs a high computational cost and represents the bottleneck to using pairings in actual protocols. This paper shows that the proposed algorithms reduce the cost of multiplication and inversion on an extension field, and reduce the number of calculations of the extended finite field. This paper also discusses the optimal algorithm to be used for each pairing parameter and shows that the total computational cost is reduced by 50% if k=6 and 57% if k=8.

収録刊行物

• IEICE transactions on fundamentals of electronics, communications and computer sciences

  IEICE transactions on fundamentals of electronics, communications and computer sciences 89 (1), 134-143, 2006-01-01

  一般社団法人電子情報通信学会

キーワード

• Weil pairing
• Tate pairing
• elliptic curve cryptosystem
• fast computation

詳細情報

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