Ecient Squaring Algorithm for Xate Pairing with Freeman Curve

• Nekado Kenta

• Kato Hidehiro

• Nogami Yasuyuki

• Morikawa Yoshitaka

抄録

Recently, pairing–based cryptographies have attracted much attention. For fast pairing calculation, not only pairing algorithms but also arithmetic operations in extension field should be efficient. Especially for final exponentiation included in pairing calculation, squaring is more important than multiplication. This paper proposes an efficient squaring algorithm in extension field for Freeman curve.

収録刊行物

• Memoirs of the Faculty of Engineering, Okayama University

  Memoirs of the Faculty of Engineering, Okayama University 44 69-72, 2010-01

  Faculty of Engineering, Okayama University

詳細情報

• CRID: 1390853649525367296
• NII論文ID: 120002309070
• NII書誌ID: AA12014085
• ISSN: 13496115
• DOI: 10.18926/19961
• Web Site: https://ousar.lib.okayama-u.ac.jp/19961
• 本文言語コード: en
• データソース種別:
  • JaLC
  • IRDB
  • CiNii Articles