Paper 2013/430 Original: eprint.iacr.org/2013/430 ↗
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^{\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
- Preprint.
- History
- 2014-01-19: last updated
- 2013-07-05: published
- Short URL
- https://ia.cr/2013/430
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2013/430}
}