Computing a Discrete Logarithm in O(n^3)

Details Computing a Discrete Logarithm in O(n^3) Computing a Discrete Logarithm in O(n^3)

2009-12-11

arxiv.org/abs/0912.2269v4

Computer Science

Data Structures and Algorithms

5 pages, 0 figures, example source code in c#; v2 expanded to include computation without projection into real number field; v

Scientific paper

This paper presents a means with time complexity of at worst O(n^3) to
compute the discrete logarithm on cyclic finite groups of integers modulo p.
The algorithm makes use of reduction of the problem to that of finding the
concurrent zeros of two periodic functions in the real numbers. The problem is
treated as an analog to a form of analog rotor-code computed cipher.

Affiliated with

Also associated with

No associations

Rating

Computing a Discrete Logarithm in O(n^3) 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 Computing a Discrete Logarithm in O(n^3), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing a Discrete Logarithm in O(n^3) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-468569