(ebook - pdf - encryption) magenta encryption algorithm

(ebook - pdf - encryption) magenta encryption algorithm -...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Cryptanalysis of Magenta Eli Biham, Alex Biryukov, Niels Ferguson, Lars R. Knudsen, Bruce Schneier, Adi Shamir August 20, 1998 Magenta is an encryption algorithm submitted for AES by Deutsche Telekom AG, and presented by Michael Jacobson, Jr. at August 20, 1998. Unlike all other candidates, this cipher was made available to the conference attendees only on the day of presentation. In this note we cryptanalyze Magenta, and any algorithm of the same structure and key schedule. We refer the reader to the figure on slide 7 of the Magenta presen- tation (given in the handouts at the first AES candidate conference). This figure describes the block structure and key schedule for 128-bit keys. Magenta is a Feistel cipher with 6 rounds, in which the key is divided into two halves, called K 1 and K 2 , and these halves are used in the following way: K 1 is used in rounds 1,2,5,6, and K 2 is used in rounds 3 and 4. We use the following notation for the intermediate values during encryption: X 0 is the plaintext, X 1 is the data after one round, X i is the data after
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/18/2010 for the course MATH CS 301 taught by Professor Aliulger during the Fall '10 term at Koç University.

Page1 / 3

(ebook - pdf - encryption) magenta encryption algorithm -...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online