Re: El Gamal strength by modulus length

vcarlos35@juno.com
Sun, 22 Feb 1998 15:07:41 -0500

• Next message: Simon Spero: "Smart card readers for Laptops?"
• Previous message: Lewis McCarthy: "Re: El Gamal strength by modulus length"
• In reply to: Steve Salkin: "El Gamal strength by modulus length"

AFAIK, the asymptopic runtime of recovering discrete logs is about the
same as
the asymptopic runtime of factoring (using the most efficient current
algorithms.

On Fri, 20 Feb 1998 16:23:28 -0500 Steve Salkin
<salkin@pop.mindspring.com> writes:
>Hi folks:
>
>Can anyone give me a pointer to some information about the strengths
>of El Gamal versus other popular public key cryptosystems for a
>given modulus length? It would be nice to say to a customer, for
>example, that although we do not use RSA, that the El Gamal system
>we use is as strong at 2048 bits as the RSA system is at 1024 bits,
>or something along those lines.
>
>I didn't find it in Schneier. :)
>
>Steve Salkin
>

_____________________________________________________________________
You don't need to buy Internet access to use free Internet e-mail.
Get completely free e-mail from Juno at http://www.juno.com
Or call Juno at (800) 654-JUNO [654-5866]

• Next message: Simon Spero: "Smart card readers for Laptops?"
• Previous message: Lewis McCarthy: "Re: El Gamal strength by modulus length"
• In reply to: Steve Salkin: "El Gamal strength by modulus length"