A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Using carry-truncated addition to analyze add-rotate-xor hash algorithms
2013
Journal of Mathematical Cryptology
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 sensitivity. This metric
doi:10.1515/jmc-2012-0019
fatcat:bzly4y5vvvapboio5wp5a47ljm