The Iterated Random Permutation Problem with Applications to Cascade Encryption

DOI10.1007/978-3-662-47989-6_17zbMath1375.94151OpenAlexW1409884601MaRDI QIDQ3457118

Brice Minaud, Yannick Seurin

Publication date: 10 December 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-662-47989-6_17

zbMATH Keywords

block cipherpseudorandom permutationcascade encryptioniterated random permutation problem

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Related Items (3)

On the resilience of Even-Mansour to invariant permutations ⋮ Analysis of the single-permutation encrypted Davies-Meyer construction ⋮ Mind the composition: birthday bound attacks on EWCDMD and SoKAC21

Cites Work

• A construction of a cipher from a single pseudorandom permutation.
• Decorrelation: a theory for block cipher security
• Minimalism in Cryptography: The Even-Mansour Scheme Revisited
• Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma
• Computational Indistinguishability Amplification: Tight Product Theorems for System Composition
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• Indistinguishability Amplification
• Communication Theory of Secrecy Systems*
• Cascade Encryption Revisited
• Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption

This page was built for publication: The Iterated Random Permutation Problem with Applications to Cascade Encryption