function. If yes, prove it; if not, show a distinguisher that succeeds with non- negligible probability. Hint: to prove that some of these candidates are not PRFS, it may be useful to assume the existence of MACS or PRFS with input and output of arbitrary size. Feel free to assume that such PRFS and MACs do exist, and pick the parameter sizes that are the most suitable to prove your result. (a) F' (k, x) def - MAC ([k],[x]). def (b) F" (k,x) = F(k, x)||AND(x). (c) F" (k, x) def MAC ([F(k, 1")]}³, [x]}). = 3. (MACs and PRFs) Let II = (Gen, MAC, Verify) be a secure MAC scheme with Gen (1) Є {0, 1} and MAC: {0, 1} × {0, 1} → {0,1}" (i.e., the MAC scheme works with keys and messages of size n/2 and returns a tag represented by a bit-string of size n). Let F {0, 1}"{0, 1}" → {0, 1}" be a length-preserving pseudorandom function. State whether each of the following PRF candidates is or is not a pseudorandom
function. If yes, prove it; if not, show a distinguisher that succeeds with non- negligible probability. Hint: to prove that some of these candidates are not PRFS, it may be useful to assume the existence of MACS or PRFS with input and output of arbitrary size. Feel free to assume that such PRFS and MACs do exist, and pick the parameter sizes that are the most suitable to prove your result. (a) F' (k, x) def - MAC ([k],[x]). def (b) F" (k,x) = F(k, x)||AND(x). (c) F" (k, x) def MAC ([F(k, 1")]}³, [x]}). = 3. (MACs and PRFs) Let II = (Gen, MAC, Verify) be a secure MAC scheme with Gen (1) Є {0, 1} and MAC: {0, 1} × {0, 1} → {0,1}" (i.e., the MAC scheme works with keys and messages of size n/2 and returns a tag represented by a bit-string of size n). Let F {0, 1}"{0, 1}" → {0, 1}" be a length-preserving pseudorandom function. State whether each of the following PRF candidates is or is not a pseudorandom
Related questions
Question
Please do not rely too much on chatgpt, because its answer may be wrong. Please consider it carefully and give your own answer. You can borrow ideas from gpt, but please do not believe its answer.Very very grateful!Please do not rely too much on chatgpt, because its answer may be wrong. Please consider it carefully and give your own answer. You can borrow ideas from gpt, but please do not believe its answer.
Very very grateful!
![function. If yes, prove it; if not, show a distinguisher that succeeds with non-
negligible probability. Hint: to prove that some of these candidates are not PRFS,
it may be useful to assume the existence of MACS or PRFS with input and output
of arbitrary size. Feel free to assume that such PRFS and MACs do exist, and
pick the parameter sizes that are the most suitable to prove your result.
(a) F' (k, x)
def
-
MAC ([k],[x]).
def
(b) F" (k,x)
=
F(k, x)||AND(x).
(c) F" (k, x) def MAC ([F(k, 1")]}³, [x]}).
=](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Feaeaf68c-12bd-4432-afa6-6f1bd2c82cdd%2F3fb7ac5b-c4d1-4c44-926a-9fea73496857%2Foqe6zwz_processed.png&w=3840&q=75)
Transcribed Image Text:function. If yes, prove it; if not, show a distinguisher that succeeds with non-
negligible probability. Hint: to prove that some of these candidates are not PRFS,
it may be useful to assume the existence of MACS or PRFS with input and output
of arbitrary size. Feel free to assume that such PRFS and MACs do exist, and
pick the parameter sizes that are the most suitable to prove your result.
(a) F' (k, x)
def
-
MAC ([k],[x]).
def
(b) F" (k,x)
=
F(k, x)||AND(x).
(c) F" (k, x) def MAC ([F(k, 1")]}³, [x]}).
=
Transcribed Image Text:3. (MACs and PRFs) Let II = (Gen, MAC, Verify) be a secure MAC scheme with
Gen (1) Є {0, 1} and MAC: {0, 1} × {0, 1} → {0,1}" (i.e., the MAC scheme
works with keys and messages of size n/2 and returns a tag represented by a
bit-string of size n).
Let F {0, 1}"{0, 1}" → {0, 1}" be a length-preserving pseudorandom function.
State whether each of the following PRF candidates is or is not a pseudorandom
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 1 steps
