mfe_047_025_032.pdf 3.02 MB
Nekado, Kenta Graduate School of Natural Science and Technology, Okayama University
Takai, Yusuke 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.
Memoirs of the Faculty of Engineering, Okayama University
Faculty of Engineering, Okayama University
Copyright © by the authors
|Eprints Journal Name||