It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm and what is its time compexity. The technical hitch is in fixing the right sign of the square root and this is the heart of the discrete logarithm problem over finite fields of characteristic not equal to 2. In this paper a couple of probabilistic algorithms to compute the discrete logarithm over finite fields and their time complexity are given by bypassing this difficulty. One of the algorithms was inspired by the famous 3x + 1 problem.
@article{bwmeta1.element.bwnjournal-article-doi-10_4064-cm116-1-1,
author = {H. Gopalkrishna Gadiyar and K. M. Sangeeta Maini and R. Padma and Mario Romsy},
title = {What is the inverse of repeated square and multiply algorithm?},
journal = {Colloquium Mathematicae},
volume = {116},
year = {2009},
pages = {1-14},
zbl = {1221.11241},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-cm116-1-1}
}
H. Gopalkrishna Gadiyar; K. M. Sangeeta Maini; R. Padma; Mario Romsy. What is the inverse of repeated square and multiply algorithm?. Colloquium Mathematicae, Tome 116 (2009) pp. 1-14. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-cm116-1-1/