Define a set of checkpoints within a file. Calculate all the hashes from the beginning of the file to each checkpoint, faster than naive quadratic time method. This requires some special care padding the last block before the checkpoint.
The goal is to know where in a file the first error is. One can truncate each of the many hashes to as little as 1 bit. This of course loses cryptographic security.
No comments :
Post a Comment