Elgamal - how many bits are required for security?

1 view
Skip to first unread message

Leslie 'Mack' McBride

unread,
Apr 28, 1997, 3:00:00 AM4/28/97
to

Does anyone have comparisons of the number of bits required
for the prime in Elgamal and the N=PQ in RSA. I am interested
in both the signature and public-key versions of Elgamal.

Mack

schl...@bbs.cruzio.com

unread,
Apr 29, 1997, 3:00:00 AM4/29/97
to

The ElGamal prime can have a few dozen fewer bits than the RSA
modulus, and give the same security. That is, discrete
logarithms are slightly harder than factoring.

Roger


Reply all
Reply to author
Forward
0 new messages