Lazy Random Walk Efficient for Pollard's Rho Method Attacking on G3 over Barreto-Naehrig Curve (Corrected) [in Japanese]
Access this Article
Search this Article
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 toutilize Gauss period Normal Basis (GNB) for Pollard's rho method, and then considers to accelerate thesolving by an adoption of lazy random walk, namely tag tracing technique proposed by Cheon et al.
- Memoirs of the Faculty of Engineering, Okayama University
Memoirs of the Faculty of Engineering, Okayama University 47, 25-32, 2013-01
Faculty of Engineering, Okayama University