A Short Note on Discrete Log Problem in $F_p$

TL;DR

This paper introduces a new theoretical algorithm for computing discrete logarithms in finite fields, specifically in $F_p$, leveraging elementary properties of finite fields.

Contribution

The paper proposes a novel, purely theoretical algorithm for discrete logarithm computation in $F_p$, based on elementary finite field properties.

Findings

Algorithm offers a new approach to discrete log problem

Based on elementary properties, potentially simpler than existing methods

Purely theoretical with no empirical validation

Abstract

Let $p$ be a odd prime such that 2 is a primitive element of finite field $F_p*$. In this short note we propose a new algorithm for the computation of discrete logarithm in $F_p*$. This algorithm is based on elementary properties of finite fields and is purely theoretical in nature.