Daniel C. Bastos dbastos at math.utoledo.edu
Sun Jan 23 18:11:43 CET 2005

On Sun, 23 Jan 2005 21:39:56 +0100 (MET)
Joppe Bos <jwbos at science.uva.nl> wrote:

> Hi,
> I think you are wrong, I have never heard from this library
> before but when I enter the library homepage of NTL there is a
> link to a page called"A Tour of NLT: Using NTL with GMP"
> (http://www.shoup.net/ntl/doc/tour-gmp.html), here it is stated
> that:"Briefly, GMP is a library for long integer arithmetic. It
> has hand-crafted assembly routines for a wide variety of
> architectures. For basic operations, like integer
> multiplication, it can be two to three (and sometimes bit more)
> times faster than NTL's traditional long integer package. The
> speedup is most dramatic on x86 machines."
> So this would imply GMP is way faster compared to NTL for basic
> operations. Note I have not downloaded this library nor tested
> anything I just copied this information from the website. So I
> am a little bit curious wat you tested to get your results? :-)

I think the OP means ``slower'' when he says ``fastless''. I
guess English isn't his native language and by translating he
came up with ``fastless (than)'' which could mean ``less fast
(than)'' that is``slower (than)''.

More information about the gmp-discuss mailing list