[2683] in cryptography@c2.net mail archive
Optimizing ElGamal encryption and verification
daemon@ATHENA.MIT.EDU (dontspam-tzeruch@ceddec.com)
Wed May 13 14:28:46 1998
Date: Wed, 13 May 1998 11:56:07 -0400
From: dontspam-tzeruch@ceddec.com
cc: cryptography@c2.net
To: <cryptography@c2.net>
In-Reply-To: <199709261847.OAA08853@wintermute.ny.zeitgeist.com>
I noticed that some RSA implemetations use a bunch of other information
and some transformations (e.g. chinese remainder theorem) to speed up the
algorithm.
Is there something similar I can do for ElGamal? For the signature
checking I am doing three modular exponentiations (which is extremely slow
when I am using a 4K key).
The encryption side requires two modexps.
Any suggestions?
--- reply to tzeruch - at - ceddec - dot - com ---
