Security of the Misty Structure beyond the Birthday Bound

Jooyoung LEE

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E97-A    No.7    pp.1516-1522
Publication Date: 2014/07/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E97.A.1516
Type of Manuscript: PAPER
Category: Cryptography and Information Security
misty structure,  blockcipher,  indistinguishability,  pseudorandomness,  coupling,  

Full Text: PDF(356.8KB)>>
Buy this Article

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^{ rac{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.

open access publishing via