%0 Journal Article
%A D. V. Matyukhin
%T On the asymptotic complexity of computing discrete logarithms in the field $\operatorname{\mathit{GF}}(p)$
%J Diskretnaya Matematika
%D 2003
%P 28-49
%V 15
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2003_15_1_a1/
%G ru
%F DM_2003_15_1_a1