Académique Documents
Professionnel Documents
Culture Documents
• It performs arithmetic operations like addition, multiplication, and division over the
finite field GF(2^8).
• A field allows addition, subtraction, multiplication, and division without leaving the
set.
• AES works with integers that fit into a fixed number of bits without wasted patterns.
• Z2^n, the set of integers fitting into n bits using modular arithmetic, is not a field.
• AES processes data blocks as matrices during each round, using substitutions and
permutations.
• AES encryption and decryption are reversible, but they are not identical.
• AES uses four different stages: Substitute Bytes, Shift Rows, Mix Columns, and
AddRoundKey.
5. S-Box Rationale:
• It has low input-output correlation and uses the multiplicative inverse for nonlinearity.
• Shift Rows transforms the State array by moving bytes within columns.
• Mix Columns ensures good mixing among the bytes and full dependence on input bits.
7. AddRoundKey Transformation:
• The AddRoundKey transformation involves XORing 128 bits of State with the round
key.
• The key expansion algorithm takes a 16-byte key and produces 176 bytes.
• AES exhibits the avalanche effect, where small changes in plaintext or key result in
significant changes in ciphertext.
• AES decryption is not identical to encryption but shares the key schedule.
• It requires two separate software or firmware modules for encryption and decryption.
• Byte-level operations and table lookups make AES suitable for hardware and software
implementations.