A new method for the generation of strong prime numbers
Résumé
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.