Cryptology ePrint Archive: Report 2016/825

Cascade Ciphers Revisited: Indifferentiability Analysis

Chun Guo and Dongdai Lin and and Meicheng Liu

Abstract: Shannon defined an ideal $(\kappa,n)$-blockcipher as a secrecy system consisting of $2^{\kappa}$ independent $n$-bit random permutations.

This work revisits the following question: in the ideal cipher model, can a cascade of several ideal $(\kappa,n)$-blockciphers realize $2^{2\kappa}$ independent $n$-bit random permutations, i.e. an ideal $(2\kappa,n)$-blockcipher? The motivation goes back to Shannon's theory on product secrecy systems, and similar question was considered by Even and Goldreich (CRYPTO '83) in different settings. Towards giving an answer, this work analyzes cascading independent ideal $(\kappa,n)$-blockciphers with two alternated independent keys in the indifferentiability framework of Maurer et al. (TCC 2004), and proves that for such alternating-key cascade, four stages is necessary and sufficient to achieve indifferentiability from an ideal $(2\kappa,n)$-blockcipher. This shows cascade capable of achieving key-length extension in the settings where keys are _not necessarily secret_.

Category / Keywords: secret-key cryptography / blockcipher, cascade, ideal cipher, indifferentiability.

Date: received 25 Aug 2016, last revised 30 Aug 2016

Contact author: guochun at iie ac cn

Available format(s): PDF | BibTeX Citation

Version: 20160830:210037 (All versions of this report)

Short URL: ia.cr/2016/825

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]