Re:How easy is it in 2022 to find a SHA1 collision?
by bick_nyers on Monday April 25, 2022 @10:18AM
(#31155158)
I would expect a tiered approach when it comes to deleting data. E.g. before deleting you actually check byte by byte, but because that is too expensive to run on every file, you use the hash to narrow down what files you are testing against each other (and maybe even a cheaper hash on top of that one that determines whether you will spend CPU cycles on doing an expensive hash).
Perhaps that's how it's actually done, I'm not sure.
Perhaps that's how it's actually done, I'm not sure.