# Advanced Encryption Standard

The **Advanced Encryption Standard** (**AES**), also known by its original name **Rijndael** (オランダ語発音: [ˈrɛindaːl]),^{[1]} is a specification for the encryption of electronic data established by the U.S. National Institute of Standards and Technology (NIST) in 2001.^{[2]}

AES is a subset of the Rijndael block cipher^{[1]} developed by two Belgian cryptographers, Vincent Rijmen and Joan Daemen, who submitted a proposal^{[3]} to NIST during the AES selection process.^{[4]} 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 U.S. government and is now used worldwide. It supersedes the Data Encryption Standard (DES),^{[5]} 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 U.S. FIPS PUB 197 (FIPS 197) on November 26, 2001.^{[2]} 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 (see Advanced Encryption Standard process for more details).

AES became effective as a federal government standard on May 26, 2002, after approval by the Secretary of Commerce. AES is included in the ISO/IEC 18033-3 standard. AES is available in many different encryption packages, and is the first (and only) publicly accessible cipher approved by the National Security Agency (NSA) for top secret information when used in an NSA approved cryptographic module (see Security of AES, below).

## Contents

## Definitive standards

The Advanced Encryption Standard (AES) is defined in each of:

- FIPS PUB 197: Advanced Encryption Standard (AES)
^{[2]} - ISO/IEC 18033-3:: Block ciphers
^{[6]}

## Description of the ciphers

AES is based on a design principle known as a substitution–permutation network, and is efficient in both software and hardware.^{[7]} Unlike its predecessor DES, AES does not use a Feistel network. AES is a variant of Rijndael which has a fixed block size of 128 bits, and a key size of 128, 192, or 256 bits. By contrast, Rijndael *per se* is specified with block and key sizes that may be any multiple of 32 bits, with a minimum of 128 and a maximum of 256 bits.

AES operates on a 4 × 4 column-major order array of bytes, termed the *state*.^{[note 1]} Most AES calculations are done in a particular finite field.

For instance, if there are 16 bytes, [math]b_0, b_1, ..., b_{15}[/math], these bytes are represented as this two-dimensional array:

- [math] \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} [/math]

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.

### High-level description of the algorithm

- テンプレート:Mono—round keys are derived from the cipher key using Rijndael's key schedule. AES requires a separate 128-bit round key block for each round plus one more.
- Initial round key addition:
- テンプレート:Mono—each byte of the state is combined with a block of the round key using bitwise xor.

- 9, 11 or 13 rounds:
- テンプレート:Mono—a non-linear substitution step where each byte is replaced with another according to a lookup table.
- テンプレート:Mono—a transposition step where the last three rows of the state are shifted cyclically a certain number of steps.
- テンプレート:Mono—a linear mixing operation which operates on the columns of the state, combining the four bytes in each column.
- テンプレート:Mono

- Final round (making 10, 12 or 14 rounds in total):

### The テンプレート:Mono step

In the テンプレート:Mono step, each byte [math]a_{i,j}[/math] in the *state* array is replaced with a テンプレート:Mono [math]S(a_{i,j})[/math] using an 8-bit substitution box. This operation provides the non-linearity in the cipher. The S-box used is derived from the multiplicative inverse over GF(2^{8}), 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), i.e., [math] S(a_{i,j}) \neq a_{i,j} [/math], and also any opposite fixed points, i.e., [math] S(a_{i,j}) \oplus a_{i,j} \neq \text{FF}_{16} [/math].
While performing the decryption, the テンプレート:Mono step (the inverse of テンプレート:Mono) is used, which requires first taking the inverse of the affine transformation and then finding the multiplicative inverse.

### The テンプレート:Mono step

The テンプレート:Mono step operates on the rows of the state; it cyclically shifts the bytes in each row by a certain 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.^{[note 2]} In this way, each column of the output state of the テンプレート:Mono step is composed of bytes from each column of the input state. The importance of this step is to avoid the columns being encrypted independently, in which case AES degenerates into four independent block ciphers.

