1. The hard part for me is why RIjdaenl's technique has 9 bits in it. I was under the impression that it's a lot easier to store bits in factors of 2(i.e. 2^3 bits=byte, 2^6=64 bits, used in DES). Also how can that be represented by GF(2^8)?
2. I best liked this section as I was reading about XORing and division in groups. It reminded me of some of the material we covered in Math 371.
No comments:
Post a Comment