Cohen, H.Lenstra, Arjen K.2010-06-242010-06-242010-06-24198710.1090/S0025-5718-1987-0866102-2https://infoscience.epfl.ch/handle/20.500.14299/51003An 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 minutesmathematics computingnumber theorytext::journal::journal article::research article