Linear Cryptanalysis Using Multiple Approximations

作者: Burton S. Kaliski , M. J. B. Robshaw

DOI: 10.1007/3-540-48658-5_4

关键词:

摘要: We present a technique which aids in the linear cryptanalysis of block cipher and allows for reduction amount data required successful attack. note limits this extension when applied to DES, but illustrate that it is generally applicable might be exceptionally other ciphers. This forces us reconsider some initial attempts quantify resistance ciphers cryptanalysis, by taking account new we cover several issues have not yet been considered.

参考文章(10)
Akihiro Shimizu, Shoji Miyaguchi, Fast data encipherment algorithm FEAL theory and application of cryptographic techniques. pp. 267- 278 ,(1987) , 10.1007/3-540-39118-5_24
Mitsuru Matsui, Atsuhiro Yamagishi, A new method for known plaintext attack of FEAL cipher theory and application of cryptographic techniques. pp. 81- 91 ,(1992) , 10.1007/3-540-47555-9_7
Mitsuru Matsui, Linear cryptanalysis method for DES cipher theory and application of cryptographic techniques. pp. 386- 397 ,(1994) , 10.1007/3-540-48285-7_33
Lars R. Knudsen, Practically Secure Feistel Cyphers fast software encryption. pp. 211- 221 ,(1993) , 10.1007/3-540-58108-1_26
Luke O’Connor, On the distribution of characteristics in bijective mappings theory and application of cryptographic techniques. pp. 360- 370 ,(1994) , 10.1007/3-540-48285-7_31
Rainer A. Rueppel, Advances in Cryptology--Eurocrypt '92 ,(1993)
David Chaum, Wyn L. Price, Advances in Cryptology: Eurocrypt '87 ,(1988)