Explicit form for the discrete logarithm over the field $\mathrm{GF}(p,k)$

Meletiou, Gerasimos C.. "Explicit form for the discrete logarithm over the field ${\rm GF}(p,k)$." Archivum Mathematicum 029.1-2 (1993): 25-28. <http://eudml.org/doc/247429>.

@article{Meletiou1993,
abstract = {For $a$ generator of the multiplicative group of the field $GF(p,k)$, the discrete logarithm of an element $b$ of the field to the base $a$, $b\ne 0$ is that integer $z:1\le z \le p^k -1$, $b=a^z$. The $p$-ary digits which represent $z$ can be described with extremely simple polynomial forms.},
author = {Meletiou, Gerasimos C.},
journal = {Archivum Mathematicum},
keywords = {discrete logarithm; finite fields; cryptography; discrete logarithm; finite fields; cryptography; primitive element},
language = {eng},
number = {1-2},
pages = {25-28},
publisher = {Department of Mathematics, Faculty of Science of Masaryk University, Brno},
title = {Explicit form for the discrete logarithm over the field $\{\rm GF\}(p,k)$},
url = {http://eudml.org/doc/247429},
volume = {029},
year = {1993},
}

TY - JOUR
AU - Meletiou, Gerasimos C.
TI - Explicit form for the discrete logarithm over the field ${\rm GF}(p,k)$
JO - Archivum Mathematicum
PY - 1993
PB - Department of Mathematics, Faculty of Science of Masaryk University, Brno
VL - 029
IS - 1-2
SP - 25
EP - 28
AB - For $a$ generator of the multiplicative group of the field $GF(p,k)$, the discrete logarithm of an element $b$ of the field to the base $a$, $b\ne 0$ is that integer $z:1\le z \le p^k -1$, $b=a^z$. The $p$-ary digits which represent $z$ can be described with extremely simple polynomial forms.
LA - eng
KW - discrete logarithm; finite fields; cryptography; discrete logarithm; finite fields; cryptography; primitive element
UR - http://eudml.org/doc/247429
ER -