-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
At least to my (limited) understanding,... it seemed logical that it would
be stronger.
Imagine a quick factorising algorithm would be found,... RSA would be
broken, but ElGamal not automatically,... (at least I've never heard about,
that the factorisation problem can be transformed into the discrete
logarithm problem).
It can. If there is a fast factoring algorithm, then there is also a fast
discrete log algorithm.
Jon
-----BEGIN PGP SIGNATURE-----
Version: PGP Universal 2.10.0 (Build 554)
Charset: us-ascii
wj8DBQFMeBndsTedWZOD3gYRAsB5AJwLSNja3YsDoTPr8AIOMscXtfSv6QCg3BSO
iIP/WjaPp5p0ykXlZZM/BUM=
=5lRB
-----END PGP SIGNATURE-----