Prime Numbers

558 REFERENCES
[Goldwasser and Kilian 1986] S. Goldwasser and J. Kilian. Almost all primes can
be quickly certified. In Proc. 18th Annual ACM Symposium on the
Theory of Computing, pages 316–329, 1986.
[Goldwasser and Micali 1982] S. Goldwasser and S. Micali. Probabilistic
encryption and how to play mental poker keeping secret all mental
information. In Proc. 14th Annual ACM Symposium on the Theory of
Computing, pages 365–377, 1982.
[Golomb 1956] S. Golomb. Combinatorial proof of Fermat’s ‘little theorem’. Amer.
Math. Monthly, 63, 1956.
[Golomb 1982] S. Golomb. Shift Register Sequences, (revised version). Aegean
Park Press, 1982.
[Gong et al. 1999] G. Gong, T. Berson, and D. Stinson. Elliptic curve
pseudorandom sequence generators. In Proc. Sixth Annual Workshop on
Selected Areas in Cryptography, Kingston, Canada, August 1999.
[Gordon 1993] D. Gordon. Discrete logarithms in GF (p) via the number field
sieve. SIAM J. Discrete Math., 16:124–138, 1993.
[Gordon and Pomerance 1991] D. Gordon and C. Pomerance. The distribution of
Lucas and elliptic pseudoprimes. Math. Comp., 57:825–838, 1991.
Corrigendum ibid. 60:877, 1993.
[Gordon and Rodemich 1998] D. Gordon and G. Rodemich. Dense admissible sets.
In [Buhler 1998], pages 216–225.
[Gourdon and Sebah 2004] X. Gourdon and P. Sebah. Numbers, constants and
computation, 2004.
http://numbers.computation.free.fr/Constants/constants.html.
[Graham and Kolesnik 1991] S. Graham and G. Kolesnik. Van der Corput’s
method of exponential sums, volume 126 of Lecture Note Series.
Cambridge University Press, 1991.
[Grantham 1998] J. Grantham. A probable prime test with high confidence. J.
Number Theory, 72:32–47, 1998.
[Grantham 2001] J. Grantham. Frobenius pseudoprimes. Math. Comp.
70:873–891, 2001.
[Granville 2004a] A. Granville. It is easy to determine if a given number is prime.
Bull. Amer. Math. Soc., 42:3–38, 2005.
[Granville 2004b] A. Granville. Smooth numbers: computational number theory
and beyond. In J. Buhler and P. Stevenhagen, editors Cornerstones in
algorithmic number theory (tentative title), a Mathematical Sciences
Research Institute Publication. Cambridge University Press, to appear.
[Granville and Tucker 2002] A. Granville and T. Tucker. It’s as easy as abc.
Notices Amer. Math. Soc. 49:1224–1231, 2002.
[Green and Tao 2004] B. Green and T. Tao. The primes contain arbitrarily long
arithmetic progressions. http://arxiv.org/abs/math.NT/0404188.