In less than a week after its release, the XORiguer algorithm was broken by its own developer. XORiguer, named after "xoriguer" because of the extensive use of the XOR function, was a research project about a hash implementation that did not seem to be studied. Since the XOR function is easily reversible, no matter how many inputs it has, an inverse algorithm can be constructed. Thus, XORiguer is not suitable for cryptography.

The 16-bit primitive function looks like this:

o0 = i0 ^ i2 ^ i8 ^ i15 ^ 1; o1 = i0 ^ i1 ^ i4 ^ i9; o2 = i1 ^ i2 ^ i5 ^ i11; o3 = i0 ^ i3 ^ i5 ^ i12; o4 = i2 ^ i3 ^ i4 ^ i13; o5 = i4 ^ i5 ^ i6 ^ i15; o6 = i1 ^ i3 ^ i6 ^ i8; o7 = i2 ^ i6 ^ i7 ^ i10; o8 = i4 ^ i7 ^ i8 ^ i12; o9 = i3 ^ i7 ^ i9 ^ i11 ^ i15; o10 = i5 ^ i8 ^ i9 ^ i10; o11 = i4 ^ i10 ^ i11 ^ i14; o12 = i6 ^ i9 ^ i12 ^ i14; o13 = i11 ^ i12 ^ i13; o14 = i0 ^ i7 ^ i13 ^ i14; o15 = i1 ^ i10 ^ i13 ^ i15;

Published: 2017-03-12 19:48