Displaying similar documents to “On Shank's algorithm for modular square roots.”

What is the inverse of repeated square and multiply algorithm?

H. Gopalkrishna Gadiyar, K. M. Sangeeta Maini, R. Padma, Mario Romsy (2009)

Colloquium Mathematicae

Similarity:

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...

A modified algorithm for the strict feasibility problem

D. Benterki, B. Merikhi (2010)

RAIRO - Operations Research

Similarity:

In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.