1. S. Goldwasser, J. Kilian, Almost all primes can be quickly certified, Proceedings of the 18th ACM Symp. Theory of Computing (1986), 316–329.
2. N. Koblitz, A Course in Number Theory and Cryptography, Springer-Verlag, 1987.
3. N. Koblitz, Elliptic curve cryptosystems, Math. of Computation, 48 (1987), 203–209.
4. A. K. Lenstra and H. W. Lenstra, Jr., Algorithms in number theory, in: Handbook of Theoretical Computer Science, Vol. A, Algorithms and Complexity, ed. by j. van Leeuwen, Amsterdam: Elsevier (1990), 673–715.
5. A. Menezes and S. A. Vanstone, Isomorphism classes of elliptic curves over finite fields of characteristic 2, Utilitas Mathematica, 38 (1990), 135–154.