First of All, Hello board !

I have questions in my mind about that (

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.

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.

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.

:)

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.

:)

Ouch, I'm so sory :(, I should have looked there before,

Thank you.

Thank you.