Discrete logarithms inGF(p)
- 1 November 1986
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 1 (1-4), 1-15
- https://doi.org/10.1007/bf01840433
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Solving sparse linear equations over finite fieldsIEEE Transactions on Information Theory, 1986
- Fast evaluation of logarithms in fields of characteristic twoIEEE Transactions on Information Theory, 1984
- On a problem of Oppenheim concerning “factorisatio numerorum”Journal of Number Theory, 1983
- On the Asymptotic Complexity of Matrix MultiplicationSIAM Journal on Computing, 1982
- A subexponential algorithm for the discrete logarithm problem with applications to cryptographyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- A monte carlo method for factorizationBIT Numerical Mathematics, 1975
- Gaussian elimination is not optimalNumerische Mathematik, 1969
- Methods of conjugate gradients for solving linear systemsJournal of Research of the National Bureau of Standards, 1952
- An iteration method for the solution of the eigenvalue problem of linear differential and integral operatorsJournal of Research of the National Bureau of Standards, 1950