基于链接与计数的分组密码认证模式

为了提高分组密码算法的工作效率,提出了一种基于链接与计数(chaining & counter)的快速认证模式(CCTR),并论证了其安全性.速度测试表明CCTR模式比常用认证模式(例如CBC-MAC)快30%左右.依赖性测试表明:CCTR模式是完备的;其雪崩效应度约为0.999 3;其严格雪崩准则度约为0.992.频率测试表明CCTR模式的输出服从均匀分布.二进制矩阵秩、动向(run)、频谱、非重叠字(non-overlapping template)匹配、重叠字匹配、Maurer通用统计、Lempel-Ziv压缩、线性复杂度、系列、近似熵、累积和、随机游程以及随机游程变量等测试结果都满足要求.由此说明,CCTR模式具有很好的伪随机性,这就从统计评估的角度验证了CCTR模式的安全性.

Chaining & counter-based block cipher mode for authentication

For raising the operation efficiency of block cipher algorithms, a fast authentication mode based on chaining & counter (CCTR) was put forward; and its security was proved. Its speed was about 30% faster than that of authentication modes in common use (for example, CBC-MAC). The dependence test results accord with the demands. The CCTR mode is complete; its degree of avalanche effect is about 0.999 3; its degree of strict avalanche criterion is 0.992 or so.The frequency test results indicate that the output generated by the CCTR mode had uniformity. The binary matrix rank, Run, spectral, non-overlapping template matching, overlapping template matching, Maurer's universal statistical test,Lempel-Ziv compression, linear complexity, serial, approximate entropy, cumulative sums, random excursions and ran-dom excursions variant tests results fulfilled the requirements all. Therefore, the CCTR mode has good pseudo-random-ness, which the security of CCTR mode is verified by way of statistical evaluation.