The Design of Rijndael: AES - The Advanced Encryption StandardSpringer Science & Business Media, 9. 3. 2013 - 238 strán (strany) Rijndael was the surprise winner of the contest for the new Advanced En cryption Standard (AES) for the United States. This contest was organized and run by the National Institute for Standards and Technology (NIST) be ginning in January 1997; Rijndael was announced as the winner in October 2000. It was the "surprise winner" because many observers (and even some participants) expressed scepticism that the D.S. government would adopt as an encryption standard any algorithm that was not designed by D.S. citizens. Yet NIST ran an open, international, selection process that should serve as model for other standards organizations. For example, NIST held their 1999 AES meeting in Rome, Italy. The five finalist algorithms were designed by teams from all over the world. In the end, the elegance, efficiency, security, and principled design of Rijndael won the day for its two Belgian designers, Joan Daemen and Vincent Rijmen, over the competing finalist designs from RSA, IBM, Counterpane Systems, and an EnglishjIsraelijDanish team. This book is the story of the design of Rijndael, as told by the designers themselves. It outlines the foundations of Rijndael in relation to the previous ciphers the authors have designed. It explains the mathematics needed to and the operation of Rijndael, and it provides reference C code and underst test vectors for the cipher. |
Obsah
The Advanced Encryption Standard Process | 1 |
Specification of Rijndael | 3 |
Preliminaries | 9 |
33 | 17 |
46 | 23 |
53 | 54 |
Design Philosophy | 65 |
The Data Encryption Standard | 81 |
The Wide Trail Strategy | 123 |
Related Block Ciphers | 161 |
Appendices | 175 |
B Trail Clustering 195 | 194 |
Substitution Tables | 211 |
E Reference Code 221 | 220 |
229 | |
235 | |
Iné vydania - Zobraziť všetky
The Design of Rijndael: AES - The Advanced Encryption Standard Joan Daemen,Vincent Rijmen Obmedzený náhľad - 2002 |
Časté výrazy a frázy
active bundles active bytes AddRoundKey AES candidate affine transformation applied binary Boolean functions bits block cipher block length bundle weight Chap cipher key ciphertext components computational correlation contribution correlation matrix criteria cryptographic Crypton decryption algorithm defined denoted difference pattern difference propagation probability differential and linear differential branch number differential cryptanalysis differential trail efficient elements encryption expanded key finite field four rounds GF(p Hence inverse InvMixColumns key addition key expansion key length key schedule key-alternating cipher linear branch number linear codes linear cryptanalysis linear expressions linear over GF(2 linear trails linear transformation lower bounded maximum MixColumns mixing step multiplication NIST non-linear step number of active number of rounds operation pairs plaintext polynomial related-key attacks representation Rijndael round key round transformation Sect security margin ShiftRows smart cards specification structure SubBytes symmetry Theorem transposition Twofish upper bound weak keys word8