2 ms·
The core of the attack that ryan-c is describing, is this: > Say you have a password database with 10,000 users in it. You want to see if any of them used "Pas
by joepie91_ 12y ago
The core of the attack that ryan-c is describing, is this:
> Say you have a password database with 10,000 users in it. You want to see if any of them used "Passw0rd$". Without salt, you compute the hash once and check it against all the users (perhaps with a bloom filter).
That is basically the same as a rainbow table attack. A conventional rainbow table attack looks like this:
for user in users:
for hash in rainbowTable:
(hash == user.hash)
The attack that ryan-c is describing looks like this:
for hash in rainbowTable:
for user in users:
(hash == user.hash)
They are still fundamentally the same concept.