A randomness test for block ciphers

作者: Vasilios Katos

DOI: 10.1016/J.AMC.2003.12.122

关键词:

摘要: This paper describes a randomness test which can be used to measure the cryptographic strength of block cipher or its underlying primitive(s). Cryptographic in context this is related ability round function produce random output turn defined as distance between theoretical calculation and an experimental measure. The measurements are based on diffusion characteristic cipher. Potentially, for proposed could distinguisher diffusion.

参考文章(14)
Ross Anderson, Eli Biham, Two Practical and Provably Secure Block Ciphers: BEARS and LION fast software encryption. pp. 113- 120 ,(1996) , 10.1007/3-540-60865-6_48
Henry Beker, Frederick Charles Piper, J. E Hopkins, Cipher Systems: The Protection of Communications ,(1982)
Joan Daemen, Vincent Rijmen, The Block Cipher Rijndael Lecture Notes in Computer Science. pp. 277- 284 ,(2000) , 10.1007/10721064_26
Bruce Schneier, John Kelsey, Unbalanced Feistel Networks and Block Cipher Design fast software encryption. pp. 121- 144 ,(1996) , 10.1007/3-540-60865-6_49
Eli Biham, Adi Shamir, Differential cryptanalysis of DES-like cryptosystems international cryptology conference. ,vol. 4, pp. 2- 21 ,(1990) , 10.1007/BF00630563
Charles P. Pfleeger, Security in Computing ,(1988)
O. Goldreich, S. Goldwasser, S. Micali, How To Construct Randolli Functions 25th Annual Symposium onFoundations of Computer Science, 1984.. pp. 464- 479 ,(1984) , 10.1109/SFCS.1984.715949
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