%0 Journal Article %A Shunsuke Miyoshi and Yasuyuki Nogami and Takuya Kusaka and Nariyoshi Yamai %D 2015 %J International Journal of Computer and Information Engineering %B World Academy of Science, Engineering and Technology %I Open Science Index 104, 2015 %T Solving 94-bit ECDLP with 70 Computers in Parallel %U https://publications.waset.org/pdf/10002414 %V 104 %X Elliptic curve discrete logarithm problem(ECDLP) is one of problems on which the security of pairing-based cryptography is based. This paper considers Pollard’s rho method to evaluate the security of ECDLP on Barreto-Naehrig(BN) curve that is an efficient pairing-friendly curve. Some techniques are proposed to make the rho method efficient. Especially, the group structure on BN curve, distinguished point method, and Montgomery trick are well-known techniques. This paper applies these techniques and shows its optimization. According to the experimental results for which a large-scale parallel system with MySQL is applied, 94-bit ECDLP was solved about 28 hours by parallelizing 71 computers. %P 1959 - 1962