Hi, since I'm not getting any replies, I thought I might narrow down my question in hope for some answers or directions.
From ietf.org/rfc/rfc1321.txt,
Code:
The operation a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s)
I understand how to get most of the variables except s. The memo states the equation will rotate by s bit, but i do not know where is s derived from.
Code:
[ABCD 0 7 1] [DABC 1 12 2] [CDAB 2 17 3] [BCDA 3 22 4]
[ABCD 4 7 5] [DABC 5 12 6] [CDAB 6 17 7] [BCDA 7 22 8]
[ABCD 8 7 9] [DABC 9 12 10] [CDAB 10 17 11] [BCDA 11 22 12]
[ABCD 12 7 13] [DABC 13 12 14] [CDAB 14 17 15] [BCDA 15 22 16]
I also do not understand how are the numbers in these operation used. In
relation to the previous question, one thing I do know is that s only uses the middle number of these operations, that is 7, 12, 17, 22.
Code:
word A: 01 23 45 67
word B: 89 ab cd ef
word C: fe dc ba 98
word D: 76 54 32 10
Another thing I'm also curious about, although not of much importance, is the representation of the buffer. Some sites reverses the register before calculation, for example word a will be 67 45 23 01. I would like to know if there is a reason behind this or just a preferred way of calculating.
I hope someone might be able to help me with these questions or point me a direction. Thank you.