Cryptographic weaknesses in the round transformation used in a block cipher with provable immunity against linear cryptanalysis

Kouichi Sakurai, Yuliang Zheng

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

MISTY is a data encryption algorithm recently proposed by M. Matsui from Mitsubishi Electric Corporation. This paper focuses on cryptographic roles of the transform used in the MISTY cipher. Our research reveals that when used for constructing pseudorandom permutations, the transform employed by the MISTY cipher is inferior to the transform in DES, though the former is superior to the latter in terms of strength against linear and differential attacks. More specifically, we show that a 3-round (4-round, respectively) concatenation of transforms used in the MISTY cipher is not a pseudorandom (super pseudorandom, respectively) permutation. For comparison, we note that with three (four, respectively) rounds, transforms used in DES yield a pseudorandom (super pseudorandom, respectively) permutation. Another contribution of this paper is to show that a 3-round concatenation of transforms used in (the preliminary version of) the MISTY cipher has an algebraic property, which may open a door for various cryptanalytic attacks.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 7th International Symposium, ISAAC 1996, Proceedings
EditorsHiroshi Nagamochi, Satoru Miyano, Tetsuo Asano, Yoshihide Igarashi, Subhash Suri
PublisherSpringer Verlag
Pages376-385
Number of pages10
ISBN (Print)3540620486, 9783540620488
Publication statusPublished - Jan 1 1996
Event7th International Symposium on Algorithms and Computation, ISAAC 1996 - Osaka, Japan
Duration: Dec 16 1996Dec 18 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1178
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other7th International Symposium on Algorithms and Computation, ISAAC 1996
CountryJapan
CityOsaka
Period12/16/9612/18/96

Fingerprint

Linear Cryptanalysis
Block Cipher
Immunity
Cryptography
Transform
Industry
Permutation
Concatenation
Attack
Encryption

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Sakurai, K., & Zheng, Y. (1996). Cryptographic weaknesses in the round transformation used in a block cipher with provable immunity against linear cryptanalysis. In H. Nagamochi, S. Miyano, T. Asano, Y. Igarashi, & S. Suri (Eds.), Algorithms and Computation - 7th International Symposium, ISAAC 1996, Proceedings (pp. 376-385). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1178). Springer Verlag.

Cryptographic weaknesses in the round transformation used in a block cipher with provable immunity against linear cryptanalysis. / Sakurai, Kouichi; Zheng, Yuliang.

