- Advanced Encryption Standard
Infobox block cipher
name = AES
caption = The SubBytes step, one of four stages in a round of AES
Vincent Rijmen, Joan Daemen
publish date = 1998
derived from = Square
derived to = Anubis, Grand Cru
related to =
certification = AES winner,
key size = 128, 192 or 256 bitsKey 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.]
block size = 128 bitsBlock 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.]
rounds = 10, 12 or 14 (depending on key size)
cryptanalysis = A
related-key attackcan break up to 9 rounds of 256-bit AES. A chosen-plaintext attackcan break 8 rounds of 192- and 256-bit AES, and 7 rounds of 128-bit AES. (Ferguson et al, 2000).
cryptography, the Advanced Encryption Standard (AES), also known as Rijndael, is a block cipheradopted as an encryptionstandard by the U.S. government. It has been analyzed extensively and is now used worldwide, as was the case with its predecessor, [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] the Data Encryption Standard(DES). AES was announced by National Institute of Standards and Technology(NIST) as U.S. FIPS PUB 197 (FIPS 197) on November 26, 2001 after a 5-year standardization process in which fifteen competing designs were presented and evaluated before Rijndael was selected as the most suitable (see Advanced Encryption Standard processfor more details). It became effective as a standard May 26, 2002. As of 2006, AES is one of the most popular algorithms used in symmetric key cryptography. It is available by choice in many different encryption packages. This marks the first time that the public has had access to a cipherapproved by NSA for top secretinformation (see Security of AES, below).
cipherwas developed by two Belgian cryptographers, Joan Daemenand 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). [cite web |url=http://rijndael.info/audio/rijndael_pronunciation.wav |title='Rijndael' pronunciation]
Unlike DES (the predecessor of AES), AES is a
substitution-permutation network, not a Feistel network. AES is fast in both software and hardware, is relatively easy to implement, and requires little memory. As a new encryption standard, it is currently being deployed on a large scale.
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 and
key sizes; AES has a fixed block size of 128 bits 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.
Since in computing 1 byte equals 8 bits, the fixed block size of 128 bits is normally 128 / 8 = 16
bytes. AES operates on a 4×4 array of bytes, 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.
cipheris specified in terms of repetitions of processing steps that are applied to make up rounds of keyed transformations between the input plain-text and the final output of cipher-text. A set of reverse rounds are applied to transform cipher-text back into the original plain-text using the same encryption key.
High-level cipher algorithm
* KeyExpansion using Rijndael's key schedule
* Initial Round
# SubBytes—a linear substitution step where each byte is replaced with another according to a lookup table.
# ShiftRows—a transposition step where each row of the state is shifted cyclically a certain number of steps.
# MixColumns—a mixing operation which operates on the columns of the state, combining the four bytes in each column
# AddRoundKey—each byte of the state is combined with the round key; each round key is derived from the cipher key using a
* Final Round (no MixColumns)
The SubBytes step
In the SubBytes 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 inverseover GF("28"), 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 ShiftRows step
The ShiftRows 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. 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 ShiftRows 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 bytes and 4 bytes respectively - although this change only applies for the Rijndael cipher when used with a 256-bit block, which is not used for AES.
The MixColumns step
In the MixColumns step, the four bytes of each column of the state are combined using an invertible
linear transformation. The MixColumns function takes four bytes as input and outputs four bytes, where each input byte affects all four output bytes. Together with ShiftRows, MixColumns provides diffusion in the cipher. Each column is treated as a polynomial over GF("28") and is then multiplied modulo with a fixed polynomial . The MixColumns step can also be viewed as a multiplication by a particular MDS matrixin Rijndael's finite field.
This process is described further in the article
Rijndael mix columns.
The AddRoundKey step
In the AddRoundKey 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 SubBytes and ShiftRows with MixColumns, and transforming them into a sequence of table lookups. This requires four 256-entry 32-bit tables, which utilizes a total of four kilobytes (4096 bytes) of memory—one kilobyte 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 AddRoundKey step.
If the resulting four kilobyte 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 SubBytes, ShiftRows, and MixColumns steps into a single round operation.
ecurity of AES
As of 2006, the only successful attacks against AES implementations have been
side-channel attacks. The National Security Agency(NSA) reviewed all the AES finalists, including Rijndael, and stated that all of them were secure enough for US Governmentnon-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." [ [http://www.cnss.gov/Assets/pdf/cnssp_15_fs.pdf National Policy on the Use of the Advanced Encryption Standard (AES) to Protect National Security Systems and National Se ] ]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.John Kelsey,
Stefan Lucks, Bruce Schneier, Mike Stay, David Wagner, and Doug Whiting, "Improved Cryptanalysis of Rijndael", Fast Software Encryption, 2000 pp213–230 [http://www.schneier.com/paper-rijndael.html] ]
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 cryptographic "break" is anything faster than an exhaustive search, thus an attack against a 128-bit-key AES requiring 'only' 2120 operations (compared to 2128 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 attackhas been against a 64-bit RC5key by distributed.net.
Other debates center around the mathematical structure of AES. Unlike most other block ciphers, AES has a very neat
algebraic description. [ [http://www.isg.rhul.ac.uk/~sean/ Sean Murphy ] ] 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."cite conference
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–111
date = 2001
url = http://www.macfergus.com/pub/rdalgeq.html
accessdate = 2006-10-06]
In 2002, a theoretical attack, termed the "
XSL attack", was announced by Nicolas Courtoisand Josef Pieprzyk, showing a potential weakness in the AES algorithm. [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] 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.
ide channel attacks
Side channel attacks do not attack the underlying cipher and so have nothing to do with its security as described here, but attack implementations of the cipher on systems which inadvertently leak data. There are several such known attacks on certain 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. [http://cr.yp.to/papers.html#cachetiming] 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), 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; [cite newsgroup | author = Louis Scheffer | id = email@example.com | date = 2005-04-16 | newsgroup = sci.crypt | title = Re: Successful remote AES key extraction |url=http://groups.google.com/group/sci.crypt/msg/40d0f6fb6143de1a ] Bruce Schneiercalled the research a "nice timing attack." [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]
In October 2005, Dag Arne Osvik,
Adi Shamirand Eran Tromer presented a paper demonstrating several cache timing attacks against AES. [http://www.wisdom.weizmann.ac.il/~tromer/papers/cache.pdf] 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.
Tadayoshi Kohno wrote a paper entitled "Attacking and Repairing the WinZip Encryption Scheme" [http://www.cs.washington.edu/homes/yoshi/papers/WinZip/winzip.pdf] showing possible attacks against the
WinZipimplementation (the zip archive's metadata isn't encrypted).
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 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 140validated 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.
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.
Test Vectors are a set of known ciphers for a given input and Key. For example for a 128-bit key "00010203050607080A0B0C0D0F101112" (16 Bytes represented as two
hexadecimalcharacters per byte), and an input "506812A45F08C889B97F5980038B8359" the cipher should be "D8F532538289EF7D06B506A4FD5BE9C9".
Rijndael is free for any use public or private, commercial or non-commercial. The authors of Rijndael used to provide a homepage [ [http://www.esat.kuleuven.ac.be/~rijmen/rijndael Original homepage] and [http://web.archive.org/web/20070503005400rn_1/homes.esat.kuleuven.be/~rijmen/rijndael/ archived copy] ] for the algorithm. Care should be taken when implementing AES in software. Like most encryption algorithms, Rijndael was designed on big-endian systems. For this reason, little-endian systems return correct test vector results only through considerable byte-swapping, with efficiency reduced as a result.
The algorithm operates on plaintext blocks of 16 bytes. Encryption of shorter blocks is possible only by
paddingthe source bytes, usually with null bytes. This can be accomplished via several methods, the simplest of which assumes that the final byte of the cipher identifies the number of Null bytes of padding added.
Careful choice must be made in selecting the mode of operation of the cipher. The simplest mode encrypts and decrypts each 128-bit block separately. This mode, called "electronic code book (ECB)", blocks that are identical will be encrypted identically. This will make some of the plaintext structure visible in the ciphertext. Selecting other modes, such as empressing a sequential counter over the block prior to encryption (CTR mode) and removing it after decryption avoids this problem.
* [http://csrc.nist.gov/groups/STM/cavp/documents/aes/aesval.html Current list of FIPS 197 validated cryptographic modules (hosted by NIST)]
* [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.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://www.literatecode.com/2007/11/11/aes256/ A compact byte-oriented AES-256 implementation (C, OpenBSD license)]
* [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.efgh.com/software/rijndael.htm Public domain C from Philip J. Erdelsky]
Cryptographic Application Programming Interfaceor CAPI, Microsoft's Cryptography API
* [http://www.hoozi.com/Articles/AESEncryption.htm A simple commented implementation in C/C++ aimed at beginners]
Botanhas implemented Rijndael since its very first release in 2001
* [http://sourceforge.net/projects/cryptopp/ 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 version of AES under the zlib License]
* [http://msdn2.microsoft.com/en-us/magazine/cc164055.aspx "Keep Your Data Secure with the New Advanced Encryption Standard"] A detailed explanation with C# implementation by
James D. McCaffrey.
* As of version 3.5 of the
.NET Framework, the [http://msdn.microsoft.com/en-us/library/system.security.cryptography.aspx System.Security.Cryptography] namespace contains both a [http://msdn.microsoft.com/en-us/library/system.security.cryptography.aesmanaged.aspx fully managed] implementation of AES and a [http://msdn.microsoft.com/en-us/library/system.security.cryptography.aescryptoserviceprovider.aspx managed wrapper] around the CAPI AES implementation.
* Bouncy Castle Crypto Library
Java Cryptography Extension, integrated in the Java Runtime Environment since version 1.4.2 (see [http://java.sun.com/developer/technicalArticles/Security/AES/AES_v1.html example code] )
* Bouncy Castle Crypto Library
* [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://people.eku.edu/styere/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]
* [http://www.dsplayer.de/dspweb/public_downloads/BTAES_0.3.zip Martin Offenwanger's GPL-licensed AES source code written in Delphi]
* [http://bouchez.info/delphi-crypto.html Arnaud Bouchez's another AES source code written in Delphi]
* David Barton's implementation in Delphi, as part of a suite of hashes and ciphers called [http://www.cityinthesky.co.uk/cryptography.html DCPcrypt] : OIS-Certified open source
* [http://method-combination.net/lisp/ironclad/ ironclad] , Common Lisp cryptography library.
* [http://folk.uio.no/jornv/aes/aes.html Common Lisp AES implementations] using 8 and 32 bits arithmetic.
* [http://josefsson.org/aes/ Emacs Lisp]
* [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.
* [http://www.codearchive.com/dl.php?dlid=1517 AES CryptText] A VB5/6 Source-Code (cls) implementation of the AES-Rijndael Block Cipher.
* [http://search.cpan.org/~bdfoy/Crypt-Rijndael/Rijndael.pm Crypt::Rijndael] for Perl
Archive and compression tools
OpenSSLincludes AES cipher support as of version 0.9.7 (released in 2002) 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]
* GPG, GPL-licensed, includes AES, AES-192, and AES-256 as options.
* [http://www.wizards-toolkit.org/ The Wizard's Toolkit, ImageMagick license]
* [http://www.smartftp.com/support/kb/file-encryption-f2605.html/ SmartFTP's AES CTR Encryption Tool, Free]
IronKeyUses AES Encrypton
Cold Boot Attack
Full Disk Encryption
Data Encryption Standard(DES) - AES has replaced this standard
Triple DES- AES has replaced this standard
Advanced Encryption Standard process
*Whirlpool - hash function also co-created by Vincent Rijmen
* Nicolas Courtois, Josef Pieprzyk, "Cryptanalysis of Block Ciphers with Overdefined Systems of Equations". pp267–287,
* Joan Daemen and Vincent Rijmen, "The Design of Rijndael: AES - The Advanced Encryption Standard." Springer-Verlag, 2002. ISBN 3-540-42580-2.
* [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://www.hardware-ciphers.com/en/aes/ Survey on 78 different implementations of AES in FPGA and ASIC hardware technologies]
* [http://rijndael.info/audio/rijndael_pronunciation.wav Recordings of the pronunciation of "Rijndael"] (85 KB
* [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] (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.formaestudio.com/rijndaelinspector/ AES animation v.4]
* [http://www.progressive-coding.com/tutorial.php?id=0 Very detailed AES tutorial with implementation in C]
* [http://csrc.nist.gov/archive/aes/rijndael/wsdindex.html AES Algorithm (Rijndael) Information] and Test Vectors
* [http://www.mediatronix.com/examples/Rijndael-3.htm Implementation for a small 8-bit processor (Picoblaze)]
Wikimedia Foundation. 2010.