The Indistinguishability of the XOR of k Permutations

Benoit Cogliati 1 Rodolphe Lampe 1 Jacques Patarin 1
1 PRISM - Parallélisme, Réseaux, Systèmes, Modélisation
Abstract : Given k independent pseudorandom permutations f(1), ... , f(k) over {0, 1}(n), it is natural to define a pseudorandom function by XORing the permutations f(1) circle plus... circle plus f(k). In [9] Stefan Lucks studied the security of this PRF. In this paper we improve the security bounds of [9] by using different proof techniques.
Keywords : Luby-Rackoff backwards Security beyond the birthday bound Pseudorandom permutations Pseudorandom functions
Document type :
Conference papers
Complete list of metadatas
https://hal.uvsq.fr/hal-02176874
Contributor : Équipe Hal Uvsq <>
Submitted on : Monday, July 8, 2019 - 2:34:43 PM
Last modification on : Tuesday, July 9, 2019 - 1:27:43 AM

Identifiers

Collections

UVSQ | INSMI | PRISM

Citation

Benoit Cogliati, Rodolphe Lampe, Jacques Patarin. The Indistinguishability of the XOR of k Permutations. 21st International Workshop on Fast Software Encryption (FSE), Mar 2014, Londons Nat Hist Museum, London, ENGLAND, United Kingdom. ⟨10.1007/978-3-662-46706-0_15⟩. ⟨hal-02176874⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

18

Contact

CCSD