The sum of PRPs is a secure PRF

zbMATH Open1082.94526MaRDI QIDQ3374930FDOQ3374930

Authors: Stefan Lucks 

Publication date: 1 March 2006

Recommendations

• The indistinguishability of the XOR of \(k\) permutations
• Beyond-birthday secure domain-preserving PRFs from a single permutation
• Keyed sum of permutations: a simpler RP-based PRF
• scientific article; zbMATH DE number 1302860
• On the XOR of multiple random permutations

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (25)

• Luby-Rackoff backwards with more users and more security
• Improved multi-user security using the squared-ratio method
• A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
• A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
• \textsf{LightMAC}: fork it and make it faster
• Robust pseudo-random number generators with input secure against side-channel attacks
• A note on the chi-square method: a tool for proving cryptographic security
• The Relation Between CENC and NEMO
• How to build optimally secure PRFs using block ciphers
• Keyed sum of permutations: a simpler RP-based PRF
• Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method
• Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
• Revisiting the indifferentiability of the sum of permutations
• Beyond-birthday secure domain-preserving PRFs from a single permutation
• Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers
• EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
• Analysis of the single-permutation encrypted Davies-Meyer construction
• Beyond birthday bound secure fresh rekeying: application to authenticated encryption
• Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis
• On the XOR of multiple random permutations
• Random number generators based on permutations can pass the collision test
• Building blockcipher from tweakable blockcipher: extending FSE 2009 proposal
• A Generic Method to Design Modes of Operation Beyond the Birthday Bound
• The summation-truncation hybrid: reusing discarded bits for free
• Multi-user security of the sum of truncated random permutations

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)