A new method for the generation of strong prime numbers

Yannick Saouter 1
1 API - Parallel VLSI Architectures
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : Since the discovery of the RSA encryption scheme, primality domain has gained much interest. For the generation of keys for this code, two prime numbers are used. Amongst the different methods to deal with this problem, we are here interested in generation of certified prime numbers and we present a new method less costly in terms of computation in regard of the other methods of generation for a given size of prime numbers.
Type de document :
Rapport
[Research Report] RR-2657, INRIA. 1995
Liste complète des métadonnées

https://hal.inria.fr/inria-00074032
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 14:21:28
Dernière modification le : mercredi 16 mai 2018 - 11:23:02
Document(s) archivé(s) le : dimanche 4 avril 2010 - 22:10:57

Fichiers

Identifiants

  • HAL Id : inria-00074032, version 1

Citation

Yannick Saouter. A new method for the generation of strong prime numbers. [Research Report] RR-2657, INRIA. 1995. 〈inria-00074032〉

Partager

Métriques

Consultations de la notice

307

Téléchargements de fichiers

594