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.