一种针对磁盘完整性校验的增量hash算法

An Incremental Hash Algorithm for Hard Disk Integrity Check

增量hash函数具有传统迭代hash函数所不具备的增量性和并行性,可以使数据校验值的更新时间与该数据被修改的规模成比例。论文采用增量校验的思想,设计了一种针对磁盘完整性校验的hash函数称为iHash。该文介绍了算法的设计,描述了算法的具体实现,论证了其在抗碰撞问题上的可证明安全性,详细分析了该算法既具有一般增量hash算法的性能优势又具有之前增量hash设计领域未曾提出的新特性,最后给出了iHash与已有的hash函数在性能上的对比实验结果。

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.