Paper Info
Title
Security Of The Misty Structure Beyond The Birthday Bound
Abstract
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 is an element of > 0, a sufficient number of rounds would guarantee the security of the Misty structure up to 2(n(1-is an element of)) query complexity.
Year
DOI
Venue
2014
10.1587/transfun.E97.A.1516
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
Keywords
DocType
Volume
misty structure, blockcipher, indistinguishability, pseudorandomness, coupling
Journal
E97A
Issue
ISSN
Citations 
7
0916-8508
0
PageRank 
References 
Authors
0.34
0
1
Name
Order
Citations
PageRank
Joo-Young Lee17712.36