What is the Inverse of Repeated Square and Multiply Algorithm?

Details What is the Inverse of Repeated Square and Multiply Algorithm? What is the Inverse of Repeated Square and Multiply Algorithm?

2006-02-08

arxiv.org/abs/math/0602154v3

Colloq. Math. 116 (2009) 1-14

Mathematics

Number Theory

15 pages

Scientific paper

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 efficiently. 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 are given by bypassing this difficulty. One of the algorithms was inspired by the famous 3x+1 problem.

Affiliated with

Also associated with

No associations

Rating

What is the Inverse of Repeated Square and Multiply Algorithm? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with What is the Inverse of Repeated Square and Multiply Algorithm?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and What is the Inverse of Repeated Square and Multiply Algorithm? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-698492