Royal Holloway and Bedford New College, Department of Statistics & Computer Science, Egham, UK
Volume :
22
Issue :
16
fYear :
1986
Firstpage :
875
Lastpage :
877
Abstract :
A new method of generating strong primes is presented. The method produces primes satisfying Gordon´s strong prime requirements but which are not probabilistic. The expected time required to generate such a prime is comparable with previously proposed methods.
Keywords :
cryptography; Gordon´s strong prime requirements; cryptography; expected time; strong primes;
