3 ms·
The chaotic algorithm is meant to be the hash, not the art-ification. So of course if you take two very similar hashes they will appear very similar.
by jfrunyon 5y ago
The chaotic algorithm is meant to be the hash, not the art-ification. So of course if you take two very similar hashes they will appear very similar.
- deleted 5y ago[deleted]
- progbits 5y agoDoing an extra round of hashing wouldn't hurt though, right? Either the hashes are very different and you can already tell from them (but the art will also be different) or they are very similar (someone trying to sneak a close-enough hash by you) and then the second round of hashing leads to very different art.
- c3534l 5y agoDoing an extra round of hashing wouldn't do anything. If they were different before, now they might be the same. If the hashing algorithm is worth its salt (pun intended) then the original hash will be just as random as the hash of the hash, providing nothing of value.
- fred256 5y agoI think it might work if you display both the hash and the image, and ask the user to compare both. If the hashes are very different, it doesn't matter that the images are similar (assuming the user indeed verifies both). If the hashes are similar, another round of hashing before producing the image, might make the images very different. But maybe I misunderstood?
- yencabulator 5y agoThe problem is that an attacker can churn out public keys until they end up with a hash that's very similar. Picking a random number and doing a keyed hash of both inputs, then comparing those, would bring out small differences in a way the attacker cannot control.
- GormanFletcher 5y agoI think that would work well. A high-quality hash is designed such that changing a single input bit will flip approximately half of the output bits. So hashing both values will make it very easy for a human to spot whether the input values were different.