Welcome to the resource topic for 2017/055
Title:
A Probabilistic Baby-Step Giant-Step Algorithm
Authors: Prabhat Kushwaha, Ayan Mahalanobis
Abstract:In this paper, a new algorithm to solve the discrete logarithm problem is presented which is similar to the usual baby-step giant-step algorithm. Our algorithm exploits the order of the discrete logarithm in the multiplicative group of a finite field. Using randomization with parallelized collision search, our algorithm indicates some weakness in NIST curves over prime fields which are considered to be the most conservative and safest curves among all NIST curves.
ePrint: https://eprint.iacr.org/2017/055
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .