COMPUTER ETHICS AND SECURITY
CRYPTOGRAPHY AND ENCRYPTION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Key revocation
|
|
|
Collision resistance
|
|
|
One-to-one mapping of input to output
|
|
|
None of the above
|
Detailed explanation-1: -A cryptographic hash function must satisfy three criteria: Preimage resistance. Second preimage resistance (weak collision resistance) Strong collision resistance.
Detailed explanation-2: -In cryptography, collision resistance is a property of cryptographic hash functions: a hash function H is collision-resistant if it is hard to find two inputs that hash to the same output; that is, two inputs a and b where a ≠ b but H(a) = H(b).
Detailed explanation-3: -Explanation: The Hash functions offer all the mentioned properties in a data compression: i.e. authentication, Non repudiation and Data Integrity.
Detailed explanation-4: -One of the hardest concepts my students had grasping was secure cryptographic hash functions, partially because of the number theory, but also in differentiating between the three properties of a secure hash function: collision resistance, preimage resistance, and second preimage resistance.
Detailed explanation-5: -A cryptographic hash function must be able to withstand all known types of cryptanalytic attack. In theoretical cryptography, the security level of a cryptographic hash function has been defined using the following properties: Pre-image resistance.