### The テンプレート:Mono step

In the テンプレート:Mono step, the four bytes of each column of the state are combined using an invertible linear transformation. The テンプレート:Mono function takes four bytes as input and outputs four bytes, where each input byte affects all four output bytes. Together with テンプレート:Mono, テンプレート:Mono provides diffusion in the cipher.

During this operation, each column is transformed using a fixed matrix (matrix left-multiplied by column gives new value of column in the state):

- [math] \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 [/math]

Matrix multiplication is composed of multiplication and addition of the entries. Entries are 8-bit bytes treated as coefficients of polynomial of order [math]x^7[/math]. Addition is simply XOR. Multiplication is modulo irreducible polynomial [math]x^8+x^4+x^3+x+1[/math]. 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 [math]\operatorname{GF}(2^8)[/math].

In more general sense, each column is treated as a polynomial over [math]\operatorname{GF}(2^8)[/math] and is then multiplied modulo [math]{01}_{16} \cdot z^4+{01}_{16}[/math] with a fixed polynomial [math]c(z) = {03}_{16} \cdot z^3 + {01}_{16} \cdot z^2 +{01}_{16} \cdot z + {02}_{16}[/math]. The coefficients are displayed in their hexadecimal equivalent of the binary representation of bit polynomials from [math]\operatorname{GF}(2)[x][/math]. The テンプレート:Mono step can also be viewed as a multiplication by the shown particular MDS matrix in the finite field [math]\operatorname{GF}(2^8)[/math]. This process is described further in the article Rijndael MixColumns.

### The テンプレート:Mono step

In the テンプレート:Mono step, the subkey is combined with the state. For each round, a subkey is derived from the main key using 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 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 the テンプレート:Mono and テンプレート:Mono steps with the テンプレート:Mono step by transforming them into a sequence of table lookups. This requires four 256-entry 32-bit tables (together occupying 4096 bytes). A round can then be performed with 16 table lookup operations and 12 32-bit exclusive-or operations, followed by four 32-bit exclusive-or operations in the テンプレート:Mono step.^{[8]} Alternatively, the table lookup operation can be performed with a single 256-entry 32-bit table (occupying 1024 bytes) followed by circular rotation operations.

Using a byte-oriented approach, it is possible to combine the テンプレート:Mono, テンプレート:Mono, and テンプレート:Mono steps into a single round operation.^{[9]}

## Security

Until May 2009, the only successful published attacks against the full AES were side-channel attacks on some specific implementations. The National Security Agency (NSA) reviewed all the AES finalists, including Rijndael, and stated that all of them were secure enough for U.S. Government non-classified data. In June 2003, the U.S. Government announced that AES could be used to protect 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.

^{[10]}

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.^{[11]}

### Known attacks

For cryptographers, a cryptographic "break" is anything faster than a brute-force attack – i.e., performing one trial decryption for each possible key in sequence (see Cryptanalysis). A break can thus include results that are infeasible with current technology. Despite being impractical, theoretical breaks can sometimes provide insight into vulnerability patterns. The largest successful publicly known brute-force attack against a widely implemented block-cipher encryption algorithm was against a 64-bit RC5 key by distributed.net in 2006.^{[12]}

The key space increases by a factor of 2 for each additional bit of key length, and if every possible value of the key is equiprobable, this translates into a doubling of the average brute-force key search time. This implies that the effort of a brute-force search increases exponentially with key length. Key length in itself does not imply security against attacks, since there are ciphers with very long keys that have been found to be vulnerable.

AES has a fairly simple algebraic framework.^{[13]} In 2002, a theoretical attack, named the "XSL attack", was announced by Nicolas Courtois and Josef Pieprzyk, purporting to show a weakness in the AES algorithm, partially due to the low complexity of its nonlinear components.^{[14]} Since then, other papers have shown that the attack, as originally presented, is unworkable; see XSL attack on block ciphers.

