Computing a Discrete Logarithm in O(n^3)
Data Structures and Algorithms
2009-12-29 v4
Abstract
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.
Cite
@article{arxiv.0912.2269,
title = {Computing a Discrete Logarithm in O(n^3)},
author = {Charles Sauerbier},
journal= {arXiv preprint arXiv:0912.2269},
year = {2009}
}
Comments
5 pages, 0 figures, example source code in c#; v2 expanded to include computation without projection into real number field; v3 edits to more explicitly make the association with periodic functions of a specific form; v4 edits correct y periodic aside and to clarify loop identification, note respective difference expression and modular exponentiation