Please use this identifier to cite or link to this item:
http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/3355| Title: | A Probabilistic Baby-step Giant-step Algorithm |
| Authors: | Kushwaha, Prabhat MAHALANOBIS, AYAN Dept. of Mathematics |
| Keywords: | Discrete Logarithm Problem Baby-step Giant-step Algorithm NIST Curves Over Prime Fields Parallelized Collision Search 2017 |
| Issue Date: | Jul-2017 |
| Publisher: | Science and Technology Publications |
| Citation: | Proceedings of the 14th International Joint Conference on e-Business and Telecommunications, 6: SECRYPT, 401-406. |
| 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. |
| URI: | http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/3355 https://www.scitepress.org/Link.aspx?doi=10.5220/0006396304010406 |
| ISBN: | 9789897582592 |
| ISSN: | - |
| Appears in Collections: | CONFERENCE PAPERS |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.