The sum of PRPs is a secure PRF
From MaRDI portal
Recommendations
Cited in
(33)- Full indifferentiable security of the XOR of two or more random permutations using the ^2 method
- Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
- A note on the chi-square method: a tool for proving cryptographic security
- Analysis of the single-permutation encrypted Davies-Meyer construction
- The summation-truncation hybrid: reusing discarded bits for free
- Beyond-birthday secure domain-preserving PRFs from a single permutation
- Beyond birthday bound secure fresh rekeying: application to authenticated encryption
- How to build optimally secure PRFs using block ciphers
- On the XOR of multiple random permutations
- Robust pseudo-random number generators with input secure against side-channel attacks
- Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- Building blockcipher from tweakable blockcipher: extending FSE 2009 proposal
- Random number generators based on permutations can pass the collision test
- A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
- A Generic Method to Design Modes of Operation Beyond the Birthday Bound
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- Keyed sum of permutations: a simpler RP-based PRF
- Multi-user security of the sum of truncated random permutations
- Improved multi-user security using the squared-ratio method
- Luby-Rackoff backwards with more users and more security
- The Relation Between CENC and NEMO
- Revisiting the indifferentiability of the sum of permutations
- \textsf{LightMAC}: fork it and make it faster
- Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis
- On the number of restricted solutions to constrained systems and their applications
- Minimizing beyond-birthday-bound secure permutation-based pseudorandom function
- Combining outputs of a random permutation: new constructions and tight security bounds by Fourier analysis
- Proving the security of the extended summation-truncation hybrid
- General practical cryptanalysis of the sum of round-reduced block ciphers and ZIP-AES
- Upper bound on information-theoretic security of permutation-based pseudorandom functions
- How to build a short-input random oracle from public random permutations
- Block cipher doubling for a post-quantum world
This page was built for publication: The sum of PRPs is a secure PRF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374930)
