A New Method for Known Plaintext Attack of FEAL Cipher

  • Mitsuru Matsui
  • Atsuhiro Yamagishi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 658)


We propose a new known plaintext attack of FEAL cipher. Our method differs from previous statistical ones in point of deriving the extended key in definite way. As a result, it is possible to break FEAL-4 with 5 known plaintexts and FEAL-6 with 100 known plaintexts respectively. Moreover, we show a method to break FEAL-8 with 215 known plaintexts faster than an exhaustive search.


  1. [SM]
    A. Shimizu and S. Miyaguchi, “Fast Data Encipherment Algorithm FEAL,” Advances in Cryptology, Proceedings of EUROCRYPT’ 87, pp. 267, 1987.Google Scholar
  2. [MKOM]
    S. Miyaguchi, S. Kurihara, K. Ohta and H. Morita, “Expansion of FEAL cipher,” NTT Review Vol.2 No.6, pp. 116–127, 1990.Google Scholar
  3. [BS]
    E. Biham and A. Shamir, “Differential Cryptanalysis of FEAL and N-Hash,” Extended Abstract, Proceedings of EUROCRYPT’ 91, 1991.Google Scholar
  4. [TG]
    A. Tardy-Corfdir and H. Gilbert, “A known plaintext attack of FEAL-4 and FEAL-6,” Proceedings of Crypto’ 91, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Mitsuru Matsui
    • 1
  • Atsuhiro Yamagishi
    • 1
  1. 1.Computer & Information Systems LaboratoryMitsubishi Electric CorporationKanagawaJapan

Personalised recommendations