Prime Numbers

REFERENCES 563
volume 46 of Proc. Sympos. Appl. Math., pages 73–90. American Math.
Soc., 1991.
[Matijasevič 1971] Y. Matijasevič. Diophantine representations of the set of prime
numbers. Dokl. Akad. Nauk SSSR, 12:354–358, 1971.
[Mauldin 1999] R. Mauldin. The Beal conjecture and prize, 1999.
http://www.math.unt.edu/˜mauldin/beal.html.
[McClellan and Rader 1979] J. McClellan and C. Rader. Number Theory in Digital
Signal Processing. Prentice-Hall, 1979.
[McKee 1996] J. McKee. Turning Euler’s factoring method into a factoring
algorithm. Bull. London Math. Soc., 28:351–355, 1996.
[McKee 1999] J. McKee. Speeding Fermat’s factoring method. Math. Comp.,
68:1729–1737, 1999.
[Menezes et al. 1993] A. Menezes, T. Okamoto, and S. Vanstone. Reducing elliptic
curve logarithms to a finite field. IEEE Trans. Inform. Theory,
39:1639–1646, 1993.
[Menezes et al. 1997] A. Menezes, P. van Oorschot, and S. Vanstone. Handbook of
Applied Cryptography. CRC Press, 1997.
[Mignotte 2001] M. Mignotte. Catalan’s equation just before 2000. In M. Jutila
and T. Metsänkylä, editors, Number Theory (Turku, 1999). de Gruyter,
247–254.
[Mihăilescu and Avanzi 2003] P. Mihăilescu and R. Avanzi. Efficient
‘quasi-deterministic’ primality test improving AKS.
http://www-math.uni-paderborn.de/˜preda/.
[Mihăilescu 2004] P. Mihăilescu. Primary cyclotomic units and a proof of
Catalan’s conjecture. J. Reine Angew. Math. 572:167–195, 2004.
[Miller 1976] G. Miller. Riemann’s hypothesis and tests for primality. J. Comput.
System Sci., 13:300–317, 1976.
[Miller 1987] V. Miller. Use of elliptic curves in cryptography. In H. Williams,
editor, Advances in Cryptology, Proc. Crypto ’85, volume 218 of Lecture
Notes in Computer Science, pages 417–426. Springer–Verlag, 1987.
[Mills 1947] W. Mills. A prime-representing function. Bull. Amer. Math. Soc.,
53:604, 1947.
[Moenck 1973] R. Moenck. Fast computation of GCDs. In Proc. 5th Annual ACM
Symposium on the Theory of Computing, pages 142–151, 1973.
[Monier 1980] L. Monier. Evaluation and comparison of two efficient probabilistic
primality testing algorithms. Theoret. Comput. Sci., 12:97–108, 1980.
[Montgomery and Vaughan 1973] H. Montgomery and R. Vaughan. The large
sieve. Mathematika 20:119–134, 1973.
[Montgomery 1985] P. Montgomery. Modular multiplication without trial division.
Math. Comp., 44:519–521, 1985.