A Short Note on Discrete Log Problem in Fp
Abstract
Let p be a odd prime such that 2 is a primitive element of finite field Fp*. In this short note we propose a new algorithm for the computation of discrete logarithm in Fp*. This algorithm is based on elementary properties of finite fields and is purely theoretical in nature.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.