The Indistinguishability of the XOR of k Permutations

被引：23

作者：

Cogliati, Benoit ^{[1
]}

Lampe, Rodolphe ^{[1
]}

Patarin, Jacques ^{[1
]}

机构：

[1] Univ Versailles, Paris, France

来源：

FAST SOFTWARE ENCRYPTION, FSE 2014 | 2015年 / 8540卷

关键词：

Pseudorandom functions; Pseudorandom permutations; Security beyond the birthday bound; Luby-Rackoff backwards; PSEUDORANDOM PERMUTATIONS; SECURITY;

D O I：

10.1007/978-3-662-46706-0_15

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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.

引用

页码：285 / 302

页数：18

共 15 条

[1] Aiello W, 1996, LECT NOTES COMPUT SC, V1070, P307
[2] Bellare M, 1998, LECT NOTES COMPUT SC, V1403, P266, DOI 10.1007/BFb0054132
[3] Bellare M., 1999, 1999024 EPRINT ARCH
[4] HOW TO CONSTRUCT RANDOM FUNCTIONS
GOLDREICH, O
GOLDWASSER, S
MICALI, S
[J]. JOURNAL OF THE ACM, 1986, 33 (04) : 792 - 807
[5] Hall C, 1998, LECT NOTES COMPUT SC, V1462, P370, DOI 10.1007/BFb0055742
[6] ONE WAY FUNCTIONS AND PSEUDORANDOM GENERATORS
LEVIN, LA
[J]. COMBINATORICA, 1987, 7 (04) : 357 - 363
[7] HOW TO CONSTRUCT PSEUDORANDOM PERMUTATIONS FROM PSEUDORANDOM FUNCTIONS
LUBY, M
RACKOFF, C
[J]. SIAM JOURNAL ON COMPUTING, 1988, 17 (02) : 373 - 386
[8] Lucks S., 1996, Fast Software Encryption. Third International Workshop Proceedings, P189
[9] Lucks S, 2000, LECT NOTES COMPUT SC, V1807, P470
[10] Mandal A, 2010, LECT NOTES COMPUT SC, V6498, P69, DOI 10.1007/978-3-642-17401-8_6

← 1 2 →