Advanced Encryption Standard

The Advanced Encryption Standard (AES), also known by its original name Rijndael ( , ), is a specification for the encryption of electronic data established by the US National Institute of Standards and Technology (NIST) in 2001.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 6 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

The Advanced Encryption Standard (AES), also known by its original name Rijndael ( , ), is a specification for the encryption of electronic data established by the US National Institute of Standards and Technology (NIST) in 20011. AES is a variant of the Rijndael block cipher developed by two Belgian cryptographers, Joan Daemen and Vincent Rijmen, who submitted a proposal to NIST during the AES selection process.

Rijndael is a family of ciphers with different key and block sizes. For AES, NIST selected three members of the Rijndael family, each with a block size of 128 bits, but three different key lengths: 128, 192 and 256 bits. AES has been adopted by the US government.

It supersedes the Data Encryption Standard (DES), which was published in 19771. The algorithm described by AES is a symmetric-key algorithm, meaning the same key is used for both encrypting and decrypting the data. In the United States, AES was announced by the NIST as the US FIPS PUB 197 (FIPS 197) standard on November 26, 2001.

This announcement followed a five-year standardization process in which fifteen competing designs were presented and evaluated, before the Rijndael cipher was selected as the most suitable. AES is included in the ISO/IEC 18033-3 standard. AES became effective as a US federal government standard on May 26, 2002, after approval by US secretary of commerce Donald Evans.…

The Advanced Encryption Standard (AES), also known by its original name Rijndael ( , ), is a specification for the encryption of electronic data established by the US National Institute of Standards and Technology (NIST) in 2001. AES is a variant of the Rijndael block cipher developed by two Belgian cryptographers, Joan Daemen and Vincent Rijmen, who submitted a proposal to NIST during the AES selection process.

Rijndael is a family of ciphers with different key and block sizes. For AES, NIST selected three members of the Rijndael family, each with a block size of 128 bits, but three different key lengths: 128, 192 and 256 bits. AES has been adopted by the US government.

It supersedes the Data Encryption Standard (DES), which was published in 1977. The algorithm described by AES is a symmetric-key algorithm, meaning the same key is used for both encrypting and decrypting the data. In the United States, AES was announced by the NIST as the US FIPS PUB 197 (FIPS 197) standard on November 26, 2001.

This announcement followed a five-year standardization process in which fifteen competing designs were presented and evaluated, before the Rijndael cipher was selected as the most suitable. AES is included in the ISO/IEC 18033-3 standard. AES became effective as a US federal government standard on May 26, 2002, after approval by US secretary of commerce Donald Evans.

AES is available in many different encryption packages, and is the first (and only) publicly accessible cipher approved by the US National Security Agency (NSA) for top secret information when used in an NSA approved cryptographic module. \begin{bmatrix} b_0 & b_4 & b_8 & b_{12} \\ b_1 & b_5 & b_9 & b_{13} \\ b_2 & b_6 & b_{10} & b_{14} \\ b_3 & b_7 & b_{11} & b_{15} \end{bmatrix} The key size used for an AES cipher specifies the number of transformation rounds that convert the input, called the plaintext, into the final output, called the ciphertext. The number of rounds are as follows: 10 rounds for 128-bit keys; 12 rounds for 192-bit keys; 14 rounds for 256-bit keys.

Each round consists of several processing steps, including one that depends on the encryption key itself. A set of reverse rounds are applied to transform ciphertext back into the original plaintext using the same encryption key. \begin{bmatrix} b_{0,j} \\ b_{1,j} \\ b_{2,j} \\ b_{3,j} \end{bmatrix} = \begin{bmatrix} 2 & 3 & 1 & 1 \\ 1 & 2 & 3 & 1 \\ 1 & 1 & 2 & 3 \\ 3 & 1 & 1 & 2 \end{bmatrix} \begin{bmatrix} a_{0,j} \\ a_{1,j} \\ a_{2,j} \\ a_{3,j} \end{bmatrix} \qquad 0 \le j \le 3 Matrix multiplication is composed of multiplication and addition of the entries.

Entries are bytes treated as coefficients of polynomial of order . Addition is simply XOR. Multiplication is modulo irreducible polynomial .

If processed bit by bit, then, after shifting, a conditional XOR with 1B 16 should be performed if the shifted value is larger than FF 16 (overflow must be corrected by subtraction of generating polynomial). These are special cases of the usual multiplication in .

In more general sense, each column is treated as a polynomial over and is then multiplied modulo {01}_{16} \cdot z^4+{01}_{16} with a fixed polynomial The coefficients are displayed in their hexadecimal equivalent of the binary representation of bit polynomials from . The step can also be viewed as a multiplication by the shown particular MDS matrix in the finite field .

This process is described further in the article Rijndael MixColumns.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1373124302 under CC BY-SA 4.0; modifications have been made.

References

  1. ↩Wikipedia “Advanced Encryption Standard” revision 1373124302 · retrieved 2026-10-20 publication date (×2) · confidence 0.95 revision URL