Cascade Encryption Revisited

  • Peter Gaži
  • Ueli Maurer
Conference paper

DOI: 10.1007/978-3-642-10366-7_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5912)
Cite this paper as:
Gaži P., Maurer U. (2009) Cascade Encryption Revisited. In: Matsui M. (eds) Advances in Cryptology – ASIACRYPT 2009. ASIACRYPT 2009. Lecture Notes in Computer Science, vol 5912. Springer, Berlin, Heidelberg

Abstract

The security of cascade blockcipher encryption is an important and well-studied problem in theoretical cryptography with practical implications. It is well-known that double encryption improves the security only marginally, leaving triple encryption as the shortest reasonable cascade. In a recent paper, Bellare and Rogaway showed that in the ideal cipher model, triple encryption is significantly more secure than single and double encryption, stating the security of longer cascades as an open question.

In this paper, we propose a new lemma on the indistinguishability of systems extending Maurer’s theory of random systems. In addition to being of independent interest, it allows us to compactly rephrase Bellare and Rogaway’s proof strategy in this framework, thus making the argument more abstract and hence easy to follow. As a result, this allows us to address the security of longer cascades. Our result implies that for blockciphers with smaller key space than message space (e.g. DES), longer cascades improve the security of the encryption up to a certain limit. This partially answers the open question mentioned above.

Keywords

cascade encryption ideal cipher model random system indistinguishability 
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Peter Gaži
    • 1
    • 2
  • Ueli Maurer
    • 1
  1. 1.Department of Computer ScienceETH ZürichSwitzerland
  2. 2.Department of Computer ScienceComenius UniversityBratislavaSlovakia

Personalised recommendations