Question 4 A cryptographic hash function is called to be collision free, if... Not yet answered Select one: Marked out of 1 a. ... it is impossible to construct with a present hash or hash candidate any of these messages which give us the presented hash b. ... it is impossible to construct any (arbitrary) pair of messages, with give us the same hash c. ... it s impossible to construct with a present message-hash pair another such a message which give us the same hash d. ... the length of the computable hash is no less than 256 bits long e. ... the length of the computable hash is no less than 1024 bits long Question 5 Practical breaking of N-bit key symmetric cryptoalgorithm with an exhaustive Not yet search needs... answered Marked out of 1 Select one: Flag a. ... the examination of N2 variants question b. ... the examination of N/2 variants c. ... the examination of 2(N/2) variants d. ... the examination of 2N variants e... the examination of 2(2N) variants