Scribd
Upload
23 views1 page

AES

The AES algorithm is a symmetric block cipher that encrypts data in 128-bit blocks using 128, 192, or 256-bit keys and performs multiple rounds of substitution, shifting rows, mixing columns, and adding round keys to produce the ciphertext.

Uploaded by

sdxfcgtvyiuioljhg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
23 views1 page

AES

The AES algorithm is a symmetric block cipher that encrypts data in 128-bit blocks using 128, 192, or 256-bit keys and performs multiple rounds of substitution, shifting rows, mixing columns, and adding round keys to produce the ciphertext.

Uploaded by

sdxfcgtvyiuioljhg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 1

The AES algorithm (also known as the Rijndael algorithm) is a symmetrical block

cipher algorithm that takes the plain text in blocks of 128 bits and converts them
to ciphertext using keys of 128, 192, and 256 bits. Since the AES algorithm is
considered secure, it is in the worldwide standard.

Encryption converts data (plain-text) to an unintelligible form called cipher-text,


while decryption converts this cipher-text back to the original plain-text.
Cryptographic keys of 128, 192, or 256 bits may be used by the AES algorithm to
encrypt and decrypt data in blocks of 128 bits.

The AES algorithm uses a substitution-permutation with multiple rounds to produce


ciphertext. The number of rounds depends on the key size being used. A 128-bit key
size dictates ten rounds, a 192-bit key size dictates 12 rounds, and a 256-bit key
size has 14 rounds. Each of these rounds requires a round key, but since only one
key is inputted into the algorithm, this key needs to be expanded to get keys for
each round, including round 0.

Each round in the algorithm consists of four steps.

1. Substitution of the bytes


In the first step, the bytes of the block text are substituted based on rules
dictated by predefined S-boxes (short for substitution boxes).

2. Shifting the rows


Next comes the permutation step. In this step, all rows except the first are
shifted by one, as shown below.

3. Mixing the columns


In the third step, the Hill cipher is used to jumble up the message more by mixing
the block's columns.

4. Adding the round key


In the final step, the message is XORed with the respective round key.

When done repeatedly, these steps ensure that the final ciphertext is secure.

You might also like