S7: A set of passwords of 8 to 12 characters with a size of 2.9714*10^23.)
Q1. Consider a hashing function H2. It’s domain is S7, and it’s range is N(6) (six digit numbers). What is the cardinality of the range of H2?
(Below is the answer from Studen expert)
Answer:
Cardinality of the range is 10^6.
Step-by-step explanation:
The cardinality of a set is a measure of a set's size, meaning the number of elements in the set.
As the range is a 6 digit number. Each digit can be 0,1,2,...9 (total 10 choices).
Possible numbers in range are 10^6
Therefore the cardinality of the range is 10^6.
This will guide in the question below.
Q.2 Consider the following statement
“If a function’s range is smaller than its domain, then that function cannot be injective”
Prove or refute this statement.
Based on your proof, what is the implication for H2?
Could there be a function D1 that is the inverse of H2?
What is the implication for using H2 to hide passwords? What might happen if hashed passwords leaked?