 |
HAL | Université de Versailles Saint-Quentin-en-Yvelines |
Conference papers
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.
https://hal.uvsq.fr/hal-02176874
Contributor : Équipe Hal Uvsq <>
Submitted on : Monday, July 8, 2019 - 2:34:43 PM
Last modification on : Monday, January 13, 2020 - 1:24:22 AM
Contributor : Équipe Hal Uvsq <>
Submitted on : Monday, July 8, 2019 - 2:34:43 PM
Last modification on : Monday, January 13, 2020 - 1:24:22 AM