Sections 5.1-5.4, Due September 29

Difficult: I found the key schedule algorithm particularly confusing, I would very much like an example of it. Most specifically, I am having trouble with the instance when i is a multiple of 4, the other instances actually are not so bad since they are just recursive. Also, the section never really explained the selection of the matrix used for MCT. Is there something special about that one, or could we use almost any 4X4 matrix with entries in GF(2^8)?

Reflective: The description of why the MC was left out in the final round made me laugh. They took almost a whole page justifying this decision, but all it really seems to boil down to is "one less step and it looks better". Really, I don't think it needs justification. I mean, this is a created system and leaving out the final MC doesn't complicate the procedure, so why should you justify yourself?