Improving the Search Algorithm for the Best Linear Expression

@article{citeulike:2878444, abstract = {It is important to find the best linear expression to estimate the vulnerability of cryptosystems 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...}, author = {Ohta, Kazuo and Moriai, Shiho and Aoki, Kazumaro }, citeulike-article-id = {2878444}, journal = {Lecture Notes in Computer Science}, keywords = {expression, linear, search}, posted-at = {2008-06-10 03:25:53}, priority = {4}, title = {Improving the Search Algorithm for the Best Linear Expression}, url = {http://citeseer.ist.psu.edu/ohta95improving.html}, volume = {963}, year = {1995} }

TY - JOUR ID - citeulike:2878444 L3 - citeulike-article-id:2878444 N2 - It is important to find the best linear expression to estimate the vulnerability of cryptosystems 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... JF - Lecture Notes in Computer Science TI - Improving the Search Algorithm for the Best Linear Expression VL - 963 KW - expression KW - linear KW - search AU - Ohta, Kazuo AU - Moriai, Shiho AU - Aoki, Kazumaro PY - 1995/// UR - http://citeseer.ist.psu.edu/ohta95improving.html ER -