The Indistinguishability of the XOR of k Permutations - Université de Versailles Saint-Quentin-en-Yvelines Access content directly
Conference Papers Year : 2015

The Indistinguishability of the XOR of k Permutations

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.
No file

Dates and versions

hal-02176874 , version 1 (08-07-2019)

Identifiers

Cite

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⟩
17 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More