GMP compared to JAVA

Torbjorn Granlund tg at swox.com
Fri Dec 21 18:19:00 CET 2007


Paul Zimmermann wrote:

  I see three possible explanations:

  (a) JAVA is much more efficient than GMP
  (b) your computer is very efficient for JAVA applications
  (c) your JAVA exponent (q) has much less than 10005 bits

Let me add:

  (d) The ring is trivially factorable.

GMP doesn't attempt to factor the ring, as this is seen as the task pf
the caller.

If the tested java implementation's bignum code is tailored against
speeding up naive benchmarks, it might actually try to factor the
ring.

-- 
Torbjörn


More information about the gmp-discuss mailing list