6 ms·
Video: https://www.youtube.com/watch?v=ML41g0hb7hM https://www.youtube.com/watch?v=ML41g0hb7hM nneonneo already posted some highlights. Another one (2m50s): "
by y7 7y ago
Video: https://www.youtube.com/watch?v=ML41g0hb7hM https://www.youtube.com/watch?v=ML41g0hb7hM
nneonneo already posted some highlights. Another one (2m50s):
"[Public key crypto] depends on one simple math equation. It is prime_1 times prime_2 = composite number. This is what's called the discrete logarithm."
- katmannthree 7y agoMy algebra is a little rusty, but isn't the discrete log totally unrelated except for also sometimes serving as a pseudo-oneway function?
- y7 7y agoThey'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.