Results of Switching-Closure-Test on FEAL (Extended Abstract)
暂无分享,去创建一个
The closure tests, CCT and MCT, were introduced to analyze the algebraic properties of cryptosystems by Kaliski et al. [KaRiSh]. If a cryptosystem is closed, the tests give the same results “Fail” and the cryptosystem might be breakable. Though CCT requires much less memory and time than MCT, we cannot apply CCT to check cryptosystems having the same data and key block lengths such as FEAL with non-parity mode. Because CCT utilizes the differences in data and key block lengths.
[1] Shoji Miyaguchi,et al. Fast Data Encipherment Algorithm FEAL , 1987, EUROCRYPT.
[2] Alan T. Sherman,et al. Is the data encryption standard a group , 1986 .
[3] Kazuo Ohta,et al. A Switching Closure Test to Analyze Cryptosystems , 1991, CRYPTO.
[4] Jean-Jacques Quisquater,et al. How Easy is Collision Search. New Results and Applications to DES , 1989, CRYPTO.