During the AES selection process, developers of competing algorithms wrote of Rijndael's algorithm "...we are concerned about [its] use ... in security-critical applications."^{[15]} In October 2000, however, at the end of the AES selection process, Bruce Schneier, a developer of the competing algorithm Twofish, wrote that while he thought successful academic attacks on Rijndael would be developed someday, he did not "believe that anyone will ever discover an attack that will allow someone to read Rijndael traffic".^{[16]}

In 2009, a new related-key attack was discovered that exploits the simplicity of AES's key schedule and has a complexity of 2^{119}. In December 2009 it was improved to 2^{99.5}.^{[17]} This is a follow-up to an attack discovered earlier in 2009 by Alex Biryukov, Dmitry Khovratovich, and Ivica Nikolić, with a complexity of 2^{96} for one out of every 2^{35} keys.^{[18]} However, related-key attacks are not of concern in any properly designed cryptographic protocol, as a properly designed protocol (i.e., implementational software) will take care not to allow related keys, essentially by constraining an attacker's means of selecting keys for relatedness.

Another attack was blogged by Bruce Schneier^{[19]}
on July 30, 2009, and released as a preprint^{[20]}
on August 3, 2009. This new attack, by Alex Biryukov, Orr Dunkelman, Nathan Keller, Dmitry Khovratovich, and Adi Shamir, is against AES-256 that uses only two related keys and 2^{39} time to recover the complete 256-bit key of a 9-round version, or 2^{45} time for a 10-round version with a stronger type of related subkey attack, or 2^{70} time for an 11-round version. 256-bit AES uses 14 rounds, so these attacks aren't effective against full AES.

The practicality of these attacks with stronger related keys has been criticized,^{[21]} for instance, by the paper on "chosen-key-relations-in-the-middle" attacks on AES-128 authored by Vincent Rijmen in 2010.^{[22]}

In November 2009, the first known-key distinguishing attack against a reduced 8-round version of AES-128 was released as a preprint.^{[23]}
This known-key distinguishing attack is an improvement of the rebound, or the start-from-the-middle attack, against AES-like permutations, which view two consecutive rounds of permutation as the application of a so-called Super-Sbox. It works on the 8-round version of AES-128, with a time complexity of 2^{48}, and a memory complexity of 2^{32}. 128-bit AES uses 10 rounds, so this attack isn't effective against full AES-128.

The first key-recovery attacks on full AES were due to Andrey Bogdanov, Dmitry Khovratovich, and Christian Rechberger, and were published in 2011.^{[24]} The attack is a biclique attack and is faster than brute force by a factor of about four. It requires 2^{126.2} operations to recover an AES-128 key. For AES-192 and AES-256, 2^{190.2} and 2^{254.6} operations are needed, respectively. This result has been further improved to 2^{126.0} for AES-128, 2^{189.9} for AES-192 and 2^{254.3} for AES-256,^{[25]} which are the current best results in key recovery attack against AES.

This is a very small gain, as a 126-bit key (instead of 128-bits) would still take billions of years to brute force on current and foreseeable hardware. Also, the authors calculate the best attack using their technique on AES with a 128 bit key requires storing 2^{88} bits of data. That works out to about 38 trillion terabytes of data, which is more than all the data stored on all the computers on the planet in 2016. As such, there are no practical implications on AES security.^{[26]} The space complexity has later been improved to 2^{56} bits,^{[25]} which is 9007 terabytes.

According to the Snowden documents, the NSA is doing research on whether a cryptographic attack based on tau statistic may help to break AES.^{[27]}

At present, there is no known practical attack that would allow someone without knowledge of the key to read data encrypted by AES when correctly implemented.

### Side-channel attacks

Side-channel attacks do not attack the cipher as a black box, and thus are not related to cipher security as defined in the classical context, but are important in practice. They attack implementations of the cipher on hardware or software systems that inadvertently leak data. There are several such known attacks on various implementations of AES.

