Generic attacks for the Xor of k random permutations
From MaRDI portal
Publication:2873646
Recommendations
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- On the XOR of multiple random permutations
- The indistinguishability of the XOR of \(k\) permutations
- Indifferentiability beyond the birthday bound for the xor of two public random permutations
- Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method
Cited in
(15)- The indistinguishability of the XOR of \(k\) permutations
- Luby-Rackoff backwards with more users and more security
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- Low-memory attacks against two-round Even-Mansour using the 3-XOR problem
- XOR of PRPs in a quantum world
- On the XOR of multiple random permutations
- XLS is not a strong pseudorandom permutation
- Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method
- Algebraic key-recovery attacks on reduced-round Xoofff
- Truncated differential properties of the diagonal set of inputs for 5-round AES
- Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis
- Indifferentiability beyond the birthday bound for the xor of two public random permutations
- Improved truncated differential distinguishers of AES with concrete S-box
- Quantum attacks on PRFs based on public random permutations
- scientific article; zbMATH DE number 7758304 (Why is no real title available?)
This page was built for publication: Generic attacks for the Xor of \(k\) random permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2873646)
