Abstract
It is important to find the best linear expression to estimate the vulnerability of crytosystems to Linear Cryptanalysis. This paper presents a method to improve Matsui’s search algorithm which determines the best linear expression. This method is based on analyzing the dominant factor of search complexity. We introduce the search pattern in order to reduce unnecessary search candidates, and apply the proposed search algorithm to DES and FEAL. The n-round best linear expressions of DES are found as fast as Matsui’s algorithm for n ≤ 32. Those of FEAL are found much faster than his algorithm; the required time is decreased from over three months to about two and a half days. New results for FEAL are also described; we find the n-round best linear expressions (n ≤ 32) with higher deviations than those derived from Biham’s 4-round iterative linear approximations.
Affiliation during this work: Department of Mathematics, School of Science and Engineering, Waseda University.
Chapter PDF
Similar content being viewed by others
References
E. Biham: “On Matsui’s Linear Cryptanalysis (extended abstract),” Preproceedings of EUROCRYPT’94, 1994
L. R. Knudsen: “Iterative Characteristics of DES and s 2-DES,” Advances in Cryptology — EUROCRYPT’92, Springer-Verlag 658, 1993
B. S. Kaliski Jr. and M. J. B. Robshaw: “Linear Cryptanalysis Using Multiple Approximations,” Advances in Cryptology — CRYPTO’94, Springer-Verlag 839, 1994
K. Nyberg: “Linear Approximation of Block Ciphers,” Preproceedings of EUROCRYPT’94, 1994
M. Matsui: “Linear Cryptanalysis Method for DES Cipher,” Advances in Cryptology — EUROCRYPT’93, Springer-Verlag 765, 1994
M. Matsui: “On Correlation between the order of S-Boxes and the Strength of DES (extended abstract),” Preproceedings of EUROCRYPT’94, 1994
S. Moriai, K. Aoki and K. Ohta: “The Best Linear Expression Search of FEAL,” IEICE Trans. Fundamentals, Vol. E79-A, No. 1, 1996 (to appear)
S. Miyaguchi, A. Shiraishi and A. Shimizu: “Fast Data Encipherment algorithm FEAL-8,” Review of Electrical Communication Laboratories, Vol. 36, No. 4, 1988
K. Ohta and K. Aoki: “Linear Cryptanalysis of the Fast Data Encipherment Algorithm,” Advances in Cryptology — CRYPTO’94, Springer-Verlag 839, 1994
T. Tokita, T. Sorimachi and M. Matsui: “Linear cryptanalysis of LOKI and s2DES (extended abstract),” Preproceedings of ASIACRYPT’94, 1994
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ohta, K., Moriai, S., Aoki, K. (1995). Improving the Search Algorithm for the Best Linear Expression. In: Coppersmith, D. (eds) Advances in Cryptology — CRYPT0’ 95. CRYPTO 1995. Lecture Notes in Computer Science, vol 963. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44750-4_13
Download citation
DOI: https://doi.org/10.1007/3-540-44750-4_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60221-7
Online ISBN: 978-3-540-44750-4
eBook Packages: Springer Book Archive