1. The SHA-1 Algorithm is unlike anything I've encountered in the course thus far. I thought DES was hard, but that was nothing! To get myself through the algorithm, I have to read it really slowly, often times reading and re-reading portions of it. I guess this means not so much that the algorithm is hard to understand, but more or less it is hard to follow. One thing that is on the back of my mind is the test and its relation to this algorithm. I'm just barely seeing it for the first time. I'm wondering how I'm going to be expected to show my understanding of the algorithm in a testing situation.
2. One point of interest are the values held by H[0], H[1], ... , H[4]. They all seem to be loosely related. Some are just the reverse of others, for example. Were these values chosen for a reason? Also, how do the specific values fit in to the actual algorithm?
No comments:
Post a Comment