An Incremental Hash Algorithm for Hard Disk Integrity Check

Compared with traditional hash functions,the incremental hash function has instrumentality and parallelizability.If data x is modified we don't need to compute its hash value from scratch.By incremental hash function,updating the old hash value to the new one is time proportional to the amount of modification made in x.Based on incremental hash paradigm we design a new kind of incremental hash function for hard disk integrity.We introduce the detail of this algorithm,discuss its provable security against collision-attack and then analyze some advantages of this hash function which is not issued before.Finally we indicate a set of experiment data compared with two existed hash functions,which will practically prove the advantages of iHash in performance.