1993-05-12 - Re: [Torbjorn Granlund: GNU Multiple Precision Arithmetic Library]

Header Data

From: markh@wimsey.bc.ca (Mark C. Henderson)
To: cypherpunks@toad.com
Message Hash: 049f16fa3c0a7552798192a430d28ab4bdaba16b29af16b1607469b3dc67f440
Message ID: <m0nt9kW-0001U7C@van-bc.wimsey.com>
Reply To: N/A
UTC Datetime: 1993-05-12 05:54:49 UTC
Raw Date: Tue, 11 May 93 22:54:49 PDT

Raw message

From: markh@wimsey.bc.ca (Mark C. Henderson)
Date: Tue, 11 May 93 22:54:49 PDT
To: cypherpunks@toad.com
Subject: Re: [Torbjorn Granlund: GNU Multiple Precision Arithmetic Library]
Message-ID: <m0nt9kW-0001U7C@van-bc.wimsey.com>
MIME-Version: 1.0
Content-Type: text/plain


> Well, I've done some comparison between gmp 1.3 and RSAREF (as distributed
> with RIPEM 1.07) on a RS6000/320
> 
> The key generation speeds turned out to be almost exactly the same using
> the "aixgcc/xlc mixed" version of RSAREF/RIPEM and gmp compiled entirely
> with IBM's xlc compiler.
> 
> (for those who haven't poked around in RIPEM, I'll say that this RS6000
> version of RIPEM uses the "long long" data type to get 32 bit by 32 bit
> multiplications with 64 bit results quickly).
> 
> So, it wouldn't surprise me if some clever person could optimize
> gmp for the RS6000 and end up with something faster than what's
> provided in RIPEM 1.07.

In fact, after reading some code, I noticed the optimisations are
in there, if one compiles with gcc (a few bytes of RS6k assembler
makes a significant difference!). Anyway, the particular benchmark
I'm playing with (key generation) is now about 20% faster with gmp
than with the routines provided with RIPEM.

Mark

-- 
Mark Henderson
markh@wimsey.bc.ca
RIPEM key available by key server/finger/E-mail
  MD5OfPublicKey: F1F5F0C3984CBEAF3889ADAFA2437433





Thread