このエントリーをはてなブックマークに追加
ID 49322
FullText URL
Author
Nekado, Kenta
Takai, Yusuke
Abstract
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.
Published Date
2013-01
Publication Title
Memoirs of the Faculty of Engineering, Okayama University
Publication Title Alternative
岡山大学工学部紀要
Volume
volume47
Publisher
Faculty of Engineering, Okayama University
Start Page
25
End Page
32
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