A Short Note on Discrete Log Problem in F_p

MaRDI QIDQ6215178zbMATH OpenFDO

Authors Habeeb Syed

Publication date 26 August 2009

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Finite fields (field-theoretic aspects) (12E20) Cryptography (94A60)

Abstract: Let $p$ be a odd prime such that 2 is a primitive element of finite field $F_p\ast$. In this short note we propose a new algorithm for the computation of discrete logarithm in $F_p\ast$. This algorithm is based on elementary properties of finite fields and is purely theoretical in nature.

This page was built for publication: A Short Note on Discrete Log Problem in $F_p$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6215178)