3 ms·
The only way that would make sense is if your hash function is random. That's typically not how hash functions are built, since it would largely render them use
by Retra 10y ago
The only way that would make sense is if your hash function is random. That's typically not how hash functions are built, since it would largely render them useless. A cryptographically strong hash function only tries to guarantee that there is no predictable order to the hashes, not that the hashes are random.
- Houshalter 10y agoWell of course they aren't random, it's a deterministic function. But the algorithm proposed is also a deterministic function. Both claim to produce scrambled outputs from semi random inputs. But it's not clear why this method is superior.
- Retra 10y agoI think the idea here is that you can take two weak sources of randomness and combine them into a stronger, single source of randomness in a homogenous way that doesn't reveal the original weaknesses. Thus it's not adding randomness from nowhere, but composing it in a useful way. I don't actually know, but that's the only interpretation I could come up with that makes sense to me.