Round Security and Super-Pseudorandomness of MISTY Type Structure
暂无分享,去创建一个
[1] Stefan Lucks,et al. Faster Luby-Rackoff Ciphers , 1996, FSE.
[2] K. Sakurai,et al. On Non-Pseudorandomness from Block Ciphers with Provable Immunity Against Linear Cryptanalysis (Special Section on Cryptography and Information Security) , 1997 .
[3] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[4] Michael Luby,et al. How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract) , 1986, CRYPTO.
[5] Larry Carter,et al. New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..
[6] Jacques Patarin. Pseudorandom Permutations Based on the D.E.S. Scheme , 1990, ESORICS.
[7] Jacques Patarin,et al. New Results on Pseudorandom Permutation Generators Based on the DES Scheme , 1991, CRYPTO.
[8] Zulfikar Ramzan,et al. On the Round Security of Symmetric-Key Cryptographic Primitives , 2000, CRYPTO.
[9] Lars R. Knudsen,et al. Provable Security Against a Differential Attack , 1994 .
[10] Mitsuru Matsui,et al. New Block Encryption Algorithm MISTY , 1997, FSE.
[11] Mitsuru Matsui,et al. New Structure of Block Ciphers with Provable Security against Differential and Linear Cryptanalysis , 1996, FSE.