Magenta (algorithm)
| magenta | |
|---|---|
| developer | Michael Jacobson Jr., Klaus Huber |
| Released | 1998 |
| Key length | 128, 192 or 256 bits |
| Block size | 128 bit |
| structure | Feistel cipher |
| Round | 6 or 8 |
| Best known cryptanalysis | |
| Magenta is considered broken. | |
Magenta is the term for a symmetric algorithm for encryption , that of the Deutsche Telekom was developed between 1990 and 1998.
Magenta is a Feistel cipher with six rounds and was eliminated in the first round of the AES conference for the selection of a DES successor.
The name Magenta stands as an acronym for “Multifunctional Algorithm for General-purpose Encryption and Network Telecommunication Applications” (translated: multifunctional algorithm for general encryption and network communication applications). At the same time, the name is a tribute to the corporate design of Deutsche Telekom, which makes extensive use of the color magenta .
Cryptanalysis
The cryptologists Adi Shamir and Ross Anderson found theoretical attack possibilities during the 20-minute presentation of the algorithm. A short time later they proved that this attack is also practically possible and that the cryptosystem is therefore easy to break.
Web links
- Cryptanalysis of Magenta by Eli Biham, Adi Shamir, Bruce Schneier and others (PDF file; 41 kB)
- Brief introduction to Magenta by David Damm
Individual evidence
- ↑ Eli Biham, Alex Biryukov, Niels Ferguson, Lars Knudsen, Bruce Schneier and Adi Shamir: Cryptanalysis of Magenta . Second AES candidate conference, 1998 ( schneier.com [PDF]).