Squaring Algorithm Efficient for Cubic Extension Field Derived with Pseudo Gauss Period Normal Basis

• Nekado Kenta

• Takai Yusuke

• 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 considers squaring algorithms efficient for cubic extension field which is often used for pairing implementaions.

収録刊行物

• Memoirs of the Faculty of Engineering, Okayama University

  Memoirs of the Faculty of Engineering, Okayama University 45 54-59, 2011-01

  Faculty of Engineering, Okayama University

詳細情報

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