Skip to Main content Skip to Navigation

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.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 2:21:28 PM
Last modification on : Friday, February 4, 2022 - 3:10:52 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:10:57 PM


  • HAL Id : inria-00074032, version 1


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



Record views


Files downloads