bug-gmp
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: symbol catenation and montgomery


From: Torbjorn Granlund
Subject: Re: symbol catenation and montgomery
Date: 02 Oct 2000 02:35:27 +0200
User-agent: Gnus/5.0807 (Gnus v5.8.7) Emacs/20.6

                     sign    verify    sign/s verify/s
     rsa 1024 bits   0.0067s   0.0004s    148.9   2797.4
  
  If it's doing 2797 encryptions/sec that's about 0.35 ms per modexp, or
  about the same as GMP.

I made some very simple tweaks of mpz_powm that shaved off about 30%
of the time for small exponents such as 65537.

We now do 4100 encryptions/sec on the same hardware as used for the
number above.

Isn't unreleased software great?  It is so much faster than all that's
already out there.  :-)

  An RSA encryption is a full 1024-bit modexp, though with a small
  exponent.

Now clear.

  You can't use the CRT because you don't know the secret
  factors.  The CRT is only for decryption.

I sure understand that.

-- 
Torbjörn



reply via email to

[Prev in Thread] Current Thread [Next in Thread]