Analysis of the fruitless cycle of Pollard's rho method based attack for solving ECDLP over Barreto-Naehrig curves

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 combination...

Full description

Saved in:
Bibliographic Details
Published in2019 34th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC) pp. 1 - 4
Main Authors Miura, Hiromasa, Ikuta, Ken, Joichi, Sho, Kusaka, Takuya, Nogami, Yasuyuki
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2019
Subjects
Barreto-Naehrig curve
Digital signatures
ECDLP
Elliptic curve cryptography
Elliptic curves
fruitless cycle
Indexes
Integrated circuits
Pollard's rho method
Zirconium
Online AccessGet full text

Cover

More Information
Summary: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.
DOI:10.1109/ITC-CSCC.2019.8793449