MAGENTA (cipher): Difference between revisions
imported>Sandy Harris (New page: '''MAGENTA''' or '''Multifunctional Algorithm for General-purpose Encryption and Network Telecommunication Applications''' was Deutsche Telekom's entry in the AES competition. Like all...) |
John Leach (talk | contribs) m (Text replacement - "{{subpages}}" to "{{PropDel}}<br><br>{{subpages}}") |
||
| (4 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
'''MAGENTA''' or '''Multifunctional Algorithm for General-purpose Encryption and Network Telecommunication Applications''' was [[Deutsche Telekom]]'s entry in the AES competition. Like all AES candidates, it uses 128-bit blocks and supports key sizes of 128, 192 or 256 bits. It is a [[Feistel cipher]] with six or eight rounds. | {{PropDel}}<br><br>{{subpages}} | ||
'''MAGENTA''' or '''Multifunctional Algorithm for General-purpose Encryption and Network Telecommunication Applications''' is a [[block cipher]]; it was [[Deutsche Telekom]]'s entry in the [[AES competition]]. Like all AES candidates, it uses 128-bit blocks and supports key sizes of 128, 192 or 256 bits. It is a [[Feistel cipher]] with six or eight rounds. | |||
MAGENTA | MAGENTA | ||
| Line 7: | Line 8: | ||
| url = http://vision.gel.ulaval.ca/~klein/maitrise/aes/magenta.pdf | | url = http://vision.gel.ulaval.ca/~klein/maitrise/aes/magenta.pdf | ||
}}</ref> | }}</ref> | ||
is often cited as an example of [[Kerckhoffs' Principle]], a demonstration of why unpublished and therefore unanalysed ciphers cannot be trusted. Of the | is often cited as an example of [[Kerckhoffs' Principle]], a demonstration of why unpublished and therefore unanalysed ciphers cannot be trusted. Of the fifteen candidates in the [[AES competition]], fourteen were made public before the first AES conference. The MAGENTA team were the one exception; they made nothing public until their conference presentation. That presentation was given one morning, to an audience that included many of the world's top cryptographers. Some saw flaws, and there was intense discussion over lunch. By that evening, a draft paper on breaking the cipher was circulating and the final version | ||
<ref>{{citation | <ref>{{citation | ||
| author = Eli Biham, Alex Biryukov, Niels Ferguson, Lars Knudsen, Bruce Schneier and Adi Shamir | | author = Eli Biham, Alex Biryukov, Niels Ferguson, Lars Knudsen, Bruce Schneier and Adi Shamir | ||
Latest revision as of 04:49, 8 April 2024
| This article may be deleted soon. | ||
|---|---|---|
 MAGENTA or Multifunctional Algorithm for General-purpose Encryption and Network Telecommunication Applications is a block cipher; it was Deutsche Telekom's entry in the AES competition. Like all AES candidates, it uses 128-bit blocks and supports key sizes of 128, 192 or 256 bits. It is a Feistel cipher with six or eight rounds. MAGENTA [1] is often cited as an example of Kerckhoffs' Principle, a demonstration of why unpublished and therefore unanalysed ciphers cannot be trusted. Of the fifteen candidates in the AES competition, fourteen were made public before the first AES conference. The MAGENTA team were the one exception; they made nothing public until their conference presentation. That presentation was given one morning, to an audience that included many of the world's top cryptographers. Some saw flaws, and there was intense discussion over lunch. By that evening, a draft paper on breaking the cipher was circulating and the final version [2] was presented at the second AES conference. The attackers included members of both the Twofish and Serpent teams, plus others. References
|
||
