Fast evaluation of logarithms in fields of characteristic two
- 1 July 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 30 (4), 587-594
- https://doi.org/10.1109/tit.1984.1056941
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Discrete logarithms in finite fields and their cryptographic significancePublished by Springer Nature ,2000
- Computing Logarithms in Finite Fields of Characteristic TwoSIAM Journal on Algebraic Discrete Methods, 1984
- Fast Computation of Discrete Logarithms in GF (q)Published by Springer Nature ,1983
- On the Asymptotic Complexity of Matrix MultiplicationSIAM Journal on Computing, 1982
- A new algorithm for factoring polynomials over finite fieldsMathematics of Computation, 1981
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978
- A Method of Factoring and the Factorization of F 7Mathematics of Computation, 1975
- A conversion algorithm for logarithms on GF(2n)Journal of Pure and Applied Algebra, 1974
- Factoring Polynomials Over Large Finite FieldsMathematics of Computation, 1970
- Gaussian elimination is not optimalNumerische Mathematik, 1969