Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

What is the inverse of repeated square and multiply algorithm?

100%

Gopalkrishna Gadiyar H., Sangeeta Maini K., Padma R., Romsy M.

Colloquium Mathematicum

2009

tom 116

nr 1

1-14

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.

Ograniczanie wyników

1 Colloquium Mathematicum

1 Gopalkrishna Gadiyar H.

1 Padma R.

1 Romsy M.

1 Sangeeta Maini K.

1 2009

Wyniki wyszukiwania

What is the inverse of repeated square and multiply algorithm?