In April 2005, D.J. Bernstein announced a cache-timing attack that he used to break a custom server that used OpenSSL's AES encryption.^{[28]} The attack required over 200 million chosen plaintexts.^{[29]} The custom server was designed to give out as much timing information as possible (the server reports back the number of machine cycles taken by the encryption operation); however, as Bernstein pointed out, "reducing the precision of the server's timestamps, or eliminating them from the server's responses, does not stop the attack: the client simply uses round-trip timings based on its local clock, and compensates for the increased noise by averaging over a larger number of samples."^{[28]}

In October 2005, Dag Arne Osvik, Adi Shamir and Eran Tromer presented a paper demonstrating several cache-timing attacks against the implementations in AES found in OpenSSL and Linux's `dm-crypt`

partition encryption function.^{[30]} 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 or platform that is performing AES.

In December 2009 an attack on some hardware implementations was published that used differential fault analysis and allows recovery of a key with a complexity of 2^{32}.^{[31]}

In November 2010 Endre Bangerter, David Gullasch and Stephan Krenn published a paper which described a practical approach to a "near real time" recovery of secret keys from AES-128 without the need for either cipher text or plaintext. The approach also works on AES-128 implementations that use compression tables, such as OpenSSL.^{[32]} Like some earlier attacks this one requires the ability to run unprivileged code on the system performing the AES encryption, which may be achieved by malware infection far more easily than commandeering the root account.^{[33]}

In March 2016, Ashokkumar C., Ravi Prakash Giri and Bernard Menezes presented a very efficient side-channel attack on AES implementations that can recover the complete 128-bit AES key in just 6–7 blocks of plaintext/ciphertext which is a substantial improvement over previous works that require between 100 and a million encryptions.^{[34]} The proposed attack requires standard user privilege as previous attacks and key-retrieval algorithms run under a minute.

Many modern CPUs have built-in hardware instructions for AES, which would protect against timing-related side-channel attacks.^{[35]}^{[36]}

## NIST/CSEC validation

The 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 cryptographic modules validated to NIST FIPS 140-2 is required by the United States Government for encryption of all data that has a classification of Sensitive but Unclassified (SBU) or above. From NSTISSP #11, National Policy Governing the Acquisition of Information Assurance: "Encryption products for protecting classified information will be certified by NSA, and encryption products intended for protecting sensitive information will be certified in accordance with NIST FIPS 140-2."^{[37]}

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 Triple DES 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.

The Cryptographic Algorithm Validation Program (CAVP)^{[38]} allows for independent validation of the correct implementation of the AES algorithm at a reasonable cost. Successful validation results in being listed on the NIST validations page.^{[39]} This testing is a pre-requisite for the FIPS 140-2 module validation described below. However, successful CAVP validation in no way implies that the cryptographic module implementing the algorithm is secure. A cryptographic module lacking FIPS 140-2 validation or specific approval by the NSA is not deemed secure by the US Government and cannot be used to protect government data.^{[37]}

FIPS 140-2 validation is challenging to achieve both technically and fiscally.^{[40]} There is a standardized battery of tests as well as an element of source code review that must be passed over a period of a few weeks. The cost to perform these tests through an approved laboratory can be significant (e.g., well over $30,000 US)^{[40]} and does not include the time it takes to write, test, document and prepare a module for validation. After validation, modules must be re-submitted and re-evaluated if they are changed in any way. This can vary from simple paperwork updates if the security functionality did not change to a more substantial set of re-testing if the security functionality was impacted by the change.

## Test vectors

Test vectors are a set of known ciphers for a given input and key. NIST distributes the reference of AES test vectors as AES Known Answer Test (KAT) Vectors.^{[note 3]}

## Performance

High speed and low RAM requirements were criteria of the AES selection process. As the chosen algorithm, AES performed well on a wide variety of hardware, from 8-bit smart cards to high-performance computers.

On a Pentium Pro, AES encryption requires 18 clock cycles per byte,^{[41]} equivalent to a throughput of about 11 Mbit/s for a 200 MHz processor. On a 1.7 GHz Pentium M throughput is about 60 Mbit/s.

