Abstract

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 F ∗ p. This algorithm is based on elementary properties of finite fields and is purely theoretical in nature.

Citations

2292	New directions in cryptography - Diffie, Hellmen - 1976
253	A public-key cryptosystem and a signature scheme based on discrete logarithms - Gamal - 1985
243	Reducing elliptic curve logarithms to logarithms in a finite field - Menezes, Okamoto, et al. - 1993
73	Discrete logarithms in finite fields and their cryptographic significance - ODLYZKO - 1985
51	Discrete logarithms in GF(p) using the number field sieve - Gordon - 1993
29	A Concise Introduction to the Theory of Numbers - Baker - 1984
23	On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping - Coppersmith, Shparlinski
12	Using number fields to compute logarithms in finite fields - Schirokauer
6	A polynomial representation for logarithms in GF(q - Mullen, White - 1986