The Indistinguishability of the XOR of $$k$$ Permutations

DOI10.1007/978-3-662-46706-0_15zbMath1382.94084OpenAlexW230467894MaRDI QIDQ2946915

Rodolphe Lampe, Jacques Patarin, Benoît Cogliati

Publication date: 18 September 2015

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46706-0_15

zbMATH Keywords

pseudorandom functionspseudorandom permutationsLuby-Rackoff backwardssecurity beyond the birthday bound

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (12)

Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method ⋮ Beyond-birthday secure domain-preserving PRFs from a single permutation ⋮ Keyed sum of permutations: a simpler RP-based PRF ⋮ Proof of mirror theory for a wide range of \(\xi_{\max }\) ⋮ 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 ⋮ A note on the chi-square method: a tool for proving cryptographic security ⋮ On the XOR of Multiple Random Permutations ⋮ Analysis of the single-permutation encrypted Davies-Meyer construction ⋮ Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers ⋮ EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC

This page was built for publication: The Indistinguishability of the XOR of $$k$$ Permutations