On the XOR of multiple random permutations
From MaRDI portal
Recommendations
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- Generic attacks for the Xor of k 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 ^2 method
Cites work
- scientific article; zbMATH DE number 1302860 (Why is no real title available?)
- scientific article; zbMATH DE number 1303128 (Why is no real title available?)
- scientific article; zbMATH DE number 1406792 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- A New Mode of Operation for Block Ciphers and Length-Preserving MACs
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- Chaskey: an efficient MAC algorithm for 32-bit microcontrollers
- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
- Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions
- Hash functions based on three permutations: a generic security analysis
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Indifferentiability beyond the birthday bound for the xor of two public random permutations
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Minimizing the two-round Even-Mansour cipher
- On the Indifferentiability of the Sponge Construction
- Security of Keyed Sponge Constructions Using a Modular Proof Approach
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- The indistinguishability of the XOR of k permutations
- The security of multiple encryption in the ideal cipher model
- The sum of PRPs is a secure PRF
- The “Coefficients H” Technique
- Theory of Cryptography
- Tight security bounds for key-alternating ciphers
Cited in
(28)- XOR of PRPs in a quantum world
- Multi-user security of the sum of truncated random permutations
- Security of truncated permutation without initial value
- On non-polynomiality of XOR over Z₂^n
- Luby-Rackoff backwards with more users and more security
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- Block-cipher-based tree hashing
- XPX: generalized tweakable Even-Mansour with improved security guarantees
- Probabilities of 2-Xor Functions
- XLS is not a strong pseudorandom permutation
- scientific article; zbMATH DE number 7746257 (Why is no real title available?)
- Keyed sum of permutations: a simpler RP-based PRF
- Full indifferentiable security of the XOR of two or more random permutations using the ^2 method
- The sum of PRPs is a secure PRF
- Revisiting the indifferentiability of the sum of permutations
- The indistinguishability of the XOR of k permutations
- On the number of restricted solutions to constrained systems and their applications
- A modular approach to the security analysis of two-permutation constructions
- Beyond-birthday secure domain-preserving PRFs from a single permutation
- Analysis of the single-permutation encrypted Davies-Meyer construction
- How to build pseudorandom functions from public random permutations
- 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
- Algebraic key-recovery attacks on reduced-round Xoofff
- Open problems in hash function security
- Generic attacks for the Xor of k random permutations
- Combining outputs of a random permutation: new constructions and tight security bounds by Fourier analysis
- A two-dimensional approach to flexibility degree of XOR numbers with application to group decision making
This page was built for publication: On the XOR of multiple random permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2794522)
