Prime Numbers

REFERENCES 571
[Shor 1999] P. Shor. Polynomial-time algorithms for prime factorization and
discrete logarithms on a quantum computer. SIAM Review, 41:303–332,
1999.
[Shoup 1992] V. Shoup. Searching for primitive roots in finite fields. Math. Comp.,
58:369–380, 1992.
[Shoup 1995] V. Shoup. A new polynomial factorization algorithm and its
implementation. J. Symbolic Comput., 20:363–397, 1995.
[Silva 2005] T. Silva. Goldbach conjecture verification.
http://www.ieeta.pt/ tos/goldbach.html, 2005.
[Silverman 1986] J. Silverman. The Arithmetic of Elliptic Curves, volume 106 of
Graduate Texts in Mathematics. Springer–Verlag, 1986.
[Silverman and Wagstaff 1993] R. Silverman and S. Wagstaff, Jr. A practical
analysis of the elliptic curve factoring algorithm. Math. Comp.,
61:445–462, 1993.
[Sloan and Wozniakowski 1998] I. Sloan and H. Wozniakowski. When are
quasi-Monte Carlo algorithms efficient for high dimensional integrals?
Complexity, 14:1–33, 1998.
[Smart 1998] N. Smart. The algorithmic resolution of Diophantine equations,
volume 41 of London Mathematical Society Student Texts. Cambridge
University Press, 1998.
[Smart 1999] N. Smart. The discrete logarithm problem on elliptic curves of trace
one. J. Cryptology, 12:193–196, 1999.
[Solinas 1998] J. Solinas. Standard specifications for public key cryptography.
Annex A: Number-theoretic background. IEEE P1363 Draft(s),
1998–2004. http://grouper.ieee.org/groups/1363/.
[Solinas 1999] J. Solinas. Generalized Mersenne numbers, 1999.
http://www.cacr.math.uwaterloo.ca/techreports/1999/corr99-39.ps.
[Sorenson 1994] J. Sorenson. Two fast GCD algorithms. J. Algorithms,
16:110–144, 1994.
[Srinivasan 1995] A. Srinivasan. Compuations of Class Numbers of Quadratic
Fields. PhD thesis, U. Georgia, 1995.
[Stehlé and Zimmermann 2004] D.Stehlé and P.Zimmermann. A Binary Recursive
gcd Algorithm. http://www.loria.fr/ stehle/downloads/antsgcd.pdf,
and http://www.loria.fr/˜stehle/BINARY.html.
[Stein 1967] J. Stein. Computational problems associated with Racah algebra. J.
Comp. Phys., 1:397–405, 1967.
[Strassen 1977] V. Strassen. Einige Resultate über Berechnungskomplexität. Jber.
Deutsch. Math.-Verein., 78:1–8, 1976/77.
[Stuart 1996] I. Stuart. The magic of seven: signifies creation, the sum of the
spiritual three and the material four. British Medical Journal, 313(7072),
December 21 1996.