On Intel Core i3/i5/i7 and AMD Ryzen CPUs supporting AES-NI instruction set extensions, throughput can be multiple GB/s (even over 10 GB/s).^{[42]}

## Implementations

## See also

- Disk encryption
- Network encryption
- Whirlpool – hash function created by Vincent Rijmen and Paulo S. L. M. Barreto

## Notes

- ↑ Large-block variants of Rijndael use an array with additional columns, but always four rows.
- ↑ Rijndael variants with a larger block size have slightly different offsets. For blocks of sizes 128 bits and 192 bits, the shifting pattern is the same. Row [math]n[/math] is shifted left circular by [math]n-1[/math] bytes. For a 256-bit block, the first row is unchanged and the shifting for the second, third and fourth row is 1 byte, 3 bytes and 4 bytes respectively—this change only applies for the Rijndael cipher when used with a 256-bit block, as AES does not use 256-bit blocks.
- ↑ The AES Known Answer Test (KAT) Vectors are available in Zip format within the NIST site here

## References

- ↑
^{1.0}^{1.1}“AES Proposal: Rijndael”. National Institute of Standards and Technology. p. 1 (2003年3月9日). 2013年3月5日時点のオリジナルよりアーカイブ。. 21 February 2013閲覧. - ↑
^{2.0}^{2.1}^{2.2}“Announcing the ADVANCED ENCRYPTION STANDARD (AES)”.*Federal Information Processing Standards Publication 197*. United States National Institute of Standards and Technology (NIST) (2001年11月26日). 2017年3月12日時点のオリジナルよりアーカイブ。. October 2, 2012閲覧. - ↑ Joan Daemen and Vincent Rijmen (1999年9月3日). “AES Proposal: Rijndael”. 2007年2月3日時点のオリジナルよりアーカイブ。
**Template:Cite webの呼び出しエラー：引数****accessdate**は必須です。 - ↑ John Schwartz (2000年10月3日). “U.S. Selects a New Encryption Technique”.
*New York Times*. オリジナルの2017年3月28日時点によるアーカイブ。 - ↑ Westlund, Harold B. (2002年). “NIST reports measurable success of Advanced Encryption Standard”.
*Journal of Research of the National Institute of Standards and Technology*. オリジナルの2007年11月3日時点によるアーカイブ。 - ↑ “ISO/IEC 18033-3: Information technology – Security techniques – Encryption algorithms – Part 3: Block ciphers”. 2013年12月3日時点のオリジナルよりアーカイブ。
**Template:Cite webの呼び出しエラー：引数****accessdate**は必須です。 - ↑ Bruce Schneier (2000年5月). “The Twofish Team's Final Comments on AES Selection”. 2010年1月2日時点のオリジナルよりアーカイブ。
**Template:Cite webの呼び出しエラー：引数****accessdate**は必須です。 - ↑ "Efficient software implementation of AES on 32-bit platforms". Lecture Notes in Computer Science: 2523. 2003
- ↑ “byte-oriented-aes – A public domain byte-oriented implementation of AES in C – Google Project Hosting”. 2013年7月20日時点のオリジナルよりアーカイブ。. 2012閲覧.
- ↑ Lynn Hathaway (2003年6月). “National Policy on the Use of the Advanced Encryption Standard (AES) to Protect National Security Systems and National Security Information”. 2010年11月6日時点のオリジナルよりアーカイブ。. 2011閲覧.
- ↑ John Kelsey, Stefan Lucks, Bruce Schneier, Mike Stay, David Wagner, and Doug Whiting,
*Improved Cryptanalysis of Rijndael*, Fast Software Encryption, 2000 pp213–230 “Academic: Improved Cryptanalysis of Rijndael - Schneier on Security”. 2007年2月23日時点のオリジナルよりアーカイブ。. 2007閲覧. - ↑ “Is encryption really crackable?”. Ziff-Davis (2006年4月30日). 2010年8月7日時点のオリジナルよりアーカイブ。. August 7, 2010閲覧.
- ↑ “Sean Murphy”. University of London. 2009年1月31日時点のオリジナルよりアーカイブ。. 2008閲覧.
- ↑ Bruce Schneier. “AES News, Crypto-Gram Newsletter, September 15, 2002”. 2007年7月7日時点のオリジナルよりアーカイブ。. 2007閲覧.
- ↑
Niels Ferguson; Richard Schroeppel; Doug Whiting (2001). “A simple algebraic representation of Rijndael” (PDF/PostScript).
*Proceedings of Selected Areas in Cryptography, 2001, Lecture Notes in Computer Science*. Springer-Verlag. pp. 103–111. オリジナルの4 November 2006時点によるアーカイブ。 . 2006閲覧. - ↑ Bruce Schneier, AES Announced , October 15, 2000
- ↑ 引用エラー: 無効な
`<ref>`

