Slide $2(7\mathrm{.}3)-$bitsn$+/$ bitskF$1$h$($k$,$ x$).$bitsn bitsblock cipherFIGURE $7\mathrm{.}11$: The Davies$-$Meyer construction.h: $10,1)$nte $10,17\backslash$deg by h$($k$,$ x$)$ def Fk$($x$)$ x$1.$Suppose the Davies$-$Meyer Construction $($module $7\mathrm{.}3$slide $2)$ is used to construct a hash function for fixed length messages using a block cipher PI$.$ Suppose that a search space of $2112$ is considered large enough to make a brute force attack infeasible. What should be the minimum block size of Pl to protect against brute force birthday attacks to search for a collision$\mathrm{.}2.$Further suppose that the key size of Pl is $128$ bits.What is the size of the fixed length message that can be hashed using Pl with the minimum n in your answer to question $1?$ Explain.Slides $11(7\mathrm{.}1)$Output stream has good statistical properties but is not pseudorandomState of all $0\text{'}$s will persist indefinitely once it is reachedA maximal n$-$degree LFSR will cycle through $2$n$-1$ non$-$zero statesFeedback coefficients can be adjusted to achieve thisIst n bits of output reveals the keyIf feedback coefficients are known all future bits are known If feedback coefficients are not known $2$nd n bits of output yield the n equations which can be solved $=-1-1$ @ $..$@ :Y$2$n$-1=$ Cn$-1$ Y$2$n$-2$@$...$ @ Con$-1.$There are techniques to handle non$-$maximal LFSRs$3.$In context of Linear FSRs$,$ Module $7\mathrm{.}1$ slide $11$ makes the following claim: State of all O$\text{'}$s will persist indefinitely once it is reached in a linear FSR$.$ Can we make a similar claim about the state of all $1\text{'}$s$?$ Explain.Slide $16(7\mathrm{.}2)$UZFK$,($x$)$Fk; $($x$)$z$*$FIGURE $7\mathrm{.}7$: A meet$-$in$-$the$-$middle attack.Effective key size: $57$bitStorage: $2574.$Consider the argument presented in module $7\mathrm{.}2$ slide$16$ regarding the effective key size of double DES.Suppose we are using AES with $192$ bit key on the left side and AES with $128$ bit key on the other. What would be the effective key size and storage requirement for a known plaintext attack using meet$-$in$-$the middle attack?Plz do not use chat gpt thank you

plz do not use chat gpt or any ai