Alternating Product Ciphers: A Case for Provable Security Comparisons
From MaRDI portal
Publication:2872040
DOI10.1007/978-3-319-03515-4_3zbMATH Open1295.94131arXiv1307.4107OpenAlexW1561764117MaRDI QIDQ2872040
Publication date: 14 January 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1307.4107
This page was built for publication: Alternating Product Ciphers: A Case for Provable Security Comparisons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2872040)
