4 ms·
They're different things, indeed, and can both be used for public-key crypto. ElGamal uses intractability of the discrete log, RSA uses the intractability of in
by y7 7y ago
They're different things, indeed, and can both be used for public-key crypto. ElGamal uses intractability of the discrete log, RSA uses the intractability of integer factorization. Both are broken by Shor's algorithm on quantum computers.
- LolWolf 7y agoTo be fair, this is one point that I think they've actually gotten correct. Discrete log is easy <=> Integer factorization is easy.