eprint.iacr.org will be offline for approximately an hour
for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between
April 12 and April 14, and some authors have been notified that they need to resubmit their papers.
Paper 2016/1087
CENC is Optimally Secure
Tetsu Iwata, Bart Mennink, and Damian Vizár
Abstract
At FSE 2006, Iwata introduced the CENC encryption mode and proved its security up to 2^{2n/3} plaintext blocks processed in total. He conjectured optimal security up to a constant. In this brief note, we confirm this conjecture. Rather than proving it ourselves, we point out that the conjecture's proof follows as a corollary of Patarin's ``Theorem P_i xor P_j for any xi_max'' from 2010. This connection appears to have remained unnoticed, and the sole purpose of this brief note is to make the connection explicit.
Note: updated references
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- encryption modeCENCoptimal secure
- Contact author(s)
- bart mennink @ esat kuleuven be
- History
- 2016-11-21: revised
- 2016-11-21: received
- See all versions
- Short URL
- https://ia.cr/2016/1087
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/1087,
author = {Tetsu Iwata and Bart Mennink and Damian Vizár},
title = {CENC is Optimally Secure},
howpublished = {Cryptology ePrint Archive, Paper 2016/1087},
year = {2016},
note = {\url{https://eprint.iacr.org/2016/1087}},
url = {https://eprint.iacr.org/2016/1087}
}
