このエントリーをはてなブックマークに追加
ID 49322
フルテキストURL
著者
Nekado, Kenta Graduate School of Natural Science and Technology, Okayama University
Takai, Yusuke Graduate School of Natural Science and Technology, Okayama University
Nogami, Yasuyuki Graduate School of Natural Science and Technology, Okayama University
抄録
Pairing–based cryptosystems are well implemented with Ate–type pairing over Barreto–Naehrig (BN) curve. Then, for instance, their securities depend on the difficulty of Discrete Logarithm Problem (DLP) on the so–denoted G3 over BN curve. This paper, in order to faster solve the DLP, first proposes to utilize Gauss period Normal Basis (GNB) for Pollard’s rho method, and then considers to accelerate the solving by an adoption of lazy random walk, namely tag tracing technique proposed by Cheon et al.
発行日
2013-01
出版物タイトル
Memoirs of the Faculty of Engineering, Okayama University
出版物タイトル(別表記)
岡山大学工学部紀要
47巻
出版者
Faculty of Engineering, Okayama University
開始ページ
25
終了ページ
32
ISSN
1349-6115
NCID
AA12014085
資料タイプ
紀要論文
言語
English
著作権者
Copyright © by the authors
論文のバージョン
publisher
査読
無し
Eprints Journal Name
mfe