このエントリーをはてなブックマークに追加
ID 44500
フルテキストURL
著者
Nekado, Kenta Graduate School of Natural Science and Technology, Okayama University
Takai, Yusuke Department of Communication Network Engineering, Faculty of Engineering, Okayama University
Nogami, Yasuyuki Graduate School of Natural Science and Technology, Okayama University
Morikawa, Yoshitaka Graduate School of Natural Science and Technology, Okayama University
抄録
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.
発行日
2011-01
出版物タイトル
Memoirs of the Faculty of Engineering, Okayama University
出版物タイトル(別表記)
岡山大学工学部紀要
45巻
出版者
Faculty of Engineering, Okayama University
開始ページ
54
終了ページ
59
ISSN
1349-6115
NCID
AA12014085
資料タイプ
紀要論文
言語
English
著作権者
Copyright © by the authors
論文のバージョン
publisher
査読
無し
Eprints Journal Name
mfe