Waste less time on Facebook — follow Brilliant.
×

Are these constructions secure PRF?

Let f , g be two random functions and h be a hash function. You are asked the following :

  • \( F_f (r,m) = f(r) \oplus m \)
  • \( {F}_{f,g} (r,m) = f(r) \oplus f(m) \)
  • \( {F}_{f,h} (r,m) = f(r) \oplus h(m) \)
  • \( {F}_{f,g,h} (r,m) = f(r) \oplus g(h(m)) \)
  • \( {F}_{f,g} (r,m) = f(r) \oplus g(r \oplus m) \)
  • \( {F}_{f,g,h} (r,m) = f(r) \oplus g(r \oplus h(m)) \)

Secure PRF or secure MAC?

Note by Raja Metronetizen
5 months, 3 weeks ago

No vote yet
1 vote

Comments

There are no comments in this discussion.

×

Problem Loading...

Note Loading...

Set Loading...