-- Midterm 2 Review
Originally Posted By: aida
Christopher Cook
Kurt Anderson
Aida Khosroshahi
2. Briefly describe how one round of the Tiger hash function works.
The input X is padded to a multiple of 512 bits and written as X = (X_0, X_1, …, X_{n-1}), each X_i is 512 bits. Each F_m consists of 8 inner rounds. W is 512 bits and is written as W = (W_0, W_1, …, W_7), where each W_i is 64 bits. Each round takes a, b, c, and W_i as input and produces a, b, and c with the following equations:
c = c xor W_i
a = a-(S_0[c_0] xor S_1[c_2] xor S_2[c_4] xor s_3[c_6])
b = b+ (S_3[c_1] xor S_2[c_3] xor S_1[c_5] xor S_0[c_7])
b = b.m
where c_i is the ith byte of c and each S_i is an S-box mapping 8 bits to 64 bits.
'''Originally Posted By: aida'''
Christopher Cook<br>Kurt Anderson<br>Aida Khosroshahi<br><br>2. Briefly describe how one round of the Tiger hash function works.<br><br>The input X is padded to a multiple of 512 bits and written as X = (X_0, X_1, …, X_{n-1}), each X_i is 512 bits. Each F_m consists of 8 inner rounds. W is 512 bits and is written as W = (W_0, W_1, …, W_7), where each W_i is 64 bits. Each round takes a, b, c, and W_i as input and produces a, b, and c with the following equations:<br><br>c = c xor W_i<br>a = a-(S_0[c_0] xor S_1[c_2] xor S_2[c_4] xor s_3[c_6])<br>b = b+ (S_3[c_1] xor S_2[c_3] xor S_1[c_5] xor S_0[c_7])<br>b = b.m<br><br>where c_i is the ith byte of c and each S_i is an S-box mapping 8 bits to 64 bits.<br><br>