Does anyone know which primality algorithm isProbablePrime in java.math.BigInteger uses?
I suspect it might use either Miller-Rabin or Solovay-Strassen?

Also, what algorithm does ProbablePrime use to hand out a random prime number?

I've gone a head and coded a nice prime tester based on Fermat's Little Theorem, which you can view here: http://my.opera.com/duddev/blog/show.dml/298370
I suspect isProbablePrime does not use Fermat's primality test...

Visit my blog please?
http://my.opera.com/duddev/blog/