Complexity of a determinate algorithm for the discrete logarithm
- 1 February 1994
- journal article
- Published by Springer Nature in Mathematical Notes
- Vol. 55 (2), 165-172
- https://doi.org/10.1007/bf02113297
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Fast evaluation of logarithms in fields of characteristic twoIEEE Transactions on Information Theory, 1984
- Computing Logarithms in Finite Fields of Characteristic TwoSIAM Journal on Algebraic Discrete Methods, 1984
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978