Cryptology ePrint Archive: Report 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.

Category / Keywords: foundations / Finite Fields, Discrete Log

Date: received 15 Jul 2009

Contact author: habeeb at crlindia com

Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20090803:195416 (All versions of this report)

Discussion forum: Show discussion | Start new discussion