A Probabilistic Baby-Step Giant-Step Algorithm
Cryptography and Security
2020-11-17 v1
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.
Cite
@article{arxiv.1701.07172,
title = {A Probabilistic Baby-Step Giant-Step Algorithm},
author = {Prabhat Kushwaha and Ayan Mahalanobis},
journal= {arXiv preprint arXiv:1701.07172},
year = {2020}
}