5 ms·
From the 'segment of a realistic episode of a crime program': > “So it’s an inside job?!” > “No, the hacker got in by guessing one of the clerks’ passwords.”
by thaumasiotes 5y ago
From the 'segment of a realistic episode of a crime program':
> “So it’s an inside job?!”
> “No, the hacker got in by guessing one of the clerks’ passwords.”
> “That’s not possible, we have a password security policy in place. Brute forcing that kind of thing would take hundreds of thousands of attempts.”
> “Well, normally, yes, but the clerk was using the same password for her email, and that server got hacked, and a file with all the usernames and plaintext passwords got dumped.”
> “But everyone knows user passwords need to be stored as one-way hashes so that getting the plaintext back out of them is impossible.”
> “They were hashed, but only md5! The hackers just used a rainbow table to do the lookups.”
A password security policy could have prevented that. ;p
- sokoloff 5y agoAbout half the Epic (electronic medical records) terminals I see have the password posted on the front of the terminal. Often in a nice, professional PTouch label (so presumably by IT).
- thaumasiotes 5y agoThat's a very effective defense against this attack. It's ineffective against someone walking up to the terminal.
- loonster 5y agoIt could be the 1st factor with the person only remembering a simple password to add to the end.
- aaron695 5y agoI think you are saying with a password security policy you couldn't rainbow table the md5 of the password following the policy? I'm not sure that's true anymore. Without salts (which the third party didn't have) I'd assume many passwords the human mind can remember within workable policy rules have been compromised. If the 3rd party had salted them, even with a common salt, the password policy probably would have worked though.
- thaumasiotes 5y agoA rainbow table approach is easily defeated by length. Whether you can remember a password depends mostly on how often you use it. If you have to type it in every day, 30 random letters aren't difficult to remember. I can still tell you my first library card number just from the messages the library would leave when a book came in. 1000102772901.
- aaron695 5y ago> A rainbow table approach is easily defeated by length. Only somewhat true. This XKCD is absolutely wrong - https://xkcd.com/936/ https://xkcd.com/936/ 10 billion MD5s a second should be easy. So the XKCD pass phrase goes from 550 years -> to one hour, on a normal GPU, for one person. Rainbow tables mean after that one hour on their gaming PC no one else has to do it. Start adding in other requirements to the pass phrase the hour goes up, and perhaps you have to rent some cloud time, but only one person once has to do it once. But, if you assume it's likely other sites use seeds, then rainbow tables are out, and length can matter again. And that's reasonable. You need to wreck as many points in the attackers chain as possible. That's the game.
- thaumasiotes 5y ago> But, if you assume it's likely other sites use seeds, then rainbow tables are out, and length can matter again. I'm not sure what you're saying here. If by seeds you mean "salts", they're not relevant -- the whole point of a rainbow table is that you precalculate the hash of every possible password. If it's salted, you'll see the salt in the plaintext and just remove it. But a rainbow table for long passwords will develop pretty extreme storage requirements, and take a long time to compute.
- aaron695 5y ago> If by seeds you mean "salts" Yep > If it's salted, you'll see the salt in the plaintext and just remove it. No. You can't use rainbow tables on salted data. Maybe when a framework has a default common salt that people forget to change. > rainbow table for long passwords will develop pretty extreme storage requirements, Not really, that's the point of rainbow tables. They can be reasonable, they are not lookup tables. If you are looking at large ones, they can be compacted at the expense of time. For "CorrectHorseBatteryStaple" the rainbow table will not contain "sdfgnWlgiuwreFrglrkemnmZflgh". You map the chain to your search space. So after CorrectHorseBatteryStaple might be SimpleFineChairBook or S1mpleFineChairB00k or SimpleFine@ChairBook depending on your space.