

























Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Document DescriptionThis technical manual provides an in-depth exploration of the Advanced Encryption Standard (AES), the symmetric-key block cipher adopted by the U.S. government. The content offers a rigorous breakdown of the Rijndael algorithm, specifically focusing on the 128-bit block size configuration. It details the essential mathematical foundations required to understand AES, including Galois Field $GF(2^8)$ arithmetic and the use of irreducible polynomials. The document meticulously explains the four distinct transformations performed in each round of encryption: the SubBytes step (non-linear byte substitution using an S-box), the ShiftRows transformation (transposition), the MixColumns stage (matrix multiplication for diffusion), and the AddRoundKey operation (XOR bitwise logic).
Typology: Lecture notes
1 / 33
This page cannot be seen from the preview
Don't miss anything!


























1 Slides taken from chapter 7 of “Cryptography and Network Security” by Behrouz Forouzan
Objectives ❏ To review a short history of AES ❏ To define the basic structure of AES ❏ To define the transformations used by AES ❏ To define the key expansion process
The criteria defined by NIST for selecting AES fall into three areas:
AES is a non-Feistel cipher that encrypts and decrypts a data block of 128 bits. It uses 10 , 12 , or 14 rounds. The key size, which can be 128 , 192 , or 256 bits, depends on the number of rounds But the round keys are always 128 bits.
Data units used in AES
Structure of Each Round
To provide security, AES uses four types of transformations: substitution, permutation, mixing, and key-adding. Substitution Permutation Mixing Key Adding Topics discussed in this section:
SubBytes transformation
Another transformation found in a round is shifting, which permutes the bytes. ShiftRows In the encryption, the transformation is called ShiftRows.
Figure shows how a state is transformed using ShiftRows transformation. The figure also shows that InvShiftRows transformation creates the original state.
The multiplication operation is defined as: Multiplication by 1 means no change, Multiplication by 2 means shifting to the left, a conditional XOR with 0 x 1 B ( 0001 1011 ) will be performed if the shifted value is larger than 0 xFF or in other words leftmost bit of original value is 1. Multiplication by 3 means shifting to the left, then performing conditional XOR with 0 x 1 B if required and then performing XOR with the initial unshifted value.