Minimizing the Time of Detection of Large (Probably) Prime Numbers
  In this paper we present the experimental results that more clearly than any theory suggest an answer to the question: when in detection of large (probably) prime numbers to apply, a very resource demanding, Miller-Rabin algorithm. Or, to put it another way, when the dividing by first several tens of prime numbers should be replaced by primality testing? As an innovation, the procedure above will be supplemented by considering the use of the well-known Goldbach's conjecture in the solving of this and some other important questions about the RSA cryptosystem, always guided by the motto "do not harm" - neither the security nor the time spent. 
Dragan Vidakovic, Dusko Parezanovic, Zoran Vucetic
cs.CR