Distributed primality proving and the primality of (2 +1)/3

Abstract : The aim of this report is to explain the implementation of the elliptic curve primality proving algorithm of Atkin in a distributed way. We describe the use of a Le_Lisp program managed by a bunch of script-shells that run processes on different workstations communicating via the distributed file system NFS. As a result, the primality of 700-digit numbers can be done routinely in about a week of CPU on 10 SUN's. Using twelve SUN's and one month and half CPU, the author was able to prove the primality of a very large number (1065 digits) . This is (up to now) the record for the largest number ever tested for primality by a general purpose algorithm.
Type de document :
Rapport
RR-1152, INRIA. 1989
Liste complète des métadonnées

https://hal.inria.fr/inria-00075407
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 18:09:31
Dernière modification le : vendredi 16 septembre 2016 - 15:11:37
Document(s) archivé(s) le : mardi 12 avril 2011 - 22:58:35

Fichiers

Identifiants

  • HAL Id : inria-00075407, version 1

Collections

Citation

F. Morain. Distributed primality proving and the primality of (2 +1)/3. RR-1152, INRIA. 1989. 〈inria-00075407〉

Partager

Métriques

Consultations de la notice

101

Téléchargements de fichiers

44