用进位截断加法分析加法-旋转-异或散列算法
Using carry-truncated addition to analyze add-rotate-xor hash algorithms
摘要:
我们引入了一种截断加法运算,它是对N位二进制数对进行插值,介于模2^N的普通加法和(Z/2 Z)^N中的按位加法之间。我们使用截断加法来分析由位操作add,rotate和xor构建的哈希函数,例如Blake,Skein和Cubehash。任何ARX算法都可以通过用截断加法代替普通加法来近似,我们定义了一个度量,我们称之为{ \bf灵敏度}。该度量度量在统计上有用的时间部分(我们使用0.1%)与完整算法一致的最小近似值。由于截断加法极大地降低了ARX算法中非线性运算的复杂度,近似算法更容易受到碰撞攻击和原像攻击,本文明确提出了一种潜在的碰撞攻击。我们将其中的一些观察具体化到Skein哈希函数。
英文摘要:
We introduce a truncated addition operation on pairs of N-bit binary numbers that interpolates between ordinary addition mod 2^N and bitwise addition in (Z/2Z)^N. We use truncated addition to analyze hash functions that are built from the bit operations add, rotate, and xor, such as Blake, Skein, and Cubehash. Any ARX algorithm can be approximated by replacing ordinary addition with truncated addition, and we define a metric on such algorithms which we call the {\bf sensitivity}. This metric measures the smallest approximation agreeing with the full algorithm a statistically useful portion of the time (we use 0.1%). Because truncated addition greatly reduces the complexity of the non-linear operation in ARX algorithms, the approximated algorithms are more susceptible to both collision and pre-image attacks, and we outline a potential collision attack explicitly. We particularize some of these observations to the Skein hash function.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。