A Probabilistic Baby-step Giant-step Algorithm

Prabhat Kushwaha, Ayan Mahalanobis

2017

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.

Paper Citation

in Harvard Style

Kushwaha P. and Mahalanobis A. (2017). A Probabilistic Baby-step Giant-step Algorithm . In Proceedings of the 14th International Joint Conference on e-Business and Telecommunications - Volume 6: SECRYPT, (ICETE 2017) ISBN 978-989-758-259-2, pages 401-406. DOI: 10.5220/0006396304010406

in Bibtex Style

@conference{secrypt17,
author={Prabhat Kushwaha and Ayan Mahalanobis},
title={A Probabilistic Baby-step Giant-step Algorithm},
booktitle={Proceedings of the 14th International Joint Conference on e-Business and Telecommunications - Volume 6: SECRYPT, (ICETE 2017)},
year={2017},
pages={401-406},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006396304010406},
isbn={978-989-758-259-2},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 14th International Joint Conference on e-Business and Telecommunications - Volume 6: SECRYPT, (ICETE 2017)
TI - A Probabilistic Baby-step Giant-step Algorithm
SN - 978-989-758-259-2
AU - Kushwaha P.
AU - Mahalanobis A.
PY - 2017
SP - 401
EP - 406
DO - 10.5220/0006396304010406