Re: How to Generator Prime Numbers in a short time ?

Lutz Donnerhacke wrote:

Multiply all those prims and use the Euclidean algorithm once.
Can you tell me more details of Euclidean algorithm ?
Multiply all those primes ?
It would be a big number.

The success of Rabin-Miller implies, that Lucas-Lehmer and Fermat tests also
succeed. So stick to Rabin-Miller and forget about the others.
Thank you for your advise .I will stick to Rabin-Miller.

Don't expect the worst case. It's much better in the avarage.
If I take Rabin-Miller test for more than four times the probability
of worst case is less than a data transmission error.
So I decide to ignore the worst case,

Does those tricks help a bit?
Thank you very much !
I want to know more about Euclidean algorithm , perhaps there are
some clews in the algorithm that can save calculating time in my
program .

.

Relevant Pages

  • Re: gcd...
    ... > together with the fact that the same Euclidean algorithm ... > I hoped to dispense with primes by argueing as follows: ... powers --- and in fact, the original powers have been replaced ... subtraction rather than division --- we're just carrying out the ...
    (sci.math)
  • Re: gcd...
    ... > No fuss, no muss. ... together with the fact that the same Euclidean algorithm ... Things seem different each time I try to clarify this in my mind. ... I hoped to dispense with primes by argueing as follows: ...
    (sci.math)
  • Re: gcd...
    ... Bruce Ikenaga wrote: ... > bringing in primes or giving divisibility arguments. ... > Euclidean algorithm in the exponents. ...
    (sci.math)
  • Re: How to Generator Prime Numbers in a short time ?
    ... Can you tell me more details of Euclidean algorithm? ... Multiply all those primes? ... So stick to Rabin-Miller and forget about the others. ...
    (sci.crypt)
  • Re: tell me if this is right.
    ... > I) Factor out all the primes. ... of the denominators ... > Now to reduce I've applied the Euclidean algorithm ... Otherwise as both numerator and denominator end in even digit divide by 2 ...
    (sci.math)
Loading