In this paper we apply the technique to the problem of PRP to PRF conversion. We present a simple, new construction of a PRF from a PRP that makes only two invocations of the PRP and has insecurity linear in the number of queries made by the adversary. We also improve the analysis of the truncation construction.
Category / Keywords: Pseudorandom functions, pseudorandom permutations, provable security, birthday attacks. Publication Info: Appeared in the THEORY OF CRYPTOGRAPHY LIBRARY and has been included in the ePrint Archive. Date: received December 12th, 1999. Contact author: russell at cs ucsd edu Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation Short URL: ia.cr/1999/024 Discussion forum: Show discussion | Start new discussion