AES competition/Catalogs/AES players: Difference between revisions
imported>Sandy Harris No edit summary |
imported>Sandy Harris No edit summary |
||
| Line 10: | Line 10: | ||
Both differential and linear cryptanalysis break DES with less effort than brute force, but at least two writers have proposed methods of making ciphers provably resistant to linear and differential cryptanalysis, [[Carlisle Adams]] in [[Block_cipher#CAST|CAST]] and [[Serge Vaudenay]] with his [[decorrelation theory]]. | Both differential and linear cryptanalysis break DES with less effort than brute force, but at least two writers have proposed methods of making ciphers provably resistant to linear and differential cryptanalysis, [[Carlisle Adams]] in [[Block_cipher#CAST|CAST]] and [[Serge Vaudenay]] with his [[decorrelation theory]]. | ||
There are also several other new attacks that are variants of differential analysis. A direct ancestor of [[Rijndael]], the winning AES candidate, was [[Square (cipher)|Square]], designed by [[Joan Daemen]] and [[Vincent Rijmen]]. | There are also several other new attacks that are variants of differential analysis. Biham invented [[related key attack]]s, and [[Lars Knudsen]] used that technique against some ancestors of AES candidates, the first versions of both [[SAFER (cipher)|SAFER]] and [[LOKI (cipher)|LOKI]]. A direct ancestor of [[Rijndael]], the winning AES candidate, was [[Square (cipher)|Square]], designed by [[Joan Daemen]] and [[Vincent Rijmen]]. Knudsen invented [[integral cryptanalysis]] to break that. [[David Wagner]] invented another new technique called the [[boomerang attack]] to break Vaudenay's [[Coconut98]]. All these techniques have since been used to break several other ciphers. However, the AES candidate descendants of the various ciphers broken by them were all designed to resist those attacks. | ||
Standard references in the field include [[Bruce Schneier]]'s ''Applied Cryptography'' | Standard references in the field include [[Bruce Schneier]]'s ''Applied Cryptography'' | ||
Revision as of 02:12, 24 August 2009
| The metadata subpage is missing. You can start it via filling in this form or by following the instructions that come up after clicking on the [show] link to the right. | |||
|---|---|---|---|
|
The AES competition involved many of the world's top cryptographers.
Some of the major developments in cryptography before AES were:
- DES from an IBM team that included Don Coppersmith
- Differential cryptanalysis, discovered by Coppersmith et al, but kept secret at NSA request. Re-discovered and first published in open literature by Eli Biham and Adi Shamir.
- Linear cryptanalysis, from Mitsuru Matsui.
- The RSA algorithm for public key cryptography, from Ron Rivest, Adi Shamir and Leonard Adleman.
Both differential and linear cryptanalysis break DES with less effort than brute force, but at least two writers have proposed methods of making ciphers provably resistant to linear and differential cryptanalysis, Carlisle Adams in CAST and Serge Vaudenay with his decorrelation theory.
There are also several other new attacks that are variants of differential analysis. Biham invented related key attacks, and Lars Knudsen used that technique against some ancestors of AES candidates, the first versions of both SAFER and LOKI. A direct ancestor of Rijndael, the winning AES candidate, was Square, designed by Joan Daemen and Vincent Rijmen. Knudsen invented integral cryptanalysis to break that. David Wagner invented another new technique called the boomerang attack to break Vaudenay's Coconut98. All these techniques have since been used to break several other ciphers. However, the AES candidate descendants of the various ciphers broken by them were all designed to resist those attacks.
Standard references in the field include Bruce Schneier's Applied Cryptography [1] and Ross Anderson's Security Engineering [2].
Most of the people mentioned above, and a number of others well-known in the field, participated in the AES process.
Here is a table showing some of the major players. For several papers, some of the co-authors are omitted to make the table more readable; see references in the main article for complete co-author lists.
| AES cipher | Team included | Analysis from |
|---|---|---|
| Rijndael | Rijmen, Daemen | Ferguson, Schroeppel, Whiting |
| Twofish | Schneier, Kelsey, Whiting, Wagner, Ferguson | |
| Serpent | Anderson, Biham, Knudsen | |
| RC6 | Rivest | |
| MARS | Coppersmith | |
| Hasty Pudding | Schroeppel | |
| FROG | Schneier, Wagner, Ferguson | |
| Magenta | Schneier, Biham, Shamir, Ferguson, Knudsen | |
| E2 | Matsui | |
| DEAL | Knudsen | Schneier, Kelsey |
| DFC | Vaudenay | Knudsen, Rijmen |
| CAST-256 | Adams |
- ↑ Schneier, Bruce (2nd edition, 1996,), Applied Cryptography, John Wiley & Sons, ISBN 0-471-11709-9
- ↑ Ross Anderson. Security Engineering.