Abstract
Pollard's Rho method is well-known as a method for solving Elliptic Curve Discrete Logarithm Problem (ECDLP). It is based on an efficient random walk of rational points on elliptic curve. This research accelerates the random walk with associative rational points. Since associative rational points are generated with a small additional cost and thus the random walk becomes more efficient. In order to solve an ECDLP over Barreto-Naehrig curve, for an example, this paper applies associative rational points and then evaluates the efficiency by some experiments.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
