Security of the Misty Structure Beyond the Birthday Bound

In this paper, we first prove beyond-birthyday-bound security for the Misty structure. Specifically, we show that an r-round Misty structure is secure against CCA attacks up to O(2 rn r+7 ) query complexity, where n is the size of each round permutation. So for any > 0, a sufficient number of rounds would guarantee the security of the Misty structure up to 2n(1− ) query complexity.

[1]  Jacques Patarin.  Luby-rackoff: 7 rounds are enough for 2n(1-ε) security , 2003 .

[2]  Jean-Jacques Quisquater,et al.  Security of the MISTY Structure in the Luby-Rackoff Model: Improved Results , 2004, Selected Areas in Cryptography.

[3]  Phillip Rogaway,et al.  An Enciphering Scheme Based on a Card Shuffle , 2012, CRYPTO.

[4]  Mitsuru Matsui,et al.  New Block Encryption Algorithm MISTY , 1997, FSE.

[5]  Marine Minier,et al.  New Results on the Pseudorandomness of Some Blockcipher Constructions , 2001, FSE.

[6]  Kaoru Kurosawa,et al.  Non-cryptographic primitive for pseudorandom permutation , 2003, Theor. Comput. Sci..

[7]  K. Sakurai,et al.  On Non-Pseudorandomness from Block Ciphers with Provable Immunity Against Linear Cryptanalysis (Special Section on Cryptography and Information Security) , 1997 .

[8]  Ueli Maurer,et al.  Indistinguishability Amplification , 2007, CRYPTO.

[9]  Jooyoung Lee,et al.  Security of the Misty Structure Using Involutions as Round Functions , 2010, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[10]  Phillip Rogaway,et al.  How to Encipher Messages on a Small Domain , 2009, CRYPTO.

[11]  Phillip Rogaway,et al.  On Generalized Feistel Networks , 2010, CRYPTO.

[12]  Yannick Seurin,et al.  An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher , 2012, ASIACRYPT.

[13]  Jacques Patarin,et al.  About Feistel Schemes with Six (or More) Rounds , 1998, FSE.

[14]  Jooyoung Lee,et al.  Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption , 2013, EUROCRYPT.

[15]  Jacques Patarin,et al.  New Results on Pseudorandom Permutation Generators Based on the DES Scheme , 1991, CRYPTO.

[16]  Jacques Patarin,et al.  Luby-Rackoff: 7 Rounds Are Enough for 2n(1-epsilon)Security , 2003, CRYPTO.

[17]  Jacques Patarin,et al.  Generic Attacks on Feistel Schemes , 2001, ASIACRYPT.

[18]  Kaoru Kurosawa,et al.  Round Security and Super-Pseudorandomness of MISTY Type Structure , 2001, FSE.

[19]  Jacques Patarin,et al.  Security of Random Feistel Schemes with 5 or More Rounds , 2004, CRYPTO.