Paper 2009/381

A short Note on Discrete Log Problem in $\mathbbF_p$

Habeeb Syed

Abstract

Consider finite prime fields $\mathbb{F}_p$ for which $2$ is primitive element. In this short we propose a new algorithm to compute discrete log in such finite fields. Our algorithm is based on elementary properties of finite fields and is purely theoretical in nature. Further, complexity of the algorithm is exponential in nature and as such it is not being suggested for any computational purposes.

Metadata
Available format(s)
-- withdrawn --
Category
Foundations
Publication info
Preprint. MINOR revision.
Keywords
Finite FieldsDiscrete Log
Contact author(s)
habeeb @ crlindia com
History
2021-02-07: withdrawn
2009-08-03: received
See all versions
Short URL
https://ia.cr/2009/381
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.