TY  - JOUR
AU  - D. V. Matyukhin
TI  - On the asymptotic complexity of computing discrete logarithms in the field $\operatorname{\mathit{GF}}(p)$
JO  - Diskretnaya Matematika
PY  - 2003
SP  - 28
EP  - 49
VL  - 15
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2003_15_1_a1/
LA  - ru
ID  - DM_2003_15_1_a1
ER  -