Lazy Random Walk Efficient for Pollard’s Rho Method Attacking on G3 over Barreto-Naehrig Curve (Corrected)
Search this article
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.
Journal
-
- 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
- Tweet
Details 詳細情報について
-
- CRID
- 1390290699799546624
-
- NII Article ID
- 120005232374
-
- NII Book ID
- AA12014085
-
- ISSN
- 13496115
-
- DOI
- 10.18926/49322
-
- NDL BIB ID
- 025619210
-
- Text Lang
- en
-
- Data Source
-
- JaLC
- IRDB
- NDL
- CiNii Articles