Abstract
I present a new attack of FEAL-4 blockcipher. The attack requires only 24 blocks of 8-byte randomly given known-plaintext. Using these blocks, we can break FEAL-4 with the probability of greater than 90%, in 14 seconds on a personal computer (cpu 80386 16MHz). It is based on the system of linear equations on the differences.
Preview
Unable to display preview. Download preview PDF.
References
A.Shimizu, S.Miyaguchi. “Fast Data Encipherment Algorithm FEAL”, Trans. of IEICE Vol.J70-D No. 7, pp. 1413–1423, (1987)
S.Miyaguchi. “The FEAL-8 Cryptosystem and a Call for Attack”, Lecture Note in Computer Science 435, CRYPTO'89, pp. 624–627
A.Tardy-Corfdir, H.Gilbert, “A Known Plaintext Attack of FEAL-4 and FEAL-6”, Crypto'91, (1991)
M.Matsui, A. Yamagishi. “A Study on Known Text Attack of Involution-type Cryptosystem”, Tech. Rep. of IEICE ISEC91-26 (1991)
T. Kaneko. “A Known plaintext cryptanalytic attack on FEAL-4”, Tech. Rep. of IEICE ISEC91-25 (1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaneko, T. (1993). A known-plaintext attack of FEAL-4 based on the system of linear equations on difference. In: Imai, H., Rivest, R.L., Matsumoto, T. (eds) Advances in Cryptology — ASIACRYPT '91. ASIACRYPT 1991. Lecture Notes in Computer Science, vol 739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57332-1_43
Download citation
DOI: https://doi.org/10.1007/3-540-57332-1_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57332-6
Online ISBN: 978-3-540-48066-2
eBook Packages: Springer Book Archive