| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10331376 | Information Processing Letters | 2005 | 6 Pages |
Abstract
We clarify the notion of a strong prime by supplying a precise definition and a characterization for an optimal strong prime. We present a conjecture regarding the distribution and density of optimal strong primes, allowing one to predict in advance the time needed to compute one optimal strong prime of a given bit length. Based on these results, we develop an algorithm to compute optimal strong primes. Some experimental results are also included.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
R. Durán DÃaz, J. Muñoz Masqué,