Crown Sterling Claims to Factor RSA Keylengths First Factored Twenty Years Ago

Re:Crown Sterling Claims to Factor RSA Keylengths First Fact... by y7 on Friday September 20, 2019 @03:51PM (#21030529)

Video: 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."

[ Parent | on HN ]

Re:Crown Sterling Claims to Factor RSA Keylengths First Fact... by katmannthree on Friday September 20, 2019 @05:39PM (#21031572)

My algebra is a little rusty, but isn't the discrete log totally unrelated except for also sometimes serving as a pseudo-oneway function?

[ Parent | on HN ]

Re:Crown Sterling Claims to Factor RSA Keylengths First Fact... by y7 on Friday September 20, 2019 @05:49PM (#21031678)

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.

[ Parent | on HN ]

Re:Crown Sterling Claims to Factor RSA Keylengths First Fact... by LolWolf on Friday September 20, 2019 @10:07PM (#21033040)

To be fair, this is one point that I think they've actually gotten correct. Discrete log is easy <=> Integer factorization is easy.

[ Parent | on HN ]