4 ms·
SRP is supposed to make use of multiple types of entropy to ensure the passwords are far more complicated that salted SHA1. While I agree it's possible that th
by thechut 14y ago
SRP is supposed to make use of multiple types of entropy to ensure the passwords are far more complicated that salted SHA1.
While I agree it's possible that the attackers also got this information but I don't think we can jump to conclusions about the overall security of the passwords until more information is known.
- zaroth 14y agoPlease read the RFC, it's right here: http://www.ietf.org/rfc/rfc2945.txt http://www.ietf.org/rfc/rfc2945.txt Password entries are generated as follows: <salt> = random() x = SHA(<salt> | SHA(<username> | ":" | <raw password>)) <password verifier> = v = g^x % N G = 47 N = 112624315653284427036559548610503669920632123929604336254260115573677366691719 What was stolen was no better than LinkedIn hashes -- for the purposes of dictionary attacking the database
- deleted 14y ago[deleted]
- tedunangst 14y agog^x is slow, therefore better than linkedin hashes for the purpose of dictionary attacking the database.
- zaroth 14y agoDefine slow tedunangst - Big O notation please. Maybe you can look here: http://en.wikipedia.org/wiki/Modular_exponentiation http://en.wikipedia.org/wiki/Modular_exponentiation. Ok, I'll save you the trouble -- the modular exponentiation is O(log exponent). That's log as in... FAST.
- mindslight 14y agoWhat's the Big-O of PBKDF2 ? Constants matter. (Also, computational complexity of crypto algorithms is usually specified in terms of nbits, not numeric magnitude) (Although this argument has given me an idea for everyone that thinks using the same password on different sites is reasonable - a browser extension that runs a client-side KDF :P)
- tedunangst 14y agoslow == 172.959 times slower than sha1("password")
- tedunangst 14y agoActually, I forgot one minor thing. LinkedIn hashes were unsalted. Even assuming SRP is no better than sha1, cracking all of the battle.net passwords is going to be $number_of_users times harder than LinkedIn.