|
|
|
|
|
|
by jsjenkins168
6859 days ago
|
|
|
It looks like he is only using rainbow tables suitable for NTLM hashes. For other algorithms you need different lookup tables. I would honestly be surprised if it was even feasible to do this for an SHA-1 hash. The rainbow table would need to be unreasonably large. And SHA-2, forget about it. Secret salt or not, you're not going to crack any of those variants anytime in the next several years. Rainbow tables would be impossibly large and hash collisions are next to impossible. That is unless you have access to some super-secret multi-bit quantum computer or something.. |
|
|