このエントリーをはてなブックマークに追加
ID 19961
JaLCDOI
Sort Key
9
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.
Publication Title
Memoirs of the Faculty of Engineering, Okayama University
Published Date
2010-01
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
OAI-PMH Set
岡山大学
language
英語
File Version
publisher
NAID
Eprints Journal Name
mfe