A message from Comodo Hacker
31–40 of 44 posts
Re: A message from Comodo Hacker
#32Re: A message from Comodo Hacker
#33Re: A message from Comodo Hacker
#34> At first I decided to hack RSA algorithm, I did too much investigation on SSL protocol, tried to find an algorithm for factoring integer, analyzed existing algorithms, for now I was not able to do so, at least not yet, but I know it's not impossible and I'll prove it Huh. He kind of lost all credibility at that point. Breaking RSA isn't something you just decide to do. I'll wait for the day when he announces he's b…
I came here to post exactly that. After reading him state how astonishing his skills are and how he'll tackle the integer factorization problem, I thought to myself, "he must be a 20 years old university student." Then he states his age.
Re: A message from Comodo Hacker
#35Earlier quoted context omitted.
> I'll wait for the day when he announces he's broken it. And so will a massive part of the Computer Science/Mathematics/Physics community. Answering the P vs NP question is kind of a big deal. :D
No. Integer factorization is not NP-hard (so not NP-complete). (This isn't proven, but it's generally thought to be the case.) So, while doing a polynomial-time integer factorization would be hugely significant (and make all asymmetric encryption in the world useless), it would not prove P=NP.
This is wrong in two ways.
First, a polynomial-time algorithm could still be too slow to be practical, either because the degree of the polynomial were high or because the constant factor or asymptotically disappearing overhead were high.
Second, discrete-logarithm-based cryptography does not depend on the difficulty of integer factorization. That includes Diffie-Hellman, ElGamal, DSA, SRP, and elliptic-curve methods.
You're right that integer factorization is not known to be NP-hard, and so a polynomial-time integer factorization algorithm wouldn't show P=NP.
Re: A message from Comodo Hacker
#36That's some serious Miyamoto Musashi rhetoric there. The guy's either a grade A rationalist or a massive douchebag. I put odds at 5/95.
Re: A message from Comodo Hacker
#37I think I kind of know, but for the uninitiated, can someone tell us what the potential practical consequences of this hack could have been?
If you combined these evil SSL certs with the right BGP hijack, you could read a lot of people's email and such. And since reading mail lets you reset passwords on everything else, he could have basically owned millions of people.
Re: A message from Comodo Hacker
#38Re: A message from Comodo Hacker
#39> At first I decided to hack RSA algorithm, I did too much investigation on SSL protocol, tried to find an algorithm for factoring integer, analyzed existing algorithms, for now I was not able to do so, at least not yet, but I know it's not impossible and I'll prove it Huh. He kind of lost all credibility at that point. Breaking RSA isn't something you just decide to do. I'll wait for the day when he announces he's b…
Hasn't everyone woken up some day and said "hey, I'm gonna break RSA today"? I guess that only happens when you have the experience of 1000 hackers...
Re: A message from Comodo Hacker
#40So it takes the "skill of 1000 programmers" to write a program to send POST requests to an HTTP API? He must have been writing his client in Java...