Minimalism in Cryptography: The Even-Mansour Scheme Revisited
暂无分享,去创建一个
[1] Kaoru Kurosawa,et al. Power of a Public Random Permutation and Its Application to Authenticated Encryption , 2010, IEEE Transactions on Information Theory.
[2] Eli Biham,et al. Differential Cryptanalysis of the Data Encryption Standard , 1993, Springer New York.
[3] Robert W. Floyd,et al. Nondeterministic Algorithms , 1967, JACM.
[4] Mitsuru Matsui,et al. The First Experimental Cryptanalysis of the Data Encryption Standard , 1994, CRYPTO.
[5] Joan Daemen,et al. Limitations of the Even-Mansour Construction , 1991, ASIACRYPT.
[6] Alex Biryukov,et al. Advanced Slide Attacks , 2000, EUROCRYPT.
[7] Adi Shamir,et al. Improved Attacks on Full GOST , 2012, IACR Cryptol. ePrint Arch..
[8] Yishay Mansour,et al. A Construction of a Cioher From a Single Pseudorandom Permutation , 1991, ASIACRYPT.
[9] Eli Biham,et al. Improved Slide Attacks , 2007, FSE.
[10] Alex Biryukov,et al. Slide Attacks , 1999, FSE.
[11] R. Rivest,et al. Advances in Cryptology - ASIACRYPT '91: International Conference on the Theory and Application of Cryptology, Fujiyoshida, Japan, November 11-14, 1991. Proceedings , 1993 .
[12] David A. Wagner,et al. A Generalized Birthday Problem , 2002, CRYPTO.
[13] Serge Vaudenay,et al. Provable Security for Block Ciphers by Decorrelation , 1998, STACS.
[14] Gabriel Nivasch,et al. Cycle detection using a stack , 2004, Inf. Process. Lett..
[15] Serge Vaudenay,et al. Decorrelation: A Theory for Block Cipher Security , 2003, Journal of Cryptology.
[16] Yishay Mansour,et al. A construction of a cipher from a single pseudorandom permutation , 1997, Journal of Cryptology.