Abstract
An algebraic method is given for a chosen plaintext cryptanalysis of the Nippon Telegraph and Telephone Corporation's FEAL-4 block cipher. The method given uses 20 chosen plaintexts, but can be adapted to use as few as four chosen plaintexts.
Article PDF
Similar content being viewed by others
References
B. Den Boer, Cryptanalysis of FEAL, Advances in Cryptology—Eurocrypt 88, Lecture Notes in Computer Science, Vol. 330, Springer-Verlag, Berlin, 1989.
A. Shimizu and S. Miyaguchi, Fast Data Encipherment Algorithm FEAL, Advances in Cryptology—Eurocrypt 87, Lecture Notes in Computer Science, Vol. 304, Springer-Verlag, Berlin, 1988
Author information
Authors and Affiliations
Additional information
This research was supported by S.E.R.C. Research Grant GR/E 64640.
Rights and permissions
About this article
Cite this article
Murphy, S. The cryptanalysis of FEAL-4 with 20 chosen plaintexts. J. Cryptology 2, 145–154 (1990). https://doi.org/10.1007/BF00190801
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00190801