Title: The Biryukov-Demirci Attack on Reduced-Round Versions of IDEA and MESH Ciphers
Authors: Nakahara, J ×
Preneel, Bart
Vandewalle, Joos #
Issue Date: 2004
Publisher: Springer
Series Title: Lecture Notes in Computer Science vol:3108 pages:98-109
Conference: ACISP 2004 date:July 13-15, 2004
Abstract: This paper presents a dedicated known-plaintext attack on up to four rounds of the IDEA cipher, that trades-off a small number of known data blocks (114) for a larger time complexity (2(114)). This attack is also applied to up to 2.5-round MESH block ciphers, but are not more effective than previously known attacks. An advantage of this attack compared to previous known-plaintext attacks on IDEA/MESH is that no assumptions on the key value are required. Chosen-plaintext and chosen-plaintext-adaptively-chosen-ciphertext attacks can reach the full 8.5-round IDEA, and up to 5.5-round MESH ciphers, but always under weak-key assumptions.
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:ESAT - STADIUS, Stadius Centre for Dynamical Systems, Signal Processing and Data Analytics
× corresponding author
# (joint) last author

Files in This Item:

There are no files associated with this item.

Request a copy


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science