First of All, Hello board !

I have questions in my mind about that (please look in the attachments, such a luck I couldn't find the url, so I had to upload it)
How could it be so fast ? actually how is it working ?.  At this point, reverse enginnering is useless, because of the fact that, if you don't know the name of algorithm, you won't find out how it is working.

Thanks for your time.
Posted on 2006-07-14 16:23:31 by Dite
in About...
This program uses Trial Division by small primes and the Miller Rabin
Algorithm (80 iterations) for primality tests. Chances for false detection
are max. 0.25^80 (!). You see, the generated primes are -safe- to use.


Posted on 2006-07-14 18:30:33 by sHice
Ouch, I'm so sory :(, I should have looked there before,

Thank you.
Posted on 2006-07-15 02:25:28 by Dite