A Short Note on Discrete Log Problem in $F_p$
Number Theory
2009-08-27 v1
Abstract
Let be a odd prime such that 2 is a primitive element of finite field . In this short note we propose a new algorithm for the computation of discrete logarithm in . This algorithm is based on elementary properties of finite fields and is purely theoretical in nature.
Keywords
Cite
@article{arxiv.0908.3820,
title = {A Short Note on Discrete Log Problem in $F_p$},
author = {Habeeb Syed},
journal= {arXiv preprint arXiv:0908.3820},
year = {2009}
}
Comments
5 pages