COMPUTER ETHICS AND SECURITY
CRYPTOGRAPHY AND ENCRYPTION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
To ensure that transmitted messages have tampered
|
|
|
Message fingerprint
|
|
|
Downline load a program
|
|
|
None of the above
|
Detailed explanation-1: -Hash functions are also referred to as hashing algorithms or message digest functions. They are used across many areas of computer science, for example: To encrypt communication between web servers and browsers, and generate session IDs for internet applications and data caching.
Detailed explanation-2: -A cryptographic hash function has provable security against collision attacks if finding collisions is provably polynomial-time reducible from problem P which is supposed to be unsolvable in polynomial time. The function is then called provably secure, or just provable.
Detailed explanation-3: -Answer: All of the given options such as MD5, Triple DES, and SHA-1 are examples of hash functions. These are cryptographic in nature and therefore suitable for cryptography.
Detailed explanation-4: -2-choice hashing utilizes two hash functions h1(x) and h2(x) which work as hash functions are expected to work (i.e. mapping integers from the universe into a specified range). The two hash functions should be independent and have no correlation to each other.