Generic attacks for the Xor of k random permutations
From MaRDI portal
Publication:2873646
DOI10.1007/978-3-642-38980-1_10zbMATH Open1330.94047OpenAlexW133406998MaRDI QIDQ2873646FDOQ2873646
Authors: Jacques Patarin 
Publication date: 24 January 2014
Published in: Applied Cryptography and Network Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38980-1_10
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)
- Luby-Rackoff backwards with more users and more security
- XOR of PRPs in a quantum world
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- Improved truncated differential distinguishers of AES with concrete S-box
- Quantum attacks on PRFs based on public 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
- The indistinguishability of the XOR of \(k\) permutations
- Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis
- Title not available (Why is that?)
- Low-memory attacks against two-round Even-Mansour using the 3-XOR problem
- Indifferentiability beyond the birthday bound for the xor of two public random permutations
- On the XOR of multiple random permutations
- Algebraic key-recovery attacks on reduced-round Xoofff
- Truncated differential properties of the diagonal set of inputs for 5-round AES
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)
