|
|
|
|
|
by tveita
4467 days ago
|
|
Right, in random oracle proofs you assume that values are random, and then you replace them with something that no one can distinguish from random. Then you consider it broken when someone finds a distinguisher requiring three exabytes of output, because any distinguishable non-randomness breaks the proof. It's trivial to make a distinguisher for user passwords. Just guess "password". There's an inherent difference between random keys and chosen passwords. Random keys, used correctly, are secure. Passwords just give you a chance to provide your own security, and most people fail to do so. No one are picking 15 random words from a dictionary to make their passwords. Passwords are one of the weakest links in IT security, on par with the people, and I don't think making them more of a single point of failure is the way to better security. That's what widespread 2-factor authentication was getting us away from. Have you tried cracking uploaded keys to check the strength of the passwords? |
|
We haven't tried cracking uploaded keys. It's a good idea, but expensive, we could be using those cycles to mine litecoins instead!
Thanks for your feedback, we appreciate it.