In this article, we formalize the Advanced Encryption Standard (AES). AES, which is the most widely used symmetric cryptosystem in the world, is a block cipher that was selected by the National Institute of Standards and Technology (NIST) as an official Federal Information Processing Standard for the United States in 2001 [12]. AES is the successor to DES [13], which was formerly the most widel...

Scan based test is a double edged sword. On one hand, it is a powerful test technique. On the other hand, it is an equally powerful attack tool. In this paper we show that scan chains can be used as a side channel to recover secret keys from a hardware implementation of any cryptographic algorithm. Compared to the 2 plaintexts required to break the new Advanced Encryption Standard (AES), the pr...

The National Security Agency (NSA) is providing hardware simulation support and performance measurements to aid NIST in their selection of the AES algorithm. Although much of the Round 1 analysis focused on software, much more attention will be directed towards hardware implementation issues in the Round 2 analysis. As NIST has stated, a common set of assumptions will be essential in comparing ...

Mars, RC6, Rijndael, Serpent and Twofish were selected as finalists for the Advanced Encryption Standard (AES). To evaluate the finalists’ suitability as random number generators, empirical statistical testing is commonly employed. Although it widely believed that these five algorithms are indeed random, randomness testing was conducted to show that there is empirical evidence supporting this b...

89.3 Rijndael................................................................................ 1155 89.4 Why Did NIST Select the Rijndael Algorithm? ............... 1156 89.5 Problems with Rijndael ...................................................... 1156 89.6 Can AES Be Cracked?......................................................... 1157 89.7 The Impact of AES .................................

Each of the current five candidate algorithms for AES satisfies a different balance of these constraints; the ‘best’ algorithm depends on circumstances, which are impossible to know beforehand. Furthermore, one of the principal requirements that of security of the algorithm cannot easily be measured; subjective judgements therefore must be made (based, for instance, on notions of ‘safety margin...

In this paper we present a differential fault attack that can be applied to the AES using a single fault. We demonstrate that when a single random byte fault is induced at the input of the eighth round, the AES key can be deduced using a two stage algorithm. The first step has a statistical expectation of reducing the possible key hypotheses to 2, and the second step to a mere 2.

Mars, RC6, Rijndael, Serpent and Twofish were selected as finalists for the Advanced Encryption Standard (AES). To evaluate the finalists’ suitability as random number generators, empirical statistical testing is commonly employed. Although it widely believed that these five algorithms are indeed random, randomness testing was conducted to show that there is empirical evidence supporting this b...

Abstract. This paper presents a five-round algebraic property of the Advanced Encryption Standard (AES). In the proposed property, we modify twenty bytes from five intermediate values at some fixed locations in five consecutive rounds, and we show that after five rounds of operations, such modifications do not change the intermediate result and finally still produce the same ciphertext. We intr...