RUS
ENG
Full version
JOURNALS
// Matematicheskie Zametki
// Archive
Mat. Zametki,
1994
Volume 55,
Issue 2,
Pages
91–101
(Mi mzm2145)
This article is cited in
143
papers
Complexity of a determinate algorithm for the discrete logarithm
V. I. Nechaev
Steklov Mathematical Institute, Russian Academy of Sciences
UDC:
511
Received:
15.11.1993
Fulltext:
PDF file (2319 kB)
References
Cited by
English version:
Mathematical Notes, 1994,
55
:2,
165–172
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2026