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

この論文にアクセスする

この論文をさがす

著者

抄録

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

各種コード

  • NII論文ID(NAID)
    80021759252
  • NII書誌ID(NCID)
    AA12014085
  • 本文言語コード
    ENG
  • 資料種別
    departmental bulletin paper
  • ISSN
    1349-6115
  • データ提供元
    IR 
ページトップへ