Publisher
Springer Berlin Heidelberg
Reference72 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. L. M. Adleman, C. Pomerance and R. S. Rumely, On distinguishing prime numbers from composite numbers, Annals Math. 117 (1983), 173–206.
3. B. Arazi, Sequences constructed by operations modulo 2n−1 or modulo 2n and their application in evaluating the complexity of a log operation over GF(2n), preprint.
4. C. P. Arnold, M. I. Parr, and M. B. Dewe, An efficient parallel algorithm for the solution of large sparse linear matrix equations, IEEE Trans. on Computers, C-32 (1983), 265–272.
5. E. Bach, Discrete logarithms and factoring, to be published.
Cited by
129 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献