Paper 2013/430

Security of the Misty Structure Beyond the Birthday Bound

Jooyoung Lee

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^{\frac{rn}{r+7}})$ query complexity, where $n$ is the size of each round permutation. So for any $\epsilon>0$, a sufficient number of rounds would guarantee the security of the Misty structure up to $2^{n(1-\epsilon)}$ query complexity.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Published elsewhere. Unknown status
Contact author(s)
jlee05 @ sejong ac kr
History
2014-01-19: revised
2013-07-05: received
See all versions
Short URL
https://ia.cr/2013/430
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2013/430,
      author = {Jooyoung Lee},
      title = {Security of the Misty Structure Beyond the Birthday Bound},
      howpublished = {Cryptology ePrint Archive, Paper 2013/430},
      year = {2013},
      note = {\url{https://eprint.iacr.org/2013/430}},
      url = {https://eprint.iacr.org/2013/430}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.