Question: ( 2 ) This problem introduces a hash function similar in spirit to SHA that operates on letters instead of binary data. It is called
This problem introduces a hash function similar in spirit to SHA that operates on letters instead of binary data. It is called the toy tetragraph hash tth Given a message consisting of a sequence of letters, tth produces a hash value consisting of four letters. First, tth divides the message into blocks of letters, ignoring spaces, punctuation, and capitalization. If the message length is not divisible by it is padded out with nulls. A fournumber running total is maintained that starts out with value ; this is input to a function, known as a compression function, for processing the first block. The compression function consists of two rounds. Round : Get the next block of text and arrange it as a rowwise X block of text and convert it to numbers A B for example, the block ABCDEFGHIJKLMNOP, we have
A B C D
E F G H
I J K L
M N O P
Then, add each column mod and add the results to the running total, mod In this example, the running total is Round : Using the matrix from round rotate the first row left by second row left by third row left by and reverse the order of the fourth row. In our example,
B C D A
G H E F
L I J K
P O N M
Now, add each column mod and add the result to the running total. The new running total is This running total is now the input into the first round of the compression function for the next block of text. After the final block is processed, convert the final running total to letters. For example, if the message is ABCDEFGHIJKLMNOP, then the hash is FHJL
a Draw figures of the overall tth logic and the compression function logic.
b Calculate the hash function for the letter message I leave twenty million dollars to my friendly cousin Bill.
c To demonstrate the weakness of tth find a letter block that produces the same hash as that just derived. Hint: Use lots of As
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
