Summary
The 2018 International Symposium on Information Theory and Its Applications (ISITA2018)
2018
Session Number:We-PM-1-2
Session:
Number:We-PM-1-2.4
A Study on the Parameter Size of the Montgomery Trick for ECDLP
Ken Ikuta, Sho Joichi, Kazuya Kobayashi, Md. Al-Amin Khandaker, Takuya Kusaka, Yasuyuki Nogami,
pp.655-659
Publication Date:2018/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.55.We-PM-1-2.4
PDF download
Summary:
In this research, the choice of the parameter of the Montgomery trick in Pollard’s Rho method to solve the elliptic curve discrete logarithm problem for Barreto-Naehrig (BN) curves is shown. The average number of generated rational points per unit time is chosen as a measure of the effectiveness of the choice of the parameter of the Montgomery trick. The results are derived from a sufficient number of experiments with several BN curves.