Abstract
Given d independent pseudorandom permutations (PRPs) π i, ..., π d over 0, 1n, it appears natural to define a pseudorandom function (PRF) by adding (or XORing) the permutation results: sum d(x) = π 1(x) ⊕ ··· ⊕ π d(x). This paper investigates the security of sum d and also considers a variant that only uses one single PRP over 0, 1n.
Supported by DFG grant Kr 1521/3-1.
Chapter PDF
References
W. Aiello, R. Venkatesan, “Foiling Birthday Attacks in Length Doubling Transformations”, Eurocrypt 96, 307–320, Springer LNCS 1070.
M. Bellare, A. Desai, E. Jokipii, P. Rogaway, “A Concrete Security Treatment of Symmetric Encryption: The DES Modes of Operation”, FoCS 97, IEEE press.
M. Bellare, R. Impagliazzo, “A Tool for Obtaining Tighter Security Analyses of Pseudorandom Function Based Constructions, with Applications to PRP→PRF Conversion” (FOCS’ 99 submission), Theory of Cryptography Library, record 99-24 (1999).
M. Bellare, J. Kilian, P. Rogaway, “The Security of the Cipher Block Chaining Message Authentication Code”, Crypto 94 Proceedings, Springer LNCS 839.
M. Bellare, T. Krovetz, P. Rogaway, “Luby-Rackoff Backwards: Increasing Security by Making Block Ciphers Non-Invertible”, Eurocrypt 98, Springer LNCS 1403.
O. Goldreich, S. Goldwasser, S. Micali, “How to Construct Random Functions”, Journal of the ACM, Vol. 33, No 4, 792–807 (1986).
C. Hall, D. Wagner, J. Kelsey, B. Schneier, “Building PRFs from PRPs”, Crypto 98, Springer LNCS 1462.
L. Levin, “One Way Functions and Pseudorandom Generators”, Combinatorica, 7(4), 357–363 (1987).
M. Luby, C. Rackoff, “How to Construct Pseudorandom Permutations from Pseudorandom Functions”, SIAM J. Comput., Vol. 17, No. 2, 373–386, (1988).
S. Lucks, “Faster Luby-Rackoff Ciphers”, Fast Software Encryption 1996, Springer LNCS 1039, 189–205.
M. Naor, O. Reingold, “On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited”, J. of Cryptology, Vol. 12, No. 1, 29–66 (1999).
J. Patarin, “About Feistel Schemes with Six (or More) Rounds”, Fast Software Encryption 1997, Springer LNCS 1372, 103–121.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lucks, S. (2000). The Sum of PRPs Is a Secure PRF. In: Preneel, B. (eds) Advances in Cryptology — EUROCRYPT 2000. EUROCRYPT 2000. Lecture Notes in Computer Science, vol 1807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45539-6_34
Download citation
DOI: https://doi.org/10.1007/3-540-45539-6_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67517-4
Online ISBN: 978-3-540-45539-4
eBook Packages: Springer Book Archive