Problem 3.1 Consider the following keyed Function F: For security parameter n, the key is an n x n boolean matrix A and an n-bit boolean vector b. Then, F4,6(x) = Ax + b, where all operations are done modulo 2. Show that F is not a pseudorandom function Problem 3.1 Consider the following keyed Function F: For security parameter n, the key is an n x n boolean matrix A and an n-bit boolean vector b. Then, F4,6(x) = Ax + b, where all operations are done modulo 2. Show that F is not a pseudorandom function