TY - GEN
T1 - Analysis of the fruitless cycle of Pollard's rho method based attack for solving ECDLP over Barreto-Naehrig curves
AU - Miura, Hiromasa
AU - Ikuta, Ken
AU - Joichi, Sho
AU - Kusaka, Takuya
AU - Nogami, Yasuyuki
PY - 2019/6
Y1 - 2019/6
N2 - This paper focuses on the computational security of elliptic curve discrete logarithm (ECDLP), which can evaluate by an actual attack. The authors apply Pollard's rho method to a Barreto-Naehrig curve with minimum parameters for solving an ECDLP. An analysis of the structure for all combinations of a select of seed and starting points are given. Then, we propose the method for selecting a set of efficient seed points for a random walk for the rho method.
AB - This paper focuses on the computational security of elliptic curve discrete logarithm (ECDLP), which can evaluate by an actual attack. The authors apply Pollard's rho method to a Barreto-Naehrig curve with minimum parameters for solving an ECDLP. An analysis of the structure for all combinations of a select of seed and starting points are given. Then, we propose the method for selecting a set of efficient seed points for a random walk for the rho method.
KW - Barreto-Naehrig curve
KW - ECDLP
KW - Pollard's rho method
KW - fruitless cycle
UR - http://www.scopus.com/inward/record.url?scp=85071473290&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85071473290&partnerID=8YFLogxK
U2 - 10.1109/ITC-CSCC.2019.8793449
DO - 10.1109/ITC-CSCC.2019.8793449
M3 - Conference contribution
AN - SCOPUS:85071473290
T3 - 34th International Technical Conference on Circuits/Systems, Computers and Communications, ITC-CSCC 2019
BT - 34th International Technical Conference on Circuits/Systems, Computers and Communications, ITC-CSCC 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 34th International Technical Conference on Circuits/Systems, Computers and Communications, ITC-CSCC 2019
Y2 - 23 June 2019 through 26 June 2019
ER -