Question: Assume that you use a cryptographic hash algorithm to produce a signature for a plain text file named F 1 . Call this signature S

Assume that you use a cryptographic hash algorithm to produce a signature for a plain
text file named F1. Call this signature S1 You make some changes to the file and save it
as F2. You then use the same hash algorithm on F2 to produce a second signature
called S2. You then perform additional edits to file F2, removing any changes that were
made between F1 and F2, and save the file as F3. You once again use the same hash
algorithm on F3 to produce a third signature called S3. What will the relationship be
between the three signature files S1, S2 and S3?
a. All three signatures will be identical.
b. All three signatures will be different.
c. S1 and S2 will be identical, but S3 will be different.
d. S1 and S3 will be identical, but S2 will be different.
e. S2 and S3 will be identical, but S1 will be different.
than 2128 bits.
c. The hash output or hash signature will contain 1 bit for each 128-bit block of
input.
d. The same size as the input plus 128 bits.
e. More information is required to make this determination.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!