Cryptanalysis of WIDEA

1Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

WIDEA is a family of block ciphers designed by Junod and Macchetti in 2009 as an extension of IDEA to larger block sizes (256 and 512 bits for the main instances WIDEA- and WIDEA- ) and larger key sizes (512 and 1024 bits, respectively). WIDEA- is composed of parallel copies of the IDEA block cipher, with an MDS matrix to provide diffusion between them. An important motivation was to use WIDEA to design a hash function. In this paper we present low complexity attacks on WIDEA based on truncated differentials. We show a distinguisher for the full WIDEA with complexity only 265, and we use the distinguisher in a key-recovery attack with complexity w·2 68. We also show a collision attack on WIDEA- if it is used to build a hash function using the Merkle-Damgård mode of operation. The attacks exploit the parallel structure of WIDEA and the limited diffusion between the IDEA instances, using differential trails where the MDS diffusion layer is never active. In addition, we use structures of plaintext to reduce the data complexity. © 2014 Springer-Verlag.

Cite

CITATION STYLE

APA

Leurent, G. (2014). Cryptanalysis of WIDEA. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8424 LNCS, pp. 39–51). Springer Verlag. https://doi.org/10.1007/978-3-662-43933-3_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free