A pseudo-random function is an efficiently-computable function which emulates a random oracle.

learn more… | top users | synonyms (1)

2
votes
0answers
11 views

Security of KDF0 and KDF1 (hash based KDF's)

It's still common to come across implementations of KDF0 and KDF1. Basically these are KDF's that simply derive multiple keys from the key seed and a counter: $K_i = KDF(K_{master}, i) = H(K_{master} ...
2
votes
0answers
68 views

What might be assumed about a PRF if the key has been chosen?

The defining feature of a PRF $f:\{0,1\}^k\times\{0,1\}^s\mapsto\{0,1\}^*$ is that, if the first parameter is selected at random, it should be indistinguishable from a function ...
2
votes
0answers
40 views

how to truncate a PRF on n bits to PRF on t bits where t < n?

Dan Boneh's courersa lecture on format preserving encryption at 5.50 mins , talks about truncating a PRF on n bits to PRF on t bits. The approach is by appending (n-t) zeros to input t bits then ...
2
votes
0answers
50 views

Protocol/algorithms based on a variable-length input PRF

Are the proofs based on a PRF assumption still valid when using a variable-length input PRF ? The answer might be obvious, but I have a doubt.
-1
votes
0answers
40 views

Does repeated hashing create a PRF?

Say you start with a seed value and hash it with a secure hashing algorithm, then hash the output of that and so on... Is this a PRF? Or does it have a certain computable period?