On the XOR of Multiple Random Permutations

DOI10.1007/978-3-319-28166-7_30zbMath1423.94089OpenAlexW2399264755MaRDI QIDQ2794522

Bart Mennink, Bart Preneel

Publication date: 10 March 2016

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL: https://www.cosic.esat.kuleuven.be/publications/article-2523.pdf

zbMATH Keywords

indifferentiabilitybeyond birthday boundH-coefficient techniqueXOR of permutations

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items

Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method, Open problems in hash function security, Beyond-birthday secure domain-preserving PRFs from a single permutation, Keyed sum of permutations: a simpler RP-based PRF, Block-cipher-based tree hashing, Security of truncated permutation without initial value, Multi-user security of the sum of truncated random permutations, Luby-Rackoff backwards with more users and more security, Revisiting the indifferentiability of the sum of permutations, Analysis of the single-permutation encrypted Davies-Meyer construction, XPX: Generalized Tweakable Even-Mansour with Improved Security Guarantees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chaskey: An Efficient MAC Algorithm for 32-bit Microcontrollers
• Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions
• The Security of Multiple Encryption in the Ideal Cipher Model
• Minimizing the Two-Round Even-Mansour Cipher
• Hash Functions Based on Three Permutations: A Generic Security Analysis
• The Indistinguishability of the XOR of $$k$$ Permutations
• Security of Keyed Sponge Constructions Using a Modular Proof Approach
• Indifferentiability beyond the Birthday Bound for the Xor of Two Public Random Permutations
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• The “Coefficients H” Technique
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Tight Security Bounds for Key-Alternating Ciphers
• Merkle-Damgård Revisited: How to Construct a Hash Function
• On the Indifferentiability of the Sponge Construction
• 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
• Theory of Cryptography