National Institute of Standards and Technology. Advanced encryption standard, FIPS 197, 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Issues and Approaches to Coarse-Grain Reconfigurable.. - Eguro, Hauck (Correct)
....versus ALUs should reflect this. This paper will primarily focus on the problem of functional unit allocation determining the most appropriate quantity and ratio of functional units across the domain. We will use the 15 candidate algorithms of the Advanced Encryption Standard (AES) competition [12] to illustrate the issues that make component allocation difficult. While operator identification and optimization are both complex problems unique to coarse grain architectures, we will not address these issues here since the algorithms in the target domain often provide an obvious starting ....
National Institute of Standards and Technology. Advanced Encryption Standard (AES) Development Effort. Nov. 11, 2002. <http://csrc.nist.gov/encryption/aes/index2.html>.
DFA on AES - Giraud (2003) (Correct)
....M K denotes the i AES round key and K C denotes the correct ciphertext and C j the j byte of C, D denotes a faulty ciphertext and D j the j byte of D. The following section gives a general description of the AES. For more information, the reader can refer to [16, 10]. 2.1 General description The AES algorithm is capable of encrypting or decrypting data blocks of 128 bits by using cryptographic keys of 128, 192 or 256 bits. Fig. 1. General structure of AES. The AES key scheduling provides N r 1 round keys. The number of rounds N r is dependent on the key ....
National Institute of Standards and Technology, Advanced Encryption Standard, NIST FIPS PUB 197, 2001.
Essential Algebraic Structure within the AES - Murphy, Robshaw (2002) (15 citations) (Correct)
....recover an AES key. Keywords: Advanced Encryption Standard, AES, Rijndael, BES, Algebraic Structure, Finite) Galois Field, Field) Conjugate, Multivariate Quadratic (MQ) Equations. 1 Introduction Rijndael [7, 8] was chosen as the Advanced Encryption Standard (AES) and published as FIPS 197 [21] on 26 November 2001. The AES is carefully designed to resist standard block cipher attacks [1, 18] Here we move our attention to a cipher that is an extension of AES, but which o#ers one particular advantage. All of the operations in this new cipher, the BES, are entirely described using very ....
....of size 2 that corresponds to the AES. We denote these three sets by A, B and BA respectively, so A State space of the AES Vector space F B State space of the BES Vector space F BA Subset of B corresponding to A Subset of F . 3 The Basic Structure of the AES We refer to FIPS 197 [21] for a full description of the cipher, but we list the significant steps here. We concentrate our attentions on a typical round; the first and last rounds have a di#erent (but related) form that is easily assimilated. We consider the basic version of the AES, which encrypts a 16 byte block using a ....
National Institute of Standards and Technology. Advanced Encryption Standard. FIPS 197. 26 November 2001.
Comments on the Security of the AES and the XSL Technique - Murphy, Robshaw (2002) (2 citations) (Correct)
....of key recovery attacks on the AES. Keywords: Advanced Encryption Standard, AES, Rijndael, BES, Algebraic Structure, Multivariate Quadratic Equations, MQ, XSL algorithm. 1 Introduction There has been much recent speculation [3, 4, 9] about the potential for key recovery attacks on the AES [6, 8] and the possible work e#ort that might be required for any such e#orts. This speculation arises from two recent developments. A proposal for a new method of block cipher analysis known as the XSL technique [3, 4] An analysis of the AES in terms of a new cipher (the BES) in order to ....
National Institute of Standards and Technology. Advanced Encryption Standard. FIPS 197. 26 November 2001.
Adaptive and Resilient Security for Multi-hop Multi-media Mobile.. - Kong (Correct)
....choose an encoding bit rate ( and the differentiated class satisfying (3.2) with maximal security complexity. Quantification of security complexity Nowadays advanced encryption algorithms, including the well known Data Encryption Standard (DES [65] and Advanced Encryption Standard (AES [66]) are block cipher algorithms based on Feistel structures and Substitution Permutation Networks (SPN) 23] Security complexity in these algorithms is achieved by many rounds of permutation and substitution. In particular, i) the algorithms must achieve one way property so that it is easy to ....
National Institute of Standards and Technology. Advanced Encryption Standard. http://csrc. nist.gov/encryption/aes/, 2001.
A Tutorial on Linear and Differential Cryptanalysis - Heys (Correct)
....ciphers has solidified the preeminence of both cryptanalysis techniques in the consideration of the security of all block ciphers. For example, many of the candidates submitted for the recent Advanced Encryption Standard process undertaken by the National Institute of Standards and Technology [6] were designed using techniques specifically targeted at thwarting linear and differential cryptanalysis. This is evident, for example, in the Rijndael cipher [7] the encryption algorithm selected to be the new standard. The concepts discussed in this paper could be used to form an initial ....
National Institute of Standards, Advanced Encryption Standard (AES) web site: www.nist.gov/aes.
Software Implementation of the NIST Elliptic.. - Brown, Hankerson, .. (2001) (14 citations) (Correct)
....are listed in Table 2. An elliptic curve E over F p is 2 Table 1. NIST recommended eld sizes for U.S. Federal Government use. Symmetric cipher Example Bitlength of p Dimension m of key length algorithm in prime eld Fp binary eld F2 m 80 SKIPJACK 192 163 112 Triple DES 224 233 128 AES Small [25] 256 283 192 AES Medium [25] 384 409 256 AES Large [25] 521 571 speci ed by the coecients a; b 2 F p of its de ning equation y 2 = x 3 ax b. The NIST curves all have a = 3 because this yields a faster algorithm for point doubling when using Jacobian coordinates (see x4) This choice is ....
....elliptic curve E over F p is 2 Table 1. NIST recommended eld sizes for U.S. Federal Government use. Symmetric cipher Example Bitlength of p Dimension m of key length algorithm in prime eld Fp binary eld F2 m 80 SKIPJACK 192 163 112 Triple DES 224 233 128 AES Small [25] 256 283 192 AES Medium [25] 384 409 256 AES Large [25] 521 571 speci ed by the coecients a; b 2 F p of its de ning equation y 2 = x 3 ax b. The NIST curves all have a = 3 because this yields a faster algorithm for point doubling when using Jacobian coordinates (see x4) This choice is without much loss of ....
[Article contains additional citation context not shown here]
National Institute of Standards and Technology, Advanced Encryption Standard, work in progress.
Software Implementation of Elliptic Curve Cryptography .. - Hankerson, Hernandez, .. (2000) (17 citations) (Correct)
....and eld sizes is given in Table 1. For binary elds Table 1. NIST recommended eld sizes for U.S. Federal Government use. Symmetric cipher Example Bitlength of p Dimension m of key length algorithm in prime eld Fp binary eld F2 m 80 SKIPJACK 192 163 112 Triple DES 224 233 128 AES Small [34] 256 283 192 AES Medium [34] 384 409 256 AES Large [34] 521 571 F 2 m , m was chosen so that there exists a Koblitz curve of almost prime order over F 2 m . Since the order #E(F 2 l ) divides #E(F 2 m) whenever l divides m, this requirement imposes the condition that m be prime. Since the NIST ....
....Table 1. For binary elds Table 1. NIST recommended eld sizes for U.S. Federal Government use. Symmetric cipher Example Bitlength of p Dimension m of key length algorithm in prime eld Fp binary eld F2 m 80 SKIPJACK 192 163 112 Triple DES 224 233 128 AES Small [34] 256 283 192 AES Medium [34] 384 409 256 AES Large [34] 521 571 F 2 m , m was chosen so that there exists a Koblitz curve of almost prime order over F 2 m . Since the order #E(F 2 l ) divides #E(F 2 m) whenever l divides m, this requirement imposes the condition that m be prime. Since the NIST binary curves are all de ned ....
[Article contains additional citation context not shown here]
National Institute of Standards and Technology, Advanced Encryption Standard, work in progress.
On Secure and Pseudonymous Client-Relationships with.. - Eran Gabber Phillip (1999) (5 citations) (Correct)
....block ciphers having 64 bit blocks, such as DES, triple DES, or IDEA [Lai and Massey 1991] should not be used if it is feasible for an attacker to collect about 2 32 samples, thus giving only marginal security to the overall scheme. However, newer block ciphers, such as some of the AES [National Institute of Standards and Technology (NIST) 1999] candidates, have 128 bit block sizes and are therefore more suitable in this case. 4. AN ANONYMOUS MAILBOX SYSTEM We will first summarize the history of anonymous remailers, then describe our anonymous mailbox system, and finally discuss how enhanced privacy can be achieved by using our ....
National Institute of Standards and Technology (NIST). 1999. Advanced encryption standard (AES) development effort. http://www.nist.gov/aes/.
On Permutation Operations in Cipher Design - Ruby Lee Shi (2004) (1 citation) Self-citation (Technology) (Correct)
No context found.
National Institute of Standard and Technology. Advanced Encryption Standard (AES). FIPS 197, November 2001.
Further Observations on the Structure of the AES Algorithm - Song, Seberry (2003) (1 citation) Self-citation (Technology) (Correct)
No context found.
National Institute of Standard and Technology, \Advanced Encryption Standard(AES)", FIPS 197, 2001.
On Permutation Operations in Cipher Design - Lee, Shi, Yin, al. (2004) (1 citation) Self-citation (Technology) (Correct)
No context found.
National Institute of Standard and Technology. Advanced Encryption Standard (AES). FIPS 197, November 2001.
On the Performance, Feasibility, and Use of Forward-Secure.. - Cronin, Jamin, al. (2003) (Correct)
No context found.
National Institute of Standards and Technology. Advanced encryption standard, FIPS 197, 2001.
Fatih: Detecting and Isolating Malicious Routers - Mizrak, Cheng, Marzullo, Savage (Correct)
No context found.
National Institute of Standards and Technology. Advanced encryption standard. FIPS PUBS 197, Nov. 2001.
Architecture for Protecting Critical Secrets in Microprocessors - Ruby Lee Peter (Correct)
No context found.
National Institute of Standards and Technology, "Advanced Encryption Standard," FIPS Pub 197, Nov 2001.
Cache Attacks and Countermeasures: the Case of AES - Dag Arne Osvik (2005) (3 citations) (Correct)
No context found.
National Institute of Standards and Technology, Advanced Encryption Standard (AES) (FIPS PUB 197), 2001
White-Box Cryptography and an AES Implementation - Chow, Eisen, Johnson, van.. (2002) (4 citations) (Correct)
No context found.
National Institute of Standards and Technology (nist), Advanced Encryption Standard (aes), fips Publication 197, 26 Nov. 2001. http://csrc.nist.gov/publications/fips/fips197/fips-197.pdf
White-Box Cryptography and an AES Implementation - Chow, Eisen, Johnson, van.. (2002) (4 citations) (Correct)
No context found.
National Institute of Standards and Technology (NIST), Advanced Encryption Standard (aes), fips Publication 197, 26 Nov. 2001. http://csrc.nist.gov/publications/fips/fips197/fips-197.pdf
White-Box Cryptography and an AES Implementation - Chow, Eisen, Johnson, van.. (2002) (4 citations) (Correct)
No context found.
National Institute of Standards and Technology (NIST), Advanced Encryption Standard (aes), fips Publication 197, 26 Nov. 2001. http://csrc.nist.gov/publications/fips/fips197/fips-197.pdf
Permutation Operations in Block Ciphers - Lee, Rivest, Robshaw, Shi, Yin (Correct)
No context found.
National Institute of Standard and Technology. Advanced Encryption Standard (AES). FIPS 197, November 2001.
Essential Algebraic Structure within the AES - Murphy, Robshaw (2002) (15 citations) (Correct)
No context found.
National Institute of Standards and Technology. Advanced Encryption Standard. FIPS 197. 26 November 2001.
Application Analysis and Resource Mapping for Heterogeneous - Network Processor.. (2004) (Correct)
No context found.
National Institute of Standards and Technology. Advanced Encryption Standard (AES),Nov. 2001. FIPS 197.
Comments on the Security of the AES and the XSL Technique - Murphy, Robshaw (2002) (2 citations) (Correct)
No context found.
National Institute of Standards and Technology. Advanced Encryption Standard. FIPS 197. 26 November 2001.
Block Ciphers and Stream Ciphers: The State of the Art - Biryukov (2004) (Correct)
No context found.
National Institute of Standards and Technology, Advanced Encryption Standard . FIPS-197, NIST, Nov. 2001. Available at http://csrc.nist.gov/encryption/.
On the Performance, Feasibility, and Use of.. - Cronin, Jamin.. (2003) (Correct)
No context found.
National Institute of Standards and Technology. Advanced encryption standard, FIPS 197, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC