Abstract
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.
Chapter PDF
Similar content being viewed by others
References
A. Shimizu and S. Miyaguchi, “Fast Data Encipherment Algorithm FEAL,” Advances in Cryptology, Proceedings of EUROCRYPT’ 87, pp. 267, 1987.
S. Miyaguchi, S. Kurihara, K. Ohta and H. Morita, “Expansion of FEAL cipher,” NTT Review Vol.2 No.6, pp. 116–127, 1990.
E. Biham and A. Shamir, “Differential Cryptanalysis of FEAL and N-Hash,” Extended Abstract, Proceedings of EUROCRYPT’ 91, 1991.
A. Tardy-Corfdir and H. Gilbert, “A known plaintext attack of FEAL-4 and FEAL-6,” Proceedings of Crypto’ 91, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matsui, M., Yamagishi, A. (1993). A New Method for Known Plaintext Attack of FEAL Cipher. In: Rueppel, R.A. (eds) Advances in Cryptology — EUROCRYPT’ 92. EUROCRYPT 1992. Lecture Notes in Computer Science, vol 658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47555-9_7
Download citation
DOI: https://doi.org/10.1007/3-540-47555-9_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56413-3
Online ISBN: 978-3-540-47555-2
eBook Packages: Springer Book Archive