Alternating product ciphers: a case for provable security comparisons (extended abstract)

DOI10.1007/978-3-319-03515-4_3MaRDI QIDQ2872040zbMATH OpenOpenAlexFDO

Authors John O. Pliam

Publication date 14 January 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1307.4107

zbMATH Keywords

majorizationblock ciphersmultiple encryptionproduct ciphers

Mathematics Subject Classification ID

Cryptography (94A60)

Abstract: We formally study iterated block ciphers that alternate between two sequences of independent and identically distributed (i.i.d.) rounds. It is demonstrated that, in some cases the effect of alternating increases security, while in other cases the effect may strictly decrease security relative to the corresponding product of one of its component sequences. As this would appear to contradict conventional wisdom based on the ideal cipher approximation, we introduce new machinery for provable security comparisons. The comparisons made here simultaneously establish a coherent ordering of security metrics ranging from key-recovery cost to computational indistinguishability.

Recommendations

• An asymptotically tight security analysis of the iterated Even-Mansour cipher
• Tight security bounds for key-alternating ciphers
• Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract)
• The security of multiple encryption in the ideal cipher model
• scientific article; zbMATH DE number 708833

This page was built for publication: Alternating product ciphers: a case for provable security comparisons (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2872040)