AES Arithmetic uses arithmetic in the finite field GF(28)
{"Image DocumentName": "AES Arithmetic uses arithmetic in the finite field GF(28)", "Image ImageDescription": "with irreducible polynomial. m(x) = x8 + x4 + x3 + x + 1. which is ( ) or {11b} e.g. {02} \u2022 {87} mod {11b} = ( ) mod {11b} = ( ) xor ( ) = ( ) AES uses arithmetic in the finite field GF(28), with the irreducible polynomial m(x) = x8 + x4 + x3 + x + 1. AES operates on 8-bit bytes. Addition of two bytes is defined as the bitwise XOR operation. Multiplication of two bytes is defined as multiplication in the finite field GF(28). In particular, multiplication of a value by x (i.e., by {02}) can be implemented as a 1-bit left shift followed by a conditional bitwise XOR with ( ) if the leftmost bit of the original value (prior to the shift) is 1.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}