Implementation of a new primality test. (English) Zbl 0608.10001

Cohen, H.; Lenstra, A. K.

Math. Comput. 48, 103-121 (1987); Supplement S1-S4 (1987).

From the text: An implementation of the Cohen-Lenstra version of the Adleman-Pomerance-Rumely primality test is presented. Primality of prime numbers of up to 213 decimal digits can now routinely be proved within approximately ten minutes.
This paper does not present any new results. We only describe how a slightly improved version of the algorithm by the first author and H. W. Lenstra jun. [ibid. 42, 297–330 (1984; Zbl 0578.10004)] was implemented. No detailed program texts will be given, but we supply enough information for anyone who might be interested in implementing the algorithm from (loc. cit.), and who was discouraged by the more theoretical approach taken in (loc. cit.).

MSC:

11Y11	Primality
11A51	Factorization; primality
11-04	Software, source code, etc. for problems pertaining to number theory

Keywords:

large integers; implementation of Cohen-Lenstra version; computational number theory; Adleman-Pomerance-Rumely primality test; prime numbers

Citations:

Zbl 0578.10004