[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Ephemeral RSA
>From hugo@watson.ibm.com Wed Dec 14 19:18:44 1994
>Just for the amusement: if you count ONLY real-time
>operations, then using ephemeral RSA keys is significantly
>more efficent than DH.
>A chooses off-line two RSA primes and computes their product n.
>Then for key exchange A sends n to B.
>B encrypts a key using RSA with the public key n and sends it to A.
>A decrypts to find the key.
>
>The on-line cost is two multiplications (with public exponent 3) for B,
>and one RSA decryption for A (the later is up to 4 times faster than
> a single DH exponentiation using the Chinesse Remainder Thm).
>This is about 8 times less computation than the two (real-time)
>exponentiations required by DH.
:-) Well, this is amusing. Are you proposing we do this, or was this
just an FYA?
Ashar.