Q18Information Security Systems

The Advanced Encryption Standard (AES) is a symmetric block cipher chosen by NIST in 2001 to replace DES, standardized as FIPS 197. It operates on fixed blocks of 128 bits and uses key sizes of 128, 192, or 256 bits, requiring 10, 12, or 14 rounds respectively. AES relies on a substitution-permutation network (SPN) structure, organizing the 128-bit block into a 4x4 state matrix of bytes, which is transformed round by round.

Initial Step

Before the main rounds begin, an initial AddRoundKey is applied, XOR-ing the plaintext state with the original cipher key.

Transformations in a Single Round

Each full round of AES (except the final round) consists of four distinct transformation stages:

• 1. SubBytes: A non-linear substitution step where each byte in the state is independently replaced with another byte using a fixed substitution box (S-box) derived from the multiplicative inverse over GF(2^8). This is the only non-linear operation in AES and provides confusion, resisting linear and differential cryptanalysis.
• 2. ShiftRows: A transposition step where row 0 of the state is left unchanged, row 1 is cyclically shifted left by 1 byte, row 2 by 2 bytes, and row 3 by 3 bytes. This spreads byte values across columns, providing inter-column diffusion.
• 3. MixColumns: Each column of the state is treated as a 4-term polynomial over GF(2^8) and multiplied by a fixed polynomial modulo x^4 + 1. This linear mixing operation ensures that a change in a single input byte affects all four bytes of the output column, providing strong diffusion. This step is omitted in the final round.
• 4. AddRoundKey: Each byte of the state is combined with a 128-bit round key using bitwise XOR. Round keys are derived from the original cipher key through the AES key schedule, which uses byte substitution, rotation, and round constants (Rcon) to generate a unique key for every round.

The final round omits the MixColumns stage so that encryption and decryption use structurally symmetric, invertible operations. Decryption applies the inverse transformations (InvSubBytes, InvShiftRows, InvMixColumns) in reverse order using the round keys in reverse sequence.

Security Significance

AES has no known practical cryptanalytic break; the best known attacks are only marginally faster than brute force and remain computationally infeasible. Unlike DES's Feistel structure, which processes only half the block per round, AES's SPN design transforms the entire state every round, giving faster diffusion and enabling efficient hardware implementations (AES-NI instructions), which is why it underpins TLS, disk encryption, and Wi-Fi security (WPA2/3) today.

Comparison with DES

AES was selected specifically to address DES's weaknesses. DES uses a 56-bit key, which is now trivially brute-forced with modern hardware in hours; AES supports 128, 192, or 256-bit keys, making brute force computationally infeasible even with massive distributed computing resources. DES's Feistel network only transforms half the block each round and relies on relatively small 6-to-4-bit S-boxes, whereas AES's substitution-permutation network transforms the full 128-bit state every round using an 8-bit S-box with strong algebraic properties, giving it faster and more thorough diffusion in fewer rounds. AES is also significantly faster in both software and hardware implementations, since its byte-oriented operations map naturally onto modern CPU word sizes, while DES's bit-level permutations are comparatively expensive to implement efficiently. These combined advantages are why NIST retired DES (and its stronger but slower variant, Triple DES) in favor of AES as the federal encryption standard in 2001.