when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-10169

Iwata, Tetsu

Tightness of the Security Bound of CENC

Dokument 1.pdf (144 KB)


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.

BibTeX - Entry

  author =	{Tetsu Iwata},
  title =	{Tightness of the Security Bound of CENC},
  booktitle =	{Symmetric Cryptography},
  year =	{2007},
  editor =	{Eli Biham and Helena Handschuh and Stefan Lucks and Vincent Rijmen},
  number =	{07021},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{},
  annote =	{Keywords: Encryption mode, blockcipher, CENC, provable security}

Keywords: Encryption mode, blockcipher, CENC, provable security
Seminar: 07021 - Symmetric Cryptography
Issue date: 2007
Date of publication: 06.06.2007

DROPS-Home | Fulltext Search | Imprint Published by LZI