Algorithms and Computation - 7th International Symposium, ISAAC 1996, Proceedings. ed. / Hiroshi Nagamochi; Satoru Miyano; Tetsuo Asano; Yoshihide Igarashi; Subhash Suri. Springer Verlag, 1996. p. 376-385 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1178).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sakurai, K & Zheng, Y 1996, Cryptographic weaknesses in the round transformation used in a block cipher with provable immunity against linear cryptanalysis. in H Nagamochi, S Miyano, T Asano, Y Igarashi & S Suri (eds), Algorithms and Computation - 7th International Symposium, ISAAC 1996, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1178, Springer Verlag, pp. 376-385, 7th International Symposium on Algorithms and Computation, ISAAC 1996, Osaka, Japan, 12/16/96.
Sakurai K, Zheng Y. Cryptographic weaknesses in the round transformation used in a block cipher with provable immunity against linear cryptanalysis. In Nagamochi H, Miyano S, Asano T, Igarashi Y, Suri S, editors, Algorithms and Computation - 7th International Symposium, ISAAC 1996, Proceedings. Springer Verlag. 1996. p. 376-385. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Sakurai, Kouichi ; Zheng, Yuliang. / Cryptographic weaknesses in the round transformation used in a block cipher with provable immunity against linear cryptanalysis. Algorithms and Computation - 7th International Symposium, ISAAC 1996, Proceedings. editor / Hiroshi Nagamochi ; Satoru Miyano ; Tetsuo Asano ; Yoshihide Igarashi ; Subhash Suri. Springer Verlag, 1996. pp. 376-385 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{1eb2e01e09f04bbb96a9ce7fdf1a3f45,
title = "Cryptographic weaknesses in the round transformation used in a block cipher with provable immunity against linear cryptanalysis",
abstract = "MISTY is a data encryption algorithm recently proposed by M. Matsui from Mitsubishi Electric Corporation. This paper focuses on cryptographic roles of the transform used in the MISTY cipher. Our research reveals that when used for constructing pseudorandom permutations, the transform employed by the MISTY cipher is inferior to the transform in DES, though the former is superior to the latter in terms of strength against linear and differential attacks. More specifically, we show that a 3-round (4-round, respectively) concatenation of transforms used in the MISTY cipher is not a pseudorandom (super pseudorandom, respectively) permutation. For comparison, we note that with three (four, respectively) rounds, transforms used in DES yield a pseudorandom (super pseudorandom, respectively) permutation. Another contribution of this paper is to show that a 3-round concatenation of transforms used in (the preliminary version of) the MISTY cipher has an algebraic property, which may open a door for various cryptanalytic attacks.",
author = "Kouichi Sakurai and Yuliang Zheng",
year = "1996",
month = "1",
day = "1",
language = "English",
isbn = "3540620486",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "376--385",
editor = "Hiroshi Nagamochi and Satoru Miyano and Tetsuo Asano and Yoshihide Igarashi and Subhash Suri",
booktitle = "Algorithms and Computation - 7th International Symposium, ISAAC 1996, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Cryptographic weaknesses in the round transformation used in a block cipher with provable immunity against linear cryptanalysis

AU - Sakurai, Kouichi

AU - Zheng, Yuliang

PY - 1996/1/1

Y1 - 1996/1/1

N2 - MISTY is a data encryption algorithm recently proposed by M. Matsui from Mitsubishi Electric Corporation. This paper focuses on cryptographic roles of the transform used in the MISTY cipher. Our research reveals that when used for constructing pseudorandom permutations, the transform employed by the MISTY cipher is inferior to the transform in DES, though the former is superior to the latter in terms of strength against linear and differential attacks. More specifically, we show that a 3-round (4-round, respectively) concatenation of transforms used in the MISTY cipher is not a pseudorandom (super pseudorandom, respectively) permutation. For comparison, we note that with three (four, respectively) rounds, transforms used in DES yield a pseudorandom (super pseudorandom, respectively) permutation. Another contribution of this paper is to show that a 3-round concatenation of transforms used in (the preliminary version of) the MISTY cipher has an algebraic property, which may open a door for various cryptanalytic attacks.

AB - MISTY is a data encryption algorithm recently proposed by M. Matsui from Mitsubishi Electric Corporation. This paper focuses on cryptographic roles of the transform used in the MISTY cipher. Our research reveals that when used for constructing pseudorandom permutations, the transform employed by the MISTY cipher is inferior to the transform in DES, though the former is superior to the latter in terms of strength against linear and differential attacks. More specifically, we show that a 3-round (4-round, respectively) concatenation of transforms used in the MISTY cipher is not a pseudorandom (super pseudorandom, respectively) permutation. For comparison, we note that with three (four, respectively) rounds, transforms used in DES yield a pseudorandom (super pseudorandom, respectively) permutation. Another contribution of this paper is to show that a 3-round concatenation of transforms used in (the preliminary version of) the MISTY cipher has an algebraic property, which may open a door for various cryptanalytic attacks.

UR - http://www.scopus.com/inward/record.url?scp=84990204529&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84990204529&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84990204529

SN - 3540620486

SN - 9783540620488

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 376

EP - 385

BT - Algorithms and Computation - 7th International Symposium, ISAAC 1996, Proceedings

A2 - Nagamochi, Hiroshi

A2 - Miyano, Satoru

A2 - Asano, Tetsuo

A2 - Igarashi, Yoshihide

A2 - Suri, Subhash

PB - Springer Verlag

ER -