Implementation of a new primality test

An implementation of the Cohen-Lenstra version (see ibid., vol. 42, p.297-330, 1984) of the Adleman-Pomerance-Rumely primality test (see L.M. Adleman, C. Pomerance and R.S. Rumely, Ann. of Math., vol.117, p.173-206, 1983) is presented. Primality of prime numbers of up to 213 decimal digits can now routinely be proved within approximately ten minutes


Published in:
Mathematics of Computation, 48, 177, 103 - 21
Year:
1987
Publisher:
American Mathematical Society
ISSN:
0025-5718
Keywords:
Laboratories:




 Record created 2010-06-24, last modified 2018-09-13

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)