1996 IEEE International Conference on Acoustics, Speech, and Signal Processing Conference Proceedings
DOI: 10.1109/icassp.1996.550565
|View full text |Cite
|
Sign up to set email alerts
|

Telekom's MAGENTA algorithm for en-/decryption in the Gigabit/sec range

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 3 publications
0
3
0
Order By: Relevance
“…The MAGENTA cipher was developed under the initiative to create a chip that is capable of running at high data rates. The paper by Huber and Wolter (1996) presented a high speed implementation of the MAGENTA cipher using 0.6 mm CMOS technology, with 1 Gbps and 60 mm 2 chip area. It is also mentioned that the MAGENTA is suitable for high-speed application such as the ATM networks.…”
Section: Magentamentioning
confidence: 99%
See 1 more Smart Citation
“…The MAGENTA cipher was developed under the initiative to create a chip that is capable of running at high data rates. The paper by Huber and Wolter (1996) presented a high speed implementation of the MAGENTA cipher using 0.6 mm CMOS technology, with 1 Gbps and 60 mm 2 chip area. It is also mentioned that the MAGENTA is suitable for high-speed application such as the ATM networks.…”
Section: Magentamentioning
confidence: 99%
“…The MAGENTA cipher (Huber and Wolter, 1996) is also known as the Multifunctional Algorithm for General-purpose Encryption and Network Telecommunication. The MAGENTA cipher was developed under the initiative to create a chip that is capable of running at high data rates.…”
Section: Magentamentioning
confidence: 99%
“…In October 2000, NIST chose Rijndael as the AES Advanced Encryption Algorithm. One of the core operations of AES is a Galois Field fixed field constant multiplication, which is also a core operation of other block ciphers, such as Magenta, MISTY1, MISTY2, SHARK, SQUARE, and Twofish [20], [21], [22], [23], [24], [25], [26]. Unfortunately, Galois Field fixed field constant multiplication does not map well to traditional processor instruction sets.…”
Section: Introductionmentioning
confidence: 99%