Prime Numbers

570 REFERENCES
[Schönhage and Strassen 1971] A. Schönhage and V. Strassen. Schnelle
Multiplikation grosser Zahlen. Computing (Arch. Elektron. Rechnen),
7:281–292, 1971.
[Schoof 1982] R. Schoof. Quadratic fields and factorization. In H. Lenstra, Jr. and
R. Tijdeman, editors, Computational methods in number theory, Part I,
volume 154 of Math. Centre Tracts, pages 235–286. Math. Centrum, 1982.
[Schoof 1985] R. Schoof. Elliptic curves over finite fields and the computation of
square roots mod p. Math. Comp., 44:483–494, 1985.
[Schoof 1995] R. Schoof. Counting points on elliptic curves over finite fields. J.
Théor. Nombres Bordeaux, 7:219–254, 1995. Les Dix-huitèmes Journées
Arithmétiques (Bordeaux, 1993).
[Schoof 2004] R. Schoof. Four primality proving algorithms. 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.
[Schroeder 1999] M. Schroeder. Number Theory in Science and Communication,
volume 7 of Springer Series in Information Sciences. Springer–Verlag,
1999. Corrected printing of the third (1997) edition.
[Scott 1999] M. Scott, 1999. Private communication.
[Selfridge and Hurwitz 1964] J. Selfridge and A. Hurwitz. Fermat numbers and
Mersenne numbers. Math. Comp., 18:146–148, 1964.
[Semaev 1998] I. Semaev. Evaluation of discrete logarithms in a group of p-torsion
points of an elliptic curve in characteristic p. Math. Comp., 67:353–356,
1998.
[Seroussi et al. 1999] G. Seroussi, N. Smart, and I. Blake. Elliptic Curves in
Cryptography, volume 265 of London Math. Soc. Lecture Note Series.
Cambridge University Press, 1999.
[Shamir 1999] A. Shamir. Factoring large numbers with the TWINKLE device
(extended abstract). In Ç. Koç and C. Paar, editors, Cryptographic
Hardware and Embedded Systems, First International Workshop, CHES
’99, Worcester, MA, volume 1717 of Lecture Notes in Computer Science,
pages 2–12. Springer–Verlag, 1999.
[Shanks 1971] D. Shanks. Class number, a theory of factorization, and genera. In
1969 Number Theory Institute, Stony Brook, N.Y., volume 20 of Proc.
Sympos. Pure Math., pages 415–440. Amer. Math. Soc., 1971.
[Shanks and Schmid 1966] D. Shanks and L. Schmid. Variations on a theorem of
Landau. Part I. Math. Comp., 20:551–569, 1966.
[Shlesinger 1986] M. Shlesinger. On the Riemann hypothesis: a fractal random
walk approach. Physica, 138A:310–319, 1986.
[Shor 1994] P. Shor. Algorithms for quantum computation: discrete logarithms
and factoring. In Proc. 35th Annual Symp. Found. Comp. Sci., pages
124–134, 1994.