{{Infobox block cipher
| name = AES
| image = [[Image:AES-SubBytes.svg|280px|center]]
| caption = The <tt>SubBytes</tt> step, one of four stages in a round of AES
| designers = [[Vincent Rijmen]], [[Joan Daemen]]
| publish date = [[1998]]
| derived from = [[Square (cipher)|Square]]
| derived to = [[Anubis (cipher)|Anubis]], [[Grand Cru (cipher)|Grand Cru]]
| related to =
| certification = [[Advanced Encryption Standard process|AES]] winner, [[CRYPTREC]], [[NESSIE]]
| key size = 128, 192 or 256 bits<ref name="keysize">Key sizes of 128, 160, 192, 224, and 256 bits are supported by the Rijndael algorithm, but only the 128, 192, and 256-bit key sizes are specified in the AES standard.</ref>
| block size = 128 bits<ref name="blocksize">Block sizes of 128, 160, 192, 224, and 256 bits are supported by the Rijndael algorithm, but only the 128-bit block size is specified in the AES standard.</ref>
| structure = [[Substitution-permutation network]]
| rounds = 10, 12 or 14 (depending on key size)
| cryptanalysis = A [[related-key attack]] can break up to 9 rounds of 256-bit AES. A [[chosen-plaintext attack]] can break 8 rounds of 192- and 256-bit AES, and 7 rounds of 128-bit AES. (Ferguson et al, 2000).
}}

