A Short Note on Discrete Log Problem in F_p

2009/08/26 by Habeeb Syed, Syed, Habeeb
Computer Science · #11Y16 #12E20 #94A60 #Coding theory and cryptography #Cryptography and Data Security #Cryptography and Residue Arithmetic #FOS: Mathematics #Number Theory (math.NT)

paper · pdf · doi:10.48550/arxiv.0908.3820

openalex publication_date 2009/08/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• New directions in cryptography

Related

• Finding discrete logarithm in F_p^*
• Improvements to the number field sieve for non-prime finite fields
• A provably quasi-polynomial algorithm for the discrete logarithm problem in finite fields of small characteristic
• Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms
• A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic