Publisher
Springer Berlin Heidelberg
Reference107 articles.
1. L. M. Adleman: A subexponential algorithm for the discrete logarithm problem with applications to cryptography. Proc. 20th IEEE Symp. Foundations of Computer Science 1979, pp.55–60
2. L. M. Adleman and J. DeMarrais: A subexponential algorithm for discrete logarithms over all finite fields. Math. Computation 61 (1993) 1–15
3. L. M. Adleman, C. Pomerance, R. S. Rumely: On distinguishing prime numbers from composite numbers. Annals Math. 117 (1983), 173–206
4. G. B. Agnew, R. C. Mullin, I. M. Onyszchuk, S. A. Vanstone: An implementation for a fast public–key cryptosystem. J. Cryptology 3 (1991), 63–79
5. G. B. Agnew, R. C. Mullin, S. A. Vanstone: An implementation of elliptic curve cryptosystems over F2
155. IEEE Journal on Selected Areas in Communications 11 (1993) 804–813