タグです。 「`relkey`

」という名前の引用句に対するテキストが指定されていません - ↑ (2009) “Distinguisher and Related-Key Attack on the Full AES-256”,
*Advances in Cryptology – CRYPTO 2009*, Lecture Notes in Computer Science. Springer Berlin / Heidelberg, 231–249. DOI:10.1007/978-3-642-03356-8_14. ISBN 978-3-642-03355-1. - ↑ Bruce Schneier (2009年7月30日). “Another New AES Attack”.
*Schneier on Security, A blog covering security and security technology*. 2009年10月5日時点のオリジナルよりアーカイブ。. 2010閲覧. - ↑ Alex Biryukov (2009年8月19日). “Key Recovery Attacks of Practical Complexity on AES Variants With Up To 10 Rounds”. 2010年1月28日時点のオリジナルよりアーカイブ。. 2010閲覧.
- ↑ Agren, Martin (2012).
*On Some Symmetric Lightweight Cryptographic Designs*. Dissertation, Lund University, 38–39. - ↑ Vincent Rijmen (2010).
*Practical-Titled Attack on AES-128 Using Chosen-Text Relations*. オリジナルの2010-07-02時点によるアーカイブ。 . - ↑ Henri Gilbert (2009年11月9日). “Super-Sbox Cryptanalysis: Improved Attacks for AES-like permutations”. 2010年6月4日時点のオリジナルよりアーカイブ。. 2010閲覧.
- ↑ Andrey Bogdanov (2011年). “Biclique Cryptanalysis of the Full AES”. 2012年9月5日時点のオリジナルよりアーカイブ。
**Template:Cite webの呼び出しエラー：引数****accessdate**は必須です。 - ↑
^{25.0}^{25.1}Biaoshuai Tao (2015).*Information Security and Privacy*, Lecture Notes in Computer Science, 39–56. DOI:10.1007/978-3-319-19962-7_3. ISBN 978-3-319-19961-0. - ↑ Jeffrey Goldberg (2011年8月18日). “AES Encryption isn't Cracked”. 2015年1月8日時点のオリジナルよりアーカイブ。. 30 December 2014閲覧.
- ↑ ((SPIEGEL ONLINE, Hamburg, Germany)) (2014年12月28日). “Inside the NSA's War on Internet Security”.
*SPIEGEL ONLINE*. オリジナルの2015年1月24日時点によるアーカイブ。 . 4 September 2015閲覧. - ↑
^{28.0}^{28.1}“Index of formal scientific papers”. Cr.yp.to. 2008年9月17日時点のオリジナルよりアーカイブ。. 2008閲覧. - ↑ Bruce Schneier. “AES Timing Attack”. 2007年2月12日時点のオリジナルよりアーカイブ。. 2007閲覧.
- ↑ Dag Arne Osvik; Adi Shamir; Eran Tromer (2005-11-20).
*Cache Attacks and Countermeasures: the Case of AES*. オリジナルの2006-06-19時点によるアーカイブ。 . 2008閲覧.. - ↑ Dhiman Saha; Debdeep Mukhopadhyay; Dipanwita RoyChowdhury.
*A Diagonal Fault Attack on the Advanced Encryption Standard*. オリジナルの22 December 2009時点によるアーカイブ。 . 2009閲覧.. - ↑ Endre Bangerter; David Gullasch; Stephan Krenn (2010).
*Cache Games – Bringing Access-Based Cache Attacks on AES to Practice*. オリジナルの2010-12-14時点によるアーカイブ。 . - ↑ “Breaking AES-128 in realtime, no ciphertext required | Hacker News”. News.ycombinator.com. 2011年10月3日時点のオリジナルよりアーカイブ。. 2012閲覧.
- ↑ (2016)
*2016 IEEE European Symposium on Security and Privacy (EuroS&P)*, 261–275. DOI:10.1109/EuroSP.2016.29. ISBN 978-1-5090-1751-5. - ↑ “Are AES x86 Cache Timing Attacks Still Feasible?”.
*cseweb.ucsd.edu*. 2017年8月9日時点のオリジナルよりアーカイブ。**Template:Cite webの呼び出しエラー：引数****accessdate**は必須です。 - ↑ “Archived copy”. 2013年3月31日時点のオリジナルよりアーカイブ。. 2017閲覧. Securing the Enterprise with Intel AES-NI
- ↑
^{37.0}^{37.1}“Archived copy”. 2012年4月21日時点のオリジナルよりアーカイブ。. 2012閲覧. - ↑ “NIST.gov – Computer Security Division – Computer Security Resource Center”. Csrc.nist.gov. 2013年1月2日時点のオリジナルよりアーカイブ。. 2012閲覧.
- ↑ “Validated FIPS 140-1 and FIPS 140-2 Cryptographic Modules”. 2014年12月26日時点のオリジナルよりアーカイブ。
**Template:Cite webの呼び出しエラー：引数****accessdate**は必須です。 - ↑
^{40.0}^{40.1}OpenSSL, openssl@openssl.org. “OpenSSL's Notes about FIPS certification”. Openssl.org. 2013年1月2日時点のオリジナルよりアーカイブ。. 2012閲覧. - ↑ “Performance Comparisons of the AES submissions” (1999年2月1日). 2011年6月22日時点のオリジナルよりアーカイブ。. 2010閲覧.
- ↑ “AMD Ryzen 7 1700X Review”.
**Template:Cite webの呼び出しエラー：引数****accessdate**は必須です。

