Back to Search
Start Over
Algorithmic and Experimental Computation of Higher-Order Safe Primes.
- Source :
- AIP Conference Proceedings; 9/15/2008, Vol. 1048 Issue 1, p170-173, 4p
- Publication Year :
- 2008
-
Abstract
- This paper deals with a class of special primes called safe primes. In the regular definition, an odd prime p is safe if, at least, one of (p±1)/2 is prime. Safe primes have been recommended as factors of RSA moduli. In this paper, the concept of safe primes is extended to higher-order safe primes, and an explicit formula to compute the density of this class of primes in the set of the integers is supplied. Finally, explicit conditions are provided permitting the algorithmic computation of safe primes of arbitrary order. Some experimental results are provided as well. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 0094243X
- Volume :
- 1048
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- AIP Conference Proceedings
- Publication Type :
- Conference
- Accession number :
- 34295229
- Full Text :
- https://doi.org/10.1063/1.2990883