x²+x+1

x+1

x³+x+1

1

We will waste space on a computer that operates on multiples of 2 (e.g., 2¹⁶ or 2³²).

The algorithm cannot be made secure enough, even for large values of p.

Not all elements have a multiplicative inverse, hence we cannot do decryption.

It is not easy to generate a relatively secure prime number.

In AES the key size is always the same as block size.

AES operates using modular polynomial arithmetic over GF(2ⁿ).

AES s a non-feistel cipher.

Encrypting or decrypting a block in AES takes either 10, 12, or 14 rounds.

R27:R26

R29:R28

R31:R30

R1:R0

R25:R24

1110 0111 1100 0101

1110 0111 1011 0101

1110 0101 1101 0111

1110 1010 0111 0101