Y
Hacker News
new
|
ask
|
show
|
jobs
by
shakna
391 days ago
Some hashes do have verification bits, that are used not just to verify intact hash, but one "identical" hash from another. However, they do tend to be slower hashes.
1 comments
grumbelbart2
391 days ago
Do you have an example? That just sounds like a hash that is a few bits longer.
link
shakna
391 days ago
Mostly use of GCM (Galois/Counter Mode). Usually you tag the key, but you can also tag the value to check verification of collisions instead.
But as I said, slow.
link