Author:
Coppersmith Don,Odlzyko Andrew M.,Schroeppel Richard
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference15 articles.
1. L. M. Adleman, “A subexponential algorithm for the discrete logarithm problem with applications to cryptography,”Proc. 20th IEEE Found. Comp. Sci. Symp. (1979), 55–60.
2. E. R. Canfield, P. Erdös and C. Pomerance, “On a problem of Oppenheim concerning ‘Factorisatio Numerorum’,”J. Number Theory, vol. 17, 1983, pp. 1–28.
3. D. Coppersmith, “Fast evaluation of logarithms in fields of characteristic two,”IEEE Trans. Inform. Theory IT-30 (1984), 587–594.
4. D. Coppersmith and S. Winograd, “On the asymptotic complexity of matrix multiplication,”SIAM J. Comput., Vol. 11, No. 3, August 1982, pp. 472–492.
5. T. ElGamal, “A subexponential-time algorithm for computing discrete logarithms overGF(p 2),”IEEE Trans. Inform. Theory, to appear.
Cited by
166 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献