6 ms·
its the same structure as a Bloom filter but more efficient because it has no empty slots
by bloomthrowaway 8y ago
its the same structure as a Bloom filter but more efficient because it has no empty slots
- jhafdks7r3wr3 8y agoNo, it's not the same structure as a Bloom filter without empty slots. It's the same structure as a Bloom filter with only one hash function. Bloom filters use multiple.
- bloomthrowaway 8y agomultiple hash functions only exist because they don't use secure hashes (for speed reasons) so there's collisions. Normally for passwords you would use a secure hash, negating this
- Franciscouzo 8y agoNo, the math on bloom filters already assumes a random oracle.