2k views

Consider the following two statements:

1. A hash function (these are often used for computing digital signatures) is an injective function.
2. A. encryption technique such as DES performs a permutation on the elements of its input alphabet.

Which one of the following options is valid for the above two statements?

1. Both are false
2. Statement (i) is true and the other is false
3. Statement (ii) is true and the other is false
4. Both are true

i. Hash function is not one one or injective. It is many to one.

ii. True. Uses P-Box permutation.

edited

Option (i) Here some asymmetrical algorithms where we apply Hashing (Hashing is a method used to verify data integrity).

1. RSA - named after Rivest, Shamir, and Adleman (investor)

2. Diffie-Hellman (DH)

3. ElGamal - based on the DH echange

4.Digital Signature Algorithm (DSA)- created by NSA

5. Eliptic Curve Cryptography (ECC)

Here some most popular Hashing types

1. MD5 (Message Digiest 5)

2. SHA 1

3. SHA 2

4. SHA 3

So we can correctly say it is not injective (one to one).

Option (ii) DES (Digital Encryption Standard) is part of symmetric key algorithm where we use same key to encrypt the data and decrypt the data. so calculating we perform permutation.

Statement (ii) is true and the other is false

edited
0
thanks for better explanation
ans d)
+1

The hash function (these are often used for computing digital signatures) such as MD5 and SHA are not injective, a perfect hash function will be injective so i wonder what the answer should be.

+16

During hash generation more than one message may generate the same HASH value( why should we talk about only about perfect hashing ;That is more than some specific thing !!).So hash function is Many-to-One

+3
makes sense.

1