Sciweavers

TIT
2010
121views Education» more  TIT 2010»
13 years 6 months ago
Power of a public random permutation and its application to authenticated encryption
In this paper, we first show that many independent pseudorandom permutations over {0, 1}n can be obtained from a single public random permutation and secret n bits. We next prove ...
Kaoru Kurosawa
EUROCRYPT
2000
Springer
14 years 3 months ago
The Sum of PRPs Is a Secure PRF
Given d independent pseudorandom permutations (PRPs) i, . . . , d over {0, 1}n , it appears natural to define a pseudorandom function (PRF) by adding (or XORing) the permutation re...
Stefan Lucks