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. © 2013 Springer International Publishing Switzerland.
CITATION STYLE
Pliam, J. O. (2013). Alternating product ciphers: A case for provable security comparisons (Extended Abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8250 LNCS, pp. 38–49). Springer Verlag. https://doi.org/10.1007/978-3-319-03515-4_3
Mendeley helps you to discover research relevant for your work.