News for hackers. Stuff that matters.
Re:Visualizing Galois Fields by dlsym on Sunday May 20, 2012 @05:34AM (#3998386)
I think it was chosen because the addition of two elements in GF(2^8) with their binary representation is a XOR. Which is a really efficient operation.
Re:Visualizing Galois Fields by hendzen on Sunday May 20, 2012 @05:37AM (#3998391)
Yes, but this is true regardless of the irreducible polynomial used to form the field. My question is why that specific polynomial was chosen; was it an arbitrary choice or was there some reason?
Re:Visualizing Galois Fields by tomerv on Sunday May 20, 2012 @05:49AM (#3998403)
As the article mentions:

"That first one that worked (100011011) is the one used in AES"

i.e., the polynomial that was chosen for AES (x^8 + x^4 + x^3 + x + 1) is the minimal irreducible polynomial of degree 8 (minimal in the sense of the natural ordering of polynomials). I guess that could be a good reason (but I'm not sure it's _the_ reason).

Re:Visualizing Galois Fields by dlsym on Sunday May 20, 2012 @06:05AM (#3998416)
I feel nerd sniped... http://xkcd.com/356/