Implementation of a new primality test
Cohen, H.; Lenstra, Arjen K.
1987

Files

Abstract

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

Details

Title Implementation of a new primality test
Author(s) Cohen, H. ; Lenstra, Arjen K.
Published in Mathematics of Computation
Volume 48
Issue 177
Pages 103-21
Date 1987
Publisher American Mathematical Society
ISSN 0025-5718
Keywords
DOI https://doi.org/10.1090/S0025-5718-1987-0866102-2
Laboratories LACAL
Record Appears in Scientific production and competences > I&C - School of Computer and Communication Sciences > IINFCOM > LACAL - Laboratory for cryptologic algorithms
Peer-reviewed publications
Work outside EPFL
Journal Articles
Published
Record creation date 2010-06-24

PDF