|
This article is cited in 142 scientific papers (total in 144 papers)
Complexity of a determinate algorithm for the discrete logarithm
V. I. Nechaev Steklov Mathematical Institute, Russian Academy of Sciences
Received: 15.11.1993
Citation:
V. I. Nechaev, “Complexity of a determinate algorithm for the discrete logarithm”, Mat. Zametki, 55:2 (1994), 91–101; Math. Notes, 55:2 (1994), 165–172
Linking options:
https://www.mathnet.ru/eng/mzm2145 https://www.mathnet.ru/eng/mzm/v55/i2/p91
|
|