Computer Security and Cryptography

REFERENCES

M. AGRAWAL, N. KAYAL, AND N. SAXENA, “PRIMES in P”, Annals of Mathematics, 160: 2, 781–793 (2004).

E. BERLEKAMP, “Factoring Polynomials over Large Finite Fields”, Mathematics of Computation, 24, 713–735 (1970).

J. D. DIXON, “Asymptotically Fast Factorization of Integers”, Mathematics of Computation, 36, 255–260 (1981).

R. FLOYD, “Non-Deterministic Algorithms”, Journal of the Association for Computing Machinery, 14, 636–644 (1967).

M. GARDNER, “A New Kind of Cipher That Would Take Millions of Years to Break”, Scientific American, 237, 120–124 (1977).

N. KOBLITZ, A Course in Number Theory and Cryptography, Springer-Verlag, New York, NY, 1987.

P. L'ECUYER, “Efficient and Portable Combined Random Number Generators”, Communications of the ACM, 31, 742–769 (1988).

G. L. MILLER, “Riemann's Hypothesis and Tests for Primality”, Journal of Computer and System Sciences, 13, 300–317 (1976).

J. M. POLLARD, “Propositions on Factorization and Primality Testing”, Proceedings of the Cambridge Philosophical Society, 76, 243–264 (1974).

J. M. POLLARD, “Monte Carlo Methods for Factorization”, Nordisk Tidskroft for Informationsbehandlung (BIT), 15, 331–334 (1975).

C. POMERANCE, “Cryptology and Computational Number Theory”, Proceedings of Symposia in Applied Mathematics, Vol. 142, Carl Pomerance (Ed.) American Mathematical Society, Boston, Massachusetts, 1980.

M. RABIN, “Probabilistic Algorithms”, in J. F. Traub, ed., Algorithms and Complexity, Academic Press, San Diego, California, 1976, ...