In [[cryptography]], the '''Advanced Encryption Standard''' ('''AES'''), also known as '''Rijndael''', is a [[block cipher]] adopted as an [[encryption]] standard by the [[Federal government of the United States|U.S. government]]. It has been analyzed extensively and is now used widely worldwide as was the case with its predecessor,<ref>{{cite web |url=http://www.findarticles.com/p/articles/mi_m0IKZ/is_3_107?pnum=2&opg=90984479 |title=NIST reports measurable success of Advanced Encryption Standard}}</ref> the [[Data Encryption Standard]] (DES). AES was announced by [[National Institute of Standards and Technology]] (NIST) as U.S. [[Federal Information Processing Standard|FIPS]] PUB 197 (FIPS 197) on [[November 26]] [[2001]] after a 5-year standardization process (see [[Advanced Encryption Standard process]] for more details). It became effective as a standard [[May 26]], [[2002]]. As of [[2006]], AES is one of the most popular [[algorithm]]s used in [[symmetric key algorithm|symmetric key cryptography]]. It is available by choice in many different encryption packages.

The cipher was developed by two [[Belgium|Belgian]] cryptographers, [[Joan Daemen]] and [[Vincent Rijmen]], and submitted to the AES selection process under the name "Rijndael", a [[portmanteau]] of the names of the inventors. (Rijndael is {{pronounced|rɛindaːl}}, which sounds almost like "Rhine dahl").<ref>{{cite web |url=http://rijndael.info/audio/rijndael_pronunciation.wav |title='Rijndael' pronunciation}}</ref>

==Development==
Rijndael was a refinement of [[Square (cipher)|Square]], an earlier design by Daemen and Rijmen. Square was a development from [[Shark (cipher)|Shark]].

Unlike its predecessor DES, Rijndael is a [[substitution-permutation network]], not a [[Feistel network]]. AES is fast in both [[computer software|software]] and [[hardware]], is relatively easy to implement, and requires little [[computer memory|memory]]. As a new encryption standard, it is currently being deployed on a large scale.
<br clear="all">

==Description of the cipher==
Strictly speaking, AES is not precisely Rijndael (although in practice they are used interchangeably) as Rijndael supports a larger range of [[block size (cryptography)|block]] and [[key size]]s; AES has a fixed block size of 128 [[bit]]s and a key size of 128, 192, or 256 bits, whereas Rijndael can be specified with key and block sizes in any multiple of 32 bits, with a minimum of 128 bits and a maximum of 256 bits.

Due to the fixed block size of 128 bits, AES operates on a 4&times;4 array of [[byte]]s, termed the ''state'' (versions of Rijndael with a larger block size have additional columns in the state). Most AES calculations are done in a special [[Finite field arithmetic|finite field]].

=== High-level cipher algorithm ===

* KeyExpansion using [[Rijndael key schedule|Rijndael's key schedule]]
* Initial Round
** AddRoundKey
* Rounds
# <tt>SubBytes</tt> &mdash; a non-linear substitution step where each byte is replaced with another according to a [[Rijndael S-box|lookup table]].
# <tt>ShiftRows</tt> &mdash; a transposition step where each row of the state is shifted cyclically a certain number of steps.
# <tt>MixColumns</tt> &mdash; a mixing operation which operates on the columns of the state, combining the four bytes in each column
# <tt>AddRoundKey</tt> &mdash; each byte of the state is combined with the round key; each round key is derived from the cipher key using a [[key schedule]].
* Final Round (no <tt>MixColumns</tt>)
# <tt>SubBytes</tt>
# <tt>ShiftRows</tt>
# <tt>AddRoundKey</tt>

===The <tt>SubBytes</tt> step===
[[Image:AES-SubBytes.svg|right|320px|thumbnail|In the <tt>SubBytes</tt> step, each byte in the state is replaced with its entry in a fixed 8-bit lookup table, ''S''; ''b_ij'' = ''S(a_ij)''.]]
In the <tt>SubBytes</tt> step, each byte in the array is updated using an 8-bit [[substitution box]], the [[Rijndael S-box]]. This operation provides the non-linearity in the [[cipher]]. The S-box used is derived from the [[multiplicative inverse]] over '''[[Finite field|GF]]'''(''2⁸''), known to have good non-linearity properties. To avoid attacks based on simple algebraic properties, the S-box is constructed by combining the inverse function with an invertible [[affine transformation]]. The S-box is also chosen to avoid any fixed points (and so is a [[derangement]]), and also any opposite fixed points.

===The <tt>ShiftRows</tt> step===
[[Image:AES-ShiftRows.svg|right|320px|thumbnail|In the <tt>ShiftRows</tt> step, bytes in each row of the state are shifted cyclically to the left. The number of places each byte is shifted differs for each row.]]
The <tt>ShiftRows</tt> step operates on the rows of the state; it cyclically shifts the bytes in each row by a certain [[Offset (computer)|offset]]. For AES, the first row is left unchanged. Each byte of the second row is shifted one to the left. Similarly, the third and fourth rows are shifted by offsets of two and three respectively. For the block of size 128 bits and 192 bits the shifting pattern is the same. In this way, each column of the output state of the <tt>ShiftRows</tt> step is composed of bytes from each column of the input state. (Rijndael variants with a larger block size have slightly different offsets). In the case of the 256-bit block, the first row is unchanged and the shifting for second, third and fourth row is 1 byte, 3 byte and 4 byte respectively - although this change only applies for the Rijndael cipher when used with a 256-bit block, which is not used for AES.

===The <tt>MixColumns</tt> step===
[[Image:AES-MixColumns.svg|right|320px|thumbnail|In the <tt>MixColumns</tt> step, each column of the state is multiplied with a fixed polynomial ''c(x)''.]]
In the <tt>MixColumns</tt> step, the four bytes of each column of the state are combined using an invertible [[linear transformation]]. The <tt>MixColumns</tt> function takes four bytes as input and outputs four bytes, where each input byte affects all four output bytes. Together with <tt>ShiftRows</tt>, <tt>MixColumns</tt> provides [[diffusion (cryptography)|diffusion]] in the cipher. Each column is treated as a polynomial over '''GF'''(''2⁸'') and is then multiplied modulo <math>x^4+1</math> with a fixed polynomial <math>c(x) = 3x^3 + x^2 + x + 2</math>. The <tt>MixColumns</tt> step can also be viewed as a multiplication by a particular [[MDS matrix]] in [[Finite field arithmetic|Rijndael's finite field]].

This process is described further in the article [[Rijndael mix columns]].

===The <tt>AddRoundKey</tt> step===
[[Image:AES-AddRoundKey.svg|right|320px|thumbnail|In the <tt>AddRoundKey</tt> step, each byte of the state is combined with a byte of the round subkey using the [[Exclusive or|XOR]] operation (⊕).]]
In the <tt>AddRoundKey</tt> step, the subkey is combined with the state. For each round, a subkey is derived from the main [[key (cryptography)|key]] using [[Rijndael key schedule|Rijndael's key schedule]]; each subkey is the same size as the state. The subkey is added by combining each byte of the state with the corresponding byte of the subkey using bitwise [[Exclusive or|XOR]].

===Optimization of the cipher===
On systems with 32-bit or larger words, it is possible to speed up execution of this cipher by combining <tt>SubBytes</tt> and <tt>ShiftRows</tt> with <tt>MixColumns</tt>, and transforming them into a sequence of table lookups. This requires four 256-entry 32-bit tables, which utilizes a total of four [[kibibyte]]s (4096 bytes) of memory--a kibibyte for each table. A round can now be done with 16 table lookups and 12 32-bit exclusive-or operations, followed by four 32-bit exclusive-or operations in the <tt>AddRoundKey</tt> step.

If the resulting four kibibyte table size is too large for a given target platform, the table lookup operation can be performed with a single 256-entry 32-bit table by the use of circular rotates.

Using a byte-oriented approach it is possible to combine the <tt>SubBytes</tt>, <tt>ShiftRows</tt>, and <tt>MixColumns</tt> steps into a single round operation.

==Security==
As of 2006, the only successful attacks against AES have been [[side channel attack]]s. The [[National Security Agency]] (NSA) reviewed all the AES finalists, including Rijndael, and stated that all of them were secure enough for [[US Government]] non-classified data. In June 2003, the US Government announced that AES may be used for [[classified information]]:
:"''The design and strength of all key lengths of the AES algorithm (i.e., 128, 192 and 256) are sufficient to protect classified information up to the SECRET level. TOP SECRET information will require use of either the 192 or 256 key lengths. The implementation of AES in products intended to protect national security systems and/or information must be reviewed and certified by NSA prior to their acquisition and use.''"<ref>http://www.cnss.gov/Assets/pdf/cnssp_15_fs.pdf</ref>
This marks the first time that the public has had access to a cipher approved by NSA for encryption of TOP SECRET information. Many public products use 128-bit secret keys by default; it is possible that NSA suspects a fundamental weakness in keys this short, or they may simply prefer a safety margin for top secret documents (which may require security decades into the future).

The most common way to attack block ciphers is to try various attacks on versions of the cipher with a reduced number of rounds. AES has 10 rounds for 128-bit keys, 12 rounds for 192-bit keys, and 14 rounds for 256-bit keys. By 2006, the best known attacks were on 7 rounds for 128-bit keys, 8 rounds for 192-bit keys, and 9 rounds for 256-bit keys.<ref name=improved>[[John Kelsey (cryptanalyst)|John Kelsey]], [[Stefan Lucks]], [[Bruce Schneier]], [[Mike Stay]], [[David Wagner]], and [[Doug Whiting]], ''Improved Cryptanalysis of Rijndael'', [[Fast Software Encryption]], 2000 pp213&ndash;230 [http://www.schneier.com/paper-rijndael.html]</ref>

Some cryptographers worry about the security of AES. They feel that the margin between the number of rounds specified in the cipher and the best known attacks is too small for comfort. There is a risk that some way to improve such attacks might be found and then the cipher could be broken. In this meaning, a [[cryptanalysis|cryptographic]] "break" is anything faster than an [[brute force attack|exhaustive search]], thus an attack against a 128-bit-key AES requiring 'only' 2¹²⁰ operations (compared to 2¹²⁸ possible keys) would be considered a break even though it would be, at present, quite infeasible. In practical application, any break of AES which is only that 'good' would be irrelevant. At present, such concerns can be ignored. The largest successful publicly-known [[brute force attack]] has been against a 64-bit [[RC5]] key by [[distributed.net]].

Other debates centers around the [[mathematics|mathematical]] structure of AES. Unlike most other block ciphers, AES has a very neat [[algebra]]ic description.<ref>http://www.isg.rhul.ac.uk/~sean/</ref> This has not yet led to any attacks, but some researchers feel that basing a cipher on a new hardness assumption is risky. This has led Ferguson, Schroeppel, and Whiting to write, "...we are concerned about the use of Rijndael [AES] in security-critical applications."<ref name="rijndael-algebraic">
{{cite conference
| author = [[Niels Ferguson]], [[Richard Schroeppel]], Doug Whiting
| title = A simple algebraic representation of Rijndael
| booktitle = Proceedings of [[Selected Areas in Cryptography]], 2001, Lecture Notes in Computer Science
| pages = pp. 103&ndash;111
| publisher = [[Springer-Verlag]]
| date = 2001
| location =
| url =
| doi =
| format = [[PDF]]/[[PostScript]]
| accessdate = 2006-10-06
}}</ref>

In [[2002]], a theoretical attack, termed the "[[XSL attack]]", was announced by [[Nicolas Courtois]] and [[Josef Pieprzyk]], showing a potential weakness in the AES algorithm.<ref>{{cite web | url = http://www.schneier.com/crypto-gram-0209.html | title = AES News, Crypto-Gram Newsletter, September 15, 2002 | author = Bruce Schneier | accessdate = 2007-07-27}}</ref> Several cryptography experts have found problems in the underlying mathematics of the proposed attack, suggesting that the authors may have made a mistake in their estimates. Whether this line of attack can be made to work against AES remains an open question. At present, the XSL attack against AES appears speculative; it is unlikely that the current attack could be carried out in practice.

===Side channel attacks===
[[Side channel attack]]s do not attack the underlying cipher, but attack implementations of the cipher on systems which inadvertently leak data. There are several such known attacks on AES.

In April 2005, [[Daniel J. Bernstein|D.J. Bernstein]] announced a cache timing attack that he used to break a custom server that used [[OpenSSL]]'s AES encryption.<ref>http://cr.yp.to/papers.html#cachetiming</ref> The custom server was designed to give out as much timing information as possible, and the attack required over 200 million chosen plaintexts. Some say the attack is not practical over the internet with a distance of one or more hops;<ref>{{cite newsgroup | author = Louis Scheffer | id = 42620794@news.cadence.com | date = 2005-04-16 | newsgroup = sci.crypt | title = Re: Successful remote AES key extraction}}</ref> [[Bruce Schneier]] called the research a "nice timing attack."<ref>{{cite web | url = http://www.schneier.com/blog/archives/2005/05/aes_timing_atta_1.html | title = AES Timing Attack | author = Bruce Schneier | accessdate = 2007-03-17}}</ref>

In October 2005, Dag Arne Osvik, [[Adi Shamir]] and Eran Tromer presented a paper demonstrating several cache timing attacks against AES.<ref>http://www.wisdom.weizmann.ac.il/~tromer/papers/cache.pdf</ref> One attack was able to obtain an entire AES key after only 800 operations triggering encryptions, in a total of 65 milliseconds. This attack requires the attacker to be able to run programs on the same system that is performing AES.

==FIPS Validation==

The [[CMVP|Cryptographic Module Validation Program]] (CMVP) is operated jointly by the United States Government's [[National Institute of Standards and Technology]] (NIST) Computer Security Division and the [[Communications Security Establishment]] (CSE) of the Government of Canada. The use of validated cryptographic modules is required by the United States Government for all unclassified uses of cryptography. The Government of Canada also recommends the use of [[FIPS 140]] validated cryptographic modules in unclassified applications of its departments.

Although NIST publication 197 ("FIPS 197") is the unique document that covers the AES algorithm, vendors typically approach the CMVP under FIPS 140 and ask to have several algorithms (such as [[3DES]] or [[SHA1]]) validated at the same time. Therefore, it is rare to find cryptographic modules that are uniquely FIPS 197 validated and NIST itself does not generally take the time to list FIPS 197 validated modules separately on its public web site. Instead, FIPS 197 validation is typically just listed as an "FIPS approved: AES" notation (with a specific FIPS 197 certificate number) in the current list of FIPS 140 validated cryptographic modules.

FIPS validation is challenging to achieve both technically and fiscally. There is a standardized battery of tests as well as an element of source code review that must be passed over a period of several days. The cost to perform these tests through an approved laboratory can be significant (e.g., well over $10,000 US) and does not include the time it takes to write, test, document and prepare a module for validation. After validation, modules must be resubmitted and reevaluated if they are changed in any way.

==See also==
*[[Data Encryption Standard]] (DES; the standard AES replaces)
*[[Advanced Encryption Standard process]]

==Notes and references==
<!--See http://en.wikipedia.org/wiki/Wikipedia:Footnotes for an explanation of how to generate footnotes using the <ref(erences/)> tags-->
{{reflist}}
* Nicolas Courtois, Josef Pieprzyk, "Cryptanalysis of Block Ciphers with Overdefined Systems of Equations". pp267&ndash;287, [[ASIACRYPT]] 2002.
* Joan Daemen and Vincent Rijmen, "The Design of Rijndael: AES - The Advanced Encryption Standard." Springer-Verlag, 2002. ISBN 3-540-42580-2.

==External links==
* [http://www.iaik.tu-graz.ac.at/research/krypto/AES/old/%7Erijmen/rijndael/ The Rijndael Page (old version)]
* [http://www.iaik.tu-graz.ac.at/research/krypto/AES/ Literature survey on AES]
* [http://rijndael.info/audio/rijndael_pronunciation.wav Recordings of the pronunciation of "Rijndael"] (85 KB [[wav]] file)
* [http://csrc.nist.gov/encryption/aes/ The archive of the old official AES website]
* [http://www.csrc.nist.gov/publications/fips/fips197/fips-197.pdf FIPS PUB 197: the official AES standard] ([[Portable Document Format|PDF]] file)
<!-- The following is a dead link 2005/05/15
* [http://www.nstissc.gov/Assets/pdf/fact%20sheet.pdf The C.N.S.S. announcement regarding the use of AES for classified data] ([[Portable Document Format|PDF]] file)-->
* [http://www.quadibloc.com/crypto/co040401.htm John Savard's description of the AES algorithm]
* [http://www.cs.bc.edu/~straubin/cs381-05/blockciphers/rijndael_ingles2004.swf Animation of the 128-bit AES encryption process]
* [http://www.progressive-coding.com/tutorial.php?id=0 Very detailed AES tutorial with implementation in C]
* [http://aolradio.podcast.aol.com/sn/SN-125.mp3 Steve Gibson on AES] (30 M [[mp3]] file)

== Implementations ==
* [http://csrc.nist.gov/cryptval/140-1/140val-all.htm Current list of FIPS 140 validated cryptographic modules with validated AES implementations (hosted by NIST)] - Most of these involve a commercial implementation of AES algorithms. Look for "FIPS-approved algorithms" entry in the "Level / Description" column followed by "AES" and then a specific certificate number.
* [http://www.hoozi.com/Articles/AESEncryption.htm A simple commented implementation in C/C++ aimed at beginners]

=== C/ASM Library ===
* [http://www.lysator.liu.se/~nisse/nettle/ GPL-licensed Nettle library also includes an AES implementation]
* [http://xyssl.org/code/source/aes/ LGPL-licensed written in C]
* [http://geocities.com/malbrain/aestable_c.html A byte-oriented public domain in C]
* [http://fp.gladman.plus.com/cryptography_technology/rijndael/ BSD licensed from Brian Gladman]
* [http://cr.yp.to/mac.html Public-domain from D.J. Bernstein]
* [http://www.esat.kuleuven.ac.be/~rijmen/rijndael/rijndael-fst-3.0.zip Public domain C from Paulo Barreto]
* [http://www.efgh.com/software/rijndael.htm Public domain C from Philip J. Erdelsky]

=== C++ Library ===
* [http://www.cryptopp.com Crypto++] A comprehensive C++ semi-public-domain implementation of encryption and hash algorithms. FIPS validated
* [http://www.lomont.org/Software/Misc/AES/AES.php Chris Lomont's public-domain version of AES]

=== Java ===
* [[Bouncy castle (cryptography)|Bouncy Castle Crypto Library]]

=== JavaScript ===
* [http://code.google.com/p/clipperz Clipperz Crypto Library], includes an efficient implementation.
* [http://www.movable-type.co.uk/scripts/AES.html Direct implementation of standard] transparently coded, with counter mode of operation
* [http://www.cs.eku.edu/faculty/styer/460/Encrypt/JS-AES.html Calculator showing intermediate values]
* [http://www.hanewin.net/encrypt/aes/aes-test.htm Simple 128/192/256-bit AES with hexadecimal inputs]

=== Other Languages ===
* [http://www.dsplayer.de/dspweb/public_downloads/BTAES_0.3.zip Martin Offenwanger's GPL-licensed AES source code written in Delphi]
* [http://msdn.microsoft.com/msdnmag/issues/03/11/AES/ "Keep Your Data Secure with the New Advanced Encryption Standard"] A detailed explanation with C# implementation by [[James D. McCaffrey]].
* [http://www.phpclasses.org/browse/package/3650.html LGPL 128bit Implementation in PHP] (Registration required)
* [http://www.formaestudio.com/rijndaelinspector/ Rijndael Inspector] Program made in Flash to encrypt/decrypt using AES-128.

=== File Based Encryption ===
* [[OpenSSL]] includes AES cipher support as of version '''0.9.7''' and is dual-licensed under the terms of the OpenSSL License and the original SSLeay license. FIPS validated via IBM
* [http://ccrypt.sourceforge.net/ Peter Selingers ccrypt file encryption utility for UNIX, GPL-licensed]
* [[GNU Privacy Guard|GPG]], GPL-licensed, includes AES, AES-192, and AES-256 as options.

{{Crypto navbox | block}}

[[Category:Block ciphers]]
[[Category:Type 1 encryption algorithms]]
[[Category:Free ciphers]]
[[Category:Key management]]
[[Category:IEEE 802.11]]

[[af:Rijndael]]
[[cs:Advanced Encryption Standard]]
[[da:Advanced Encryption Standard]]
[[de:Advanced Encryption Standard]]
[[es:Advanced Encryption Standard]]
[[eo:AES (kriptado)]]
[[fr:Standard de chiffrement avancé]]
[[gl:Advanced Encryption Standard]]
[[ko:고급 암호 표준]]
[[id:AES]]
[[it:Advanced Encryption Standard]]
[[he:Advanced Encryption Standard]]
[[lt:AES]]
[[nl:Advanced Encryption Standard]]
[[ja:AES暗号]]
[[no:Advanced Encryption Standard]]
[[pl:AES]]
[[pt:AES]]
[[ru:Advanced Encryption Standard]]
[[fi:AES]]
[[sv:Advanced Encryption Standard]]
[[vi:AES (mã hóa)]]
[[tg:AES]]
[[tr:AES]]
[[zh:高级加密标准]]