このエントリーをはてなブックマークに追加
ID 19961
Eprint ID
19961
FullText URL
Author
Nekado, Kenta
Kato, Hidehiro
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 proposes an efficient squaring algorithm in extension field for Freeman curve.
Published Date
2010-01
Publication Title
Memoirs of the Faculty of Engineering, Okayama University
Publication Title Alternative
岡山大学工学部紀要
Volume
volume44
Publisher
Faculty of Engineering, Okayama University
Publisher Alternative
岡山大学工学部
Start Page
69
End Page
72
ISSN
1349-6115
NCID
AA12014085
Content Type
Departmental Bulletin Paper
language
英語
File Version
publisher
Refereed
False
Eprints Journal Name
mfe