Cryptanalysis of Iterated Even-Mansour Schemes with Two Keys
暂无分享,去创建一个
Eli Biham | Adi Shamir | Itai Dinur | Orr Dunkelman | Yaniv Carmeli | Nathan Keller | A. Shamir | E. Biham | O. Dunkelman | Nathan Keller | Itai Dinur | Y. Carmeli
[1] Martin E. Hellman,et al. A cryptanalytic time-memory trade-off , 1980, IEEE Trans. Inf. Theory.
[2] Shuang Wu,et al. Cryptanalysis of Round-Reduced LED , 2015, IACR Cryptol. ePrint Arch..
[3] John P. Steinberger,et al. Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations , 2012, IACR Cryptol. ePrint Arch..
[4] Antoine Joux,et al. Multi-user collisions: Applications to Discrete Logs, Even-Mansour and Prince , 2013, IACR Cryptol. ePrint Arch..
[5] Anne Canteaut,et al. PRINCE - A Low-Latency Block Cipher for Pervasive Computing Applications - Extended Abstract , 2012, ASIACRYPT.
[6] Adi Shamir,et al. Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems , 2012, CRYPTO.
[7] Kazue Sako,et al. Advances in cryptology -- ASIACRYPT 2012 : 18th International Conference on the Theory and Application of Cryptology and Information Security, Beijing, China, December 2-6 2012 : proceedings , 2012 .
[8] Thomas Peyrin,et al. The LED Block Cipher , 2011, IACR Cryptol. ePrint Arch..
[9] Kyoji Shibutani,et al. Security Analysis of the Lightweight Block Ciphers XTEA, LED and Piccolo , 2012, ACISP.
[10] Xiaoli Yu,et al. Reflection Cryptanalysis of PRINCE-Like Ciphers , 2013, Journal of Cryptology.
[11] Jacques Patarin. Improved security bounds for pseudorandom permutations , 1997, CCS '97.
[12] Yannick Seurin,et al. An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher , 2012, ASIACRYPT.
[13] Jacques Patarin,et al. Luby-Rackoff: 7 Rounds Are Enough for 2n(1-epsilon)Security , 2003, CRYPTO.
[14] Adi Shamir,et al. Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES2 , 2013, IACR Cryptol. ePrint Arch..
[15] Yu Sasaki,et al. Preimage Attacks on One-Block MD4, 63-Step MD5 and More , 2009, Selected Areas in Cryptography.
[16] Paul C. van Oorschot,et al. A Known Plaintext Attack on Two-Key Triple Encryption , 1991, EUROCRYPT.
[17] Jacques Patarin,et al. Security of Random Feistel Schemes with 5 or More Rounds , 2004, CRYPTO.
[18] Hideki Imai,et al. Advances in Cryptology — ASIACRYPT '91 , 1991, Lecture Notes in Computer Science.
[19] Shuang Wu,et al. Cryptanalysis of Round-Reduced \mathttLED , 2013, FSE.
[20] Yishay Mansour,et al. A construction of a cipher from a single pseudorandom permutation , 1997, Journal of Cryptology.
[21] Yannick Seurin,et al. On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction , 2011, IACR Cryptol. ePrint Arch..
[22] Eli Biham,et al. A Practical Attack on KeeLoq , 2008, Journal of Cryptology.
[23] David Chaum,et al. Advances in Cryptology , 1983, Springer US.
[24] Paul C. van Oorschot,et al. Parallel Collision Search with Cryptanalytic Applications , 2013, Journal of Cryptology.
[25] Adi Shamir,et al. Minimalism in Cryptography: The Even-Mansour Scheme Revisited , 2012, EUROCRYPT.
[26] Michael Luby,et al. How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract) , 1986, CRYPTO.
[27] Joan Daemen,et al. Limitations of the Even-Mansour Construction , 1991, ASIACRYPT.
[28] Orhun Kara,et al. Reflection Cryptanalysis of Some Ciphers , 2008, INDOCRYPT.
[29] John P. Steinberger,et al. On the Indifferentiability of Key-Alternating Ciphers , 2013, IACR Cryptol. ePrint Arch..
[30] Antoine Joux,et al. Multi-user Collisions: Applications to Discrete Logarithm, Even-Mansour and PRINCE , 2014, ASIACRYPT.
[31] Martin E. Hellman,et al. On the security of multiple encryption , 1981, CACM.
[32] Vincent Rijmen,et al. Differential Analysis of the LED Block Cipher , 2012, IACR Cryptol. ePrint Arch..
[33] Yishay Mansour,et al. A Construction of a Cioher From a Single Pseudorandom Permutation , 1991, ASIACRYPT.