up previous contents
Next: About this document ... Up: PROPOSED METHOD OF INVESTIGATION Previous: Proofs   Contents


[C] Crandall, Richard and Carl Pomerance. Prime Numbers: a Computational Perspective. New York: Springer. 2001

[E] Ellis, J. H. "The history of non-secret encryption". Cryptologia. Number 23, July 1999, p 267-273.

[Ga] Gauss, Carl Friedrich. Disquisitiones Arithmeticae. Trans. by Arthur A. Clarke. New Haven, Yale University Press, 1966.

[Go] Goldstein, Larry Joel. Abstract Algebra: A First Course. New Jersey: Prentice-Hall, Inc. 1973. p 32-36.

[L] Lenstra, H. W. Jr. "A New Method for Factoring Integers". Lecture Notes, 2001, University of California, Berkeley. p 5.

[P] Poorten, Alfred J. "A Note on NUCOMP". Mathematics of Computation. Volume 72, Number 244, April 2003, p 1935-1946.

[Rie] Riesel, Hans. Prime Numbers and Computer Methods for Factorization. Boston : Birkhäuser, 1985. p 191-195, 300-317.

[Riv] Rivest, R., A. Shamir and L. Adleman. "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems". Communications of the ACM, 21 (2), p 120-126, February 1978

[S] Shanks, Daniel. "On Gauss and Composition II," in Number theory and applications, Kluwer, 1989

[T] Trappe, Wade and Lawrence C. Washington. Introduction to Cryptography with Coding Theory. New Jersey: Prentice-Hall, Inc. 2002. p 137-142.

[W] Williams, H. C. "Daniel Shanks (1917-1996)". Mathematics of Computation. Volume 66, Number 219, July 1997, p 929-934.

David Joyner, wdj@usna.edu 2004-02-23