The iterated random permutation problem with applications to cascade encryption
From MaRDI portal
Recommendations
Cites work
- A construction of a cipher from a single pseudorandom permutation.
- Cascade Encryption Revisited
- Communication Theory of Secrecy Systems*
- Computational Indistinguishability Amplification: Tight Product Theorems for System Composition
- Decorrelation: a theory for block cipher security
- Indistinguishability Amplification
- Minimalism in cryptography: the Even-Mansour scheme revisited
- Security amplification for the cascade of arbitrarily weak PRPs. Tight bounds via the interactive hardcore lemma
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption
Cited in
(11)- A probabilistic cryptanalytic method for a time-variant permutation generator
- The iterated random function problem
- Lower bounds for key length of k-wise almost independent permutations and certain symmetric-key encryption schemes
- Analysis of the single-permutation encrypted Davies-Meyer construction
- Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
- Permuted puzzles and cryptographic hardness
- A simple variant of the Merkle-Damgård scheme with a permutation
- The action of a few random permutations on r-tuples and an application to cryptography
- On the power of cascade ciphers
- A Simple Variant of the Merkle-Damgård Scheme with a Permutation
- On the resilience of Even-Mansour to invariant permutations
This page was built for publication: The iterated random permutation problem with applications to cascade encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457118)