A new method for the generation of strong prime numbers
Yannick Saouter · 1995
: 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. Key-words: Cryptography; Prime number generation (R'esum'e : tsvp) y email: [email protected] CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE Centre National de la Recherche Scientifique Institut National de Recherche en Informatique (URA 227) Universite de Rennes 1 -- Insa de Rennes et en Automatique -- unite de recherche de Rennes Une nouvelle m'ethode de g'en'eration de nombre premiers robustes R'esum'e : Depuis l'invention du sch'ema d'encryption RSA, le domaine de la primalit'e a connu un regain d'int'eret. Pour la g'en'eration des cl'es de ce code, deux no...