Adaptive-Attack Norm for Decorrelation and Super-Pseudorandomness
暂无分享,去创建一个
[1] Ueli Maurer. A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generator , 1992, EUROCRYPT.
[2] Serge Vaudenay,et al. Provable Security for Block Ciphers by Decorrelation , 1998, STACS.
[3] Michael Luby,et al. How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract) , 1986, CRYPTO.
[4] Jacques Stern,et al. Decorrelated Fast Cipher: an AES Candidate , 1998 .
[5] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..
[6] Larry Carter,et al. New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..
[7] Jacques Patarin,et al. How to Construct Pseudorandom and Super Pseudorandom Permutations from one Single Pseudorandom Function , 1992, EUROCRYPT.
[8] Xuejia Lai,et al. On the design and security of block ciphers , 1992 .
[9] Serge Vaudenay,et al. On the Lai-Massey Scheme , 1999, ASIACRYPT.
[10] Xuejia Lai,et al. A Proposal for a New Block Encryption Standard , 1991, EUROCRYPT.
[11] Serge Vaudenay,et al. Resistance Against General Iterated Attacks , 1999, EUROCRYPT.
[12] Jacques Stern,et al. Decorrelated Fast Cipher: an AES Candidate (Extended Abstract) , 1998 .
[13] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[14] Serge Vaudenay,et al. Feistel Ciphers with L2-Decorrelation , 1998, Selected Areas in Cryptography.
[15] H. Feistel. Cryptography and Computer Privacy , 1973 .