On 8/28/06, snacktime <snacktime / gmail.com> wrote:
> Without going into too much detail, I've run into a roadblock using
> rsa.  I need to encrypt data that is larger than the key size.   Right
> now I am generating a random key, encrypting the data with it using
> AES, then encrypting the key with rsa.  Works, but I'd rather keep it
> simpler if there is another asymmetric cipher I could use in place of
> rsa.  At most the data to be encrypted would be 10 times the key size.

Well, ElGamal (basically a variation on Diffie-Hellman key agreement),
but then again having implemented both ElG and RSA on various
platforms myself I don't see ElG as being significantly simpler than
RSA (both still require modular exponentiation of large numbers).
What's the big problem with RSA?