Question: Suppose a hash function is created by the following steps: 1. encrypt the plaintext using a substitution cipher 2. convert ciphertext to numbers using this
Suppose a hash function is created by the following steps:
1. encrypt the plaintext using a substitution cipher
2. convert ciphertext to numbers using this conversion a is 0, b is 1 c is 2...z is 25.
3. remove the first 7 numbers then add 3 to each of the remaining numbers
4. Multiply each number by 2 and then subtract 100 from the result
If the substitution cipher is complex, is this hash function preimage resistant? If the substitution cipher is simple, is this hash function preimage resistant?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