- Courtois, Nicolas (2003). “Cryptanalysis of Block Ciphers with Overdefined Systems of Equations”,
*Advances in Cryptology — ASIACRYPT 2002: 8th International Conference on the Theory and Application of Cryptology and Information Security, Queenstown, New Zealand, December 1–5, 2002, Proceedings*. Springer, 268–287. ISBN 978-3-540-36178-7. - Daemen, Joan (2002).
*The Design of Rijndael: AES — The Advanced Encryption Standard*. Springer. ISBN 978-3-540-42580-9. - Paar, Christof (2009).
*Understanding Cryptography: A Textbook for Students and Practitioners*. Springer, 87–122. ISBN 978-3-642-04101-3. alternate link (companion web site contains online lectures on AES)

## External links

- “256bit key — 128bit block — AES”.
*Cryptography — 256 bit Ciphers: Reference source code and submissions to international cryptographic designs contests*. EmbeddedSW.**Template:Cite webの呼び出しエラー：引数****accessdate**は必須です。 - “Advanced Encryption Standard (AES)”.
*Federal Information Processing Standards*. (26 November 2001). doi:10.6028/NIST.FIPS.197. 197 . - AES algorithm archive information – (old, unmaintained)
- “Part 3: Block ciphers”.
*Information technology — Security techniques — Encryption algorithms*. ISO (2010年12月15日).**Template:Cite webの呼び出しエラー：引数****accessdate**は必須です。 - Animation of Rijndael – AES deeply explained and animated using Flash (by Enrique Zabala / University ORT / Montevideo / Uruguay). This animation (in English, Spanish, and German) is also part of CrypTool 1 (menu Indiv. Procedures -> Visualization of Algorithms -> AES).