J. Brillhart, D. H. Lehmer, J. L. Selfridge, B. Tuckerman, and S. S. Wagstaff, Jr.,Factorization of b n±1, b=2, 3, 5, 6, 7, 10, 11, 12 up to High Powers, American Mathematical Society, Providence, RI, 1983. Google Scholar
D. Cantor, Computing in the jacobian of a hyperelliptic curve,Math. Comp.,48 (1987), 95–101. Google Scholar
W. Diffie and M. Hellman, New directions in cryptography,IEEE Trans. Inform. Theory,22 (1976), 644–654. Google Scholar
T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms,IEEE Trans. Inform. Theory,31 (1985), 469–472. Google Scholar
W. Fulton,Algebraic Curves, Benjamin, New York, 1969. Google Scholar
N. Koblitz,Introduction to Elliptic Curves and Modular Forms, Springer-Verlag, New York, 1984. Google Scholar
N. Koblitz,A Course in Number Theory and Cryptography, Springer-Verlag, New York, 1987. Google Scholar
N. Koblitz, Elliptic curve cryptosystems,Math. Comp.48 (1987), 203–209. Google Scholar
N. Koblitz, Primality of the number of points on an elliptic curve over a finite field,Pacific J. Math.,131 (1988), 157–165. Google Scholar
S. Lang,Introduction to Algebraic Geometry, Interscience, New York, 1958. Google Scholar
R. Lidl and H. Niederreiter,Finite Fields, Addison-Wesley, Reading, MA, 1983. Google Scholar
V. Miller, Use of elliptic curves in cryptography,Advances in Cryptology-Crypto '85, Springer-Verlag, New York, 1986, pp. 417–426. Google Scholar
A. M. Odlyzko, Discrete logarithms and their cryptographic significance,Advances in Cryptography: Proceedings of Eurocrypt 84, Springer-Verlag, New York, 1985, pp. 224–314. Google Scholar
E. Seah and H. C. Williams, Some primes of the form (a n − 1)/(a − 1),Math. Comp.,33 (1979), 1337–1342. Google Scholar
D. Shanks,Solved and Unsolved Problems in Number Theory, 3rd edn., Chelsea, New York, 1985. Google Scholar
W. C. Waterhouse, Abelian varieties over finite fields,Ann. Sci. École Norm. Sup. (4),2 (1969), 521–560. Google Scholar