What does it mean that a function His "collision resistant O It can be applied to any sized message M O It is easy to compute h = H(M) for any message M O Given h, it is infeasible to find x s.t. H(x) = h O All O None In RSA, e=2 is not secure selection O True O False O It depends Public key encryption/decryption is not preferred because O it is slow O it is hardware/software intensive O it has a high computational load O All O None