Summerize text Suppose Fh $()$ is a PRF and it outputs n bits. We define a symmetric key encryption algorithm as follows: the

plaintext m is with length $2$n$,$ when encrypting m$,$ the algorithm chooses a random

computes F$\%$ Q and obtains y$.$ The

algorithm then computes $(2)$ C

D

m$,$ ie$,$ usingY to mask both the first half and second half of the message. Is such

encryption algorithm IND$-$CPA secure$?$