Loading ...
Sorry, an error occurred while loading the content.

20818Some Benchmark Primality Test

Expand Messages
  • calimero22
    Aug 31, 2009
    • 0 Attachment
      I post some time test for a primality or pseudoprimality check.

      Tests on AMD Sempron 3000+ (1800 Mhz) WIndows XP
      n=31838235*2^29717+1 digits: 8954
      Tests run by GIOVANNI DI MARIA - email: calimero22@...
      Tests give at least a Pseudoprimality PRP.

      ===================================================================
      GMP Library
      mpz_probab_prime_p(n,r) r=1 = 72 secs.
      mpz_probab_prime_p(n,r) r=0 = 34 secs.
      fermat (mpz_powm(2,n,n) = 2^n MOD n = 34 secs.
      My implementation Fermat algorytm = 33 secs.
      ===================================================================
      PFGW
      pfgw 3.2.2 (On AMD 1800 Mhz) = 3.1 secs.
      pfgw 3.2.2 (On INTEL P4 1800 Mhz) = 1.7 secs. <-----
      ===================================================================
      MATHEMATICA
      Mathematica PowerMod[2,n,n] (Fermat) = 38 secs.
      PrimeQ[n] = 157 secs.
      ===================================================================
      PARI/GP
      ispseudoprime(n) BPSW test = 130 secs.
      ispseudoprime(n,1) strong Rabin-Miller test for 1 base = 43 secs.
      powermod(x,k,m)=lift(Mod(x,m)^k) --> powermod(2,n,n) = 42 secs.
      isprime(n) = too long
      ===================================================================
      PROTH.EXE
      Normal Test = 5 secs.
      ===================================================================
      LLR.EXE
      Normal Test = 7 secs.
      ===================================================================
      PRP.EXE
      Normal Test = 7 secs.
      ===================================================================
      PrimeForm.EXE
      Normal Test = 24 secs.
      ===================================================================
    • Show all 5 messages in this topic