【摘要】 提出了一类基于三重分组链接的单向散列函数(HTBC),并论证了其安全性·HTBC算法的速度比常用单向散列函数(SHA和MD系列算法等)快·依赖性测试表明:HTBC算法是完备的;其雪崩效应度约为0·9993;其严格雪崩准则度约为0·992·频率测试表明,可以认为HTBC算法的输出服从均匀分布·二进制矩阵秩测试表明,可以认为HTBC算法的输出子序列间线性独立·Maurer通用统计测试表明,HTBC算法的信息压缩损耗不显著·连续(run)、频谱、非重叠字(non-overlappingtemplate)匹配、重叠字匹配、Lempel-Ziv压缩、线性复杂度、系列、近似熵、累积和、随机游程以及随机游程变量等测试结果都满足要求·由此说明,HTBC算法具有很好的伪随机性,这就从统计评估的角度验证了HTBC算法的安全性·更多还原

【Abstract】 A hash function based on triple-block chaining (HTBC) is put forward and its security is demonstrated. The speed of the HTBC algorithm is faster than that of hash functions in common use (SHA and MD family). The dependence test results accord with the demands. The HTBC algorithm is complete; its degree of avalanche effect is about 0.9993; its degree of strict avalanche criterion is 0.992 or so. The frequency test results indicate that the output generated by the HTBC algorithm has uniformity. The binary matrix rank test results indicate that it is linear independent among disjoint sub-matrices of the output. Maurer’s universal statistical test results show that the output could be significantly compressed without loss of information. The results of run test, spectral test, non-overlapping template matching test, overlapping template matching test, Lempel-Ziv compression test, linear complexity test, serial test, approximate entropy test, cumulative sums test, random excursions test, and random excursions variant test all fulfill the requirements. Therefore the output generated by the HTBC algorithm has good pseudo-randomness. Thus the security of the HTBC algorithm is verified by way of statistical evaluation.更多还原