Cryptography Hash Functions Cbc Online Exam Quiz
Cryptography Hash Functions Cbc GK Quiz. Question and Answers related to Cryptography Hash Functions Cbc. MCQ (Multiple Choice Questions with answers about Cryptography Hash Functions Cbc
What is the effectiveness of a 128 bit hash value?
Options
A : 2-64
B : 264
C : 2-112
D : 2-128
For an m-bit value, the adversary would have to try ____________ values to generates a given hash value h.
Options
A : 2m
B : 2(m-1)
C : 2(m/2)
D : (2m) – 1
For an m bit hash value, if we pick data blocks at random we can expect to find two data blocks with the same hash value within ____ attempts.
Options
A : 2m
B : 2(m-1)
C : 2(m/2)
D : (2m) – 1
What is the effectiveness of an n-bit hash value?
Options
A : 2n
B : 2-n
C : 22n
D : 2-2n
The second pre-image resistant property is
Options
A : It is computationally infeasible to find any pair (x, y) such that H(x) = H(y)
B : For any given block x, it is computationally infeasible to find y not equal to x, with H(y) = H(x)
C : For any given hash value h it is computationally infeasible to find y such that H(y) = h
D : None of the mentioned
Which attack requires the least effort/computations?
Options
A : Pre-image
B : Second Pre-image
C : Collision
D : All required the same effort
A function that is second pre-image resistant is also collision resistant.
Options
A : True
B : False
C :
D :
We define collision as: A collision occurs if we have x=y and H(x) = H(y).
Options
A : True
B : False
C :
D :
Cryptography Authenticated Encryption Ccm Gcm I more Online Exam Quiz
Cryptography Groups Rings Fields
Cryptography Interview Experienced
Cryptography Interview Freshers