Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

26

FSE
2005
Springer

favoriteEmaildiscussreport

98views Cryptology» more FSE 2005»

New Attacks Against Reduced-Round Versions of IDEA

14 years 4 months ago

New Attacks Against Reduced-Round Versions of IDEA

Download lasecwww.epfl.ch

In this paper, we describe a sequence of simple, yet eﬃcient chosen-plaintext (or chosen-ciphertext) attacks against reduced-round versions of IDEA (with 2, 2.5, 3, 3.5, and 4 rounds) which compare favourably with the best known attacks: some of them decrease considerably the time complexity given the same order of data at disposal while other ones decrease the amount of necessary known- or chosen-plaintext pairs under comparable time complexities. Additionally, we show how to trade time and memory for some of the known-plaintext attacks of Nakahara et al. Key words: Block ciphers, IDEA, Demirci-Biryukov relation.

Pascal Junod

Real-time Traffic

Comparable Time Complexities | Cryptography | FSE 2005 | Reduced-round Versions | Time Complexity |

claim paper

Related Content

» Linear Cryptanalysis of ReducedRound Versions of the SAFER Block Cipher Family

» Amplified Boomerang Attacks Against ReducedRound MARS and Serpent

» Nonlinear Reduced Round Attacks against SHA2 Hash Family

» A New Technique for Multidimensional Linear Cryptanalysis with Applications on Reduced Rou...

» A new hash family obtained by modifying the SHA2 family

» A MeetintheMiddle Collision Attack Against the New FORK256

» Cryptanalysis of Achterbahn12880 with a New Keystream Limitation

» Evolution Cipher against Differential Power Attack

» Linearization Attacks Against Syndrome Based Hashes

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	FSE
Authors	Pascal Junod

Comments (0)