References

[DLP93]

Ivan Damgård, Peter Landrock, and Carl Pomerance. Average case error estimates for the strong probable prime test. Mathematics of Computation, 61(203):177–194, 1993. URL: http://www.jstor.org/stable/2152945, doi:10.2307/2152945.

[Dav92]

J. H. Davenport. Primality testing revisited. In P. S. Wang, editor, Proceedings of International Symposium on Symbolic and Algebraic Computation (ISSAC‘92), 123–129. ACM Press, 1992.

[DST88]

J. H. Davenport, Y. Siret, and E. Tournier. Computer Algebra, Systems and Algorithms for Algebraic Computation. Academic Press, New York, NY, USA, 1988. ISBN 0-122-04230-1.

[Knu97]

Donald E. Knuth. The Art of Computer Programming, Volume 2 (3rd Ed.): Seminumerical Algorithms. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1997. ISBN 0-201-89684-2.

[PD75]

H. Pollard and H. G. Diamond. The Theory of Algebraic Numbers. Wiley, New York, 1975.

[PSW80]

Carl Pomerance, J. L. Selfridge, and Samuel S. Wagstaff, Jr. The pseudoprimes to $25\cdot 10^9$. Mathematics of Computation, 35(151):1003–1026, 1980. doi:10.2307/2006210.

[Rab80]

Michael O Rabin. Probabilistic algorithm for testing primality. Journal of Number Theory, 12(1):128 – 138, 1980. URL: http://www.sciencedirect.com/science/article/pii/0022314X80900840, doi:http://dx.doi.org/10.1016/0022-314X(80)90084-0.

[vzGG99]

Joachim von zur Gathen and Jürgen Gerhard. Modern Computer Algebra. Cambridge University Press, New York, NY, USA, 1999. ISBN 0-521-64176-4.