University Cryptography Assignment: MD5, SHA and Data Integrity

Verified

Added on  2022/09/12

|6
|576
|14
Homework Assignment
AI Summary
This assignment solution delves into cryptographic principles, specifically focusing on hashing algorithms such as MD5 and SHA. It explains how these algorithms convert data strings into fixed-length numeric strings, crucial for data integrity and collision resistance. The document outlines the MD5 algorithm's operation, including padding and digest calculation, and presents the hash values for a sample file after edits. It also discusses how MD5 and SHA are used to ensure data integrity when shared between users, by comparing hash values at both ends. The solution further highlights the differences between MD5 and SHA, including digest length, speed, and vulnerability to cryptanalytic attacks, and references several academic sources. This assignment helps students understand the practical application of these algorithms in securing data.
Document Page
Running head: PRINCIPLES AND METHODS IN CRYPTOGRAPHIC
Principles and methods in cryptographic
Name of the Student
Name of the University
Authors note
tabler-icon-diamond-filled.svg

Paraphrase This Document

Need a fresh take? Get an instant paraphrase of this document with our AI Paraphraser
Document Page
1PRINCIPLES AND METHODS IN CRYPTOGRAPHIC
Hashing Algorithms
In computer science the hash algorithms are the functions that are helpful in the
converting the contained data string in fixed length numeric string as output. Generated numeric
output string is smaller than original data of the file. The numeric strings generated using Hash
algorithms are collision-resistant. It is almost impossible to generate the same string with
different data in a file.
The MD5 algorithm operates on 512 bits at once and for this the content is padded. The
initial digest is calculated with every 512-bit message (Kale & Dhamdhere, 2018). This process
of adding the digest values are continued until the end of the content. Final digest is always 128
bit long.
The used text file and initial content is
Following is the list of the different hash values for the file with the initial content.
Document Page
2PRINCIPLES AND METHODS IN CRYPTOGRAPHIC
MD5: 3DA575C5A39DAA2573C24E2F05DE2CE4
SHA-512:
120857C7C274C0E2049279CB158FFE2863CD1367510BF5B25D748D3FB3B8B75C3934CB7
C995C9AE430865472B621704E7BE7904E7F1C031A25AC6B8C12863824
After the first edit, the content in the file;
Document Page
3PRINCIPLES AND METHODS IN CRYPTOGRAPHIC
After the first edit, the following is the list of the hash values for file;
After the second edit, the content in the file.
tabler-icon-diamond-filled.svg

Paraphrase This Document

Need a fresh take? Get an instant paraphrase of this document with our AI Paraphraser
Document Page
4PRINCIPLES AND METHODS IN CRYPTOGRAPHIC
MD5 and SHA hash values for the file after last edit;
Integrity of the data through the use of MD5 and SHA
When Data is shared between two users, the data file can be compared at the both ends
respect to hash value in order to determine the integrity of the files. When data is hashed using
ay algorithm generated hash value is protected. At the receiver end, received data is hashed
again. Now this hash vale is compared to the previous protected value. In case the values match
it is ensured that data shared is not altered in the transmission.
Difference between the MD5 and SHA
MD5 SHA
MD5 Generates 128-bit digest SHA Generates 160-bit digest
MD5 is slow compared to other algorithms. SHA is faster than MD5 algorithm.
Document Page
5PRINCIPLES AND METHODS IN CRYPTOGRAPHIC
This algorithm is vulnerable to cryptanalytic
attacks that can help in altering the data (Kale &
Dhamdhere, 2018).
SHA is much more secure compared to MD5
against the cryptanalytic attacks.
References
Idris, Y. B., Ismail, S. A., Azmi, N. F. M., Azmi, A., & Azizan, A. (2017). Enhancement Data
Integrity Checking Using Combination MD5 and SHA1 Algorithm in Hadoop
Architecture. Journal of Computer Science & Computational Mathematics, 99-102.
Kale, M. A., & Dhamdhere, S. (2018). Survey Paper on Different Type of Hashing
Algorithm. INTERNATIONAL JOURNAL, 3(2).
Jacob, N. M. (2016). Vulnerability of data security using MD5 function in php database
design. International Journal of Science and Engineering (IJSE).
Chiriaco, V., Franzen, A., Thayil, R., & Zhang, X. (2017, May). Finding partial hash collisions
by brute force parallel programming. In 2017 IEEE Long Island Systems, Applications
and Technology Conference (LISAT) (pp. 1-6). IEEE.
chevron_up_icon
1 out of 6
circle_padding
hide_on_mobile
zoom_out_icon
[object Object]