Tag Info

New answers tagged

1

The "mathematical proof" is you can choose N arbitrarily: t(bcrypt) * (2^N) >> t(sha) The final hash is all about avoiding collisions, so you're safe so long as hash >> password The salt is all about avoiding rainbow tables, so you're safe so long as (rainbow table size) * (salt) >> (attacker storage space)



Top 50 recent answers are included