Impossible Differential Cryptanalysis of CLEFIA

Tsunoo, Yukiyasu; Tsujihara, Etsuko; Shigeri, Maki; Saito, Teruo; Suzaki, T.; Kubo, Hidenori

doi:10.1007/978-3-540-71039-4_25

Cited by 45 publications

(42 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To the best of our knowledge, these are the best cryptanalytic results on CLE-FIA. Results of these improbable differential attacks and the impossible differential attacks of [10] on CLEFIA are summarized in Table 2.…”

Section: Resultsmentioning

confidence: 99%

“…We also introduce improbable differential attacks on 14 and 15-round CLEFIA for key lengths 196 and 256 bits in Appendix A and B. Moreover, we provide a practical improbable differential attack on 6-round CLEFIA in Appendix C. In these attacks our aim is to derive the round keys and we do not consider the key scheduling part as done in [9][10][11].…”

Section: Improbable Differential Attacks On Clefiamentioning

confidence: 99%

See 1 more Smart Citation

The Improbable Differential Attack: Cryptanalysis of Reduced Round CLEFIA

Tezcan

2010

Progress in Cryptology - INDOCRYPT 2010

View full text Add to dashboard Cite

Abstract. In this paper we present a new statistical cryptanalytic technique that we call improbable differential cryptanalysis which uses a differential that is less probable when the correct key is used. We provide data complexity estimates for this kind of attacks and we also show a method to expand impossible differentials to improbable differentials. By using this expansion method, we cryptanalyze 13, 14, and 15-round CLEFIA for the key sizes of length 128, 192, and 256 bits, respectively. These are the best cryptanalytic results on CLEFIA up to this date.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Improbable Differential Attacks On Clefiamentioning

confidence: 99%

The Improbable Differential Attack: Cryptanalysis of Reduced Round CLEFIA

Tezcan

2010

Progress in Cryptology - INDOCRYPT 2010

View full text Add to dashboard Cite

show abstract

“…The two F-functions call 2 different 8 bits Sboxes followed by a diffusion matrix multiplication inspired from the AES MixColumns operation. Security In [53], the authors present impossible differential cryptanalysis against CLEFIA. With this method, they could build impossible differential attack against CLEFIA reduced to 12 rounds for a 128 bits key with a time complexity equal to 2 119 encryptions.…”

Section: Aes-128mentioning

confidence: 99%

Survey and Benchmark of Lightweight Block Ciphers for Wireless Sensor Networks

Cazorla

Marquet

Minier

2013

Proceedings of the 10th International Conference on Security and Cryptography

View full text Add to dashboard Cite

Abstract. For security applications in wireless sensor networks (WSNs), choosing best algorithms in terms of energy-efficiency and of small memory requirements is a real challenge because the sensor networks must be autonomous. In [17,35], the authors have benchmarked on a dedicated platform some block-ciphers and have deduced the best candidates to use in the context of small embedded platforms. This article proposes to study on a dedicated platform of sensors most of the recent lightweight block ciphers as well as some conventional block ciphers. First, we describe the design of the chosen block ciphers with a security summary and we then present some implementation tests performed on our platform.

show abstract

“…All of them have 1-property matrices E and D. The reader may refer to [7,9,10,4,8] for the details of these cipher structures. We also found the specific forms of impossible boomerang characteristics which give the maximum lengths for each structure.…”

Section: Algorithm 1 To Compute the Length Mmentioning

confidence: 99%

Impossible Boomerang Attack for Block Cipher Structures

Choy

Yap

2009

Advances in Information and Computer Security

View full text Add to dashboard Cite

Abstract. Impossible boomerang attack [5] (IBA) is a new variant of differential cryptanalysis against block ciphers. Evident from its name, it combines the ideas of both impossible differential cryptanalysis and boomerang attack. Though such an attack might not be the best attack available, its complexity is still less than that of the exhaustive search. In impossible boomerang attack, impossible boomerang distinguishers are used to retrieve some of the subkeys. Thus the security of a block cipher against IBA can be evaluated by impossible boomerang distinguishers. In this paper, we study the impossible boomerang distinguishers for block cipher structures whose round functions are bijective. Inspired by the U-method in [3], we provide an algorithm to compute the maximum length of impossible boomerang distinguishers for general block cipher structures, and apply the algorithm to known block cipher structures such as Nyberg's generalized Feistel network, a generalized CAST256-like structure, a generalized MARS-like structure, a generalized RC6-like structure, etc.

show abstract

Impossible Differential Cryptanalysis of CLEFIA

Cited by 45 publications

References 6 publications

The Improbable Differential Attack: Cryptanalysis of Reduced Round CLEFIA

The Improbable Differential Attack: Cryptanalysis of Reduced Round CLEFIA

Survey and Benchmark of Lightweight Block Ciphers for Wireless Sensor Networks

Impossible Boomerang Attack for Block Cipher Structures

Contact Info

Product

Resources

About