DagSemProc.07021.10.pdf
- Filesize: 143 kB
- 6 pages
Document
Tightness of the Security Bound of CENC
Author
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 7021
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2007-06-06
Cite As Get BibTex
Tetsu Iwata. Tightness of the Security Bound of CENC. In Symmetric Cryptography. Dagstuhl Seminar Proceedings, Volume 7021, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
https://doi.org/10.4230/DagSemProc.07021.10
Abstract
This talk presents an overview of recently developed encryption mode for blockciphers, called CENC. CENC has the following advantages: (1) beyond the birthday bound security, (2) security proofs with the standard PRP assumption, (3) highly efficient, (4) single blockcipher key, (5) fully parallelizable, (6) allows precomputation of keystream, and (7) allows random access. Then we discuss the tightness of its security bound, and give a partial answer to the open problem posed at FSE 2006.
Subject Classification
Keywords
- Encryption mode
- blockcipher
- CENC
- provable security
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads