このエントリーをはてなブックマークに追加
ID 44500
FullText URL
Author
Nekado, Kenta
Takai, Yusuke
Morikawa, Yoshitaka
Abstract
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.
Published Date
2011-01
Publication Title
Memoirs of the Faculty of Engineering, Okayama University
Publication Title Alternative
岡山大学工学部紀要
Volume
volume45
Publisher
Faculty of Engineering, Okayama University
Start Page
54
End Page
59
ISSN
1349-6115
NCID
AA12014085
Content Type
Departmental Bulletin Paper
language
英語
Copyright Holders
Copyright © by the authors
File Version
publisher
Refereed
False
Eprints Journal Name
mfe