Question

In: Computer Science

Are hash algorithms (such as MD5 and SHA1) are as good as they appear to be?...

Are hash algorithms (such as MD5 and SHA1) are as good as they appear to be? Why or why not?

Solutions

Expert Solution

Hashes are the products of cryptographic algorithms designed to produce a string of characters. Often these strings have a fixed length, regardless of the size of the input data. Take a look at the above chart and you’ll see that both “Fox” and “The red fox jumps over the blue dog” yield the same length output.

MD5, SHA-1, and SHA-256 are all different hash functions. Software creators often take a file download—like a Linux .iso file, or even a Windows .exe file—and run it through a hash function. They then offer an official list of the hashes on their websites

That way, you can download the file and then run the hash function to confirm you have the real, original file and that it hasn’t been corrupted during the download process. As we saw above, even a small change to the file will dramatically change the hash.

These can also be useful if you have a file you got from an unofficial source and you want to confirm that it’s legitimate. Let’s say you have a Linux .ISO file you got from somewhere and you want to confirm it hasn’t been tampered with. You can look up the hash of that specific ISO file online on the Linux distribution’s website. You can then run it through the hash function on your computer and confirm that it matches the hash value you’d expect it to have. This confirms the file you have is the exact same file being offered for download on the Linux distribution’s website, without any modifications.


Related Solutions

Research the different hash algorithms (Message Digest, Secure Hash Algorithm, and RIPMD) and then compare them....
Research the different hash algorithms (Message Digest, Secure Hash Algorithm, and RIPMD) and then compare them. Do a write up on the each one of them (3 paragraphs total). Be sure to include the size of the digest, the number of rounds needed to create the hash, block size, who created it, what previous hash it was derived from, and its strengths and weaknesses. For your fourth paragraph, pick one hash algorithm and explain what you would use it for...
Why is it not good to directly store the hash of password in a file? How...
Why is it not good to directly store the hash of password in a file? How can the use of salt enhance password security?
What are devices in your home that appear to use computers or algorithms? Can you name...
What are devices in your home that appear to use computers or algorithms? Can you name at least one device for every room in your house? Describe one algorithm each device performs
Algorithms appear almost everywhere in life. For example, a store clerk uses an algorithm with tasks...
Algorithms appear almost everywhere in life. For example, a store clerk uses an algorithm with tasks such as scanning items, bagging groceries, and accepting your payment. Other algorithms, such as those that make up computer operating systems, are much more complex. In general, the goal of algorithm design is to complete a job in fewer steps. Create your own algorithm to complete a computing task. You can use C++, Java, or Python3 to create your algorithm. Tips: Remove unwanted comments....
You want to create a good hash function. Which of these properties is the least important...
You want to create a good hash function. Which of these properties is the least important for your hash function to have? Let's say you want to store a collection of unique elements. You would like to be able to search, insert, delete as fast as possible. Which data structure should you use? Let's say you want your hash table to allow load factors greater than 1. You would use:
SHOW WORK Draw the hash table that results using the hash function: h(k)=kmod7 to hash the...
SHOW WORK Draw the hash table that results using the hash function: h(k)=kmod7 to hash the keys 41, 16, 40, 47, 10, 55. Assuming collisions are handled by Double hashing. SHOW WORK
3. Draw the hash table that results using the hash function: h(k)=kmod 7 to hash the...
3. Draw the hash table that results using the hash function: h(k)=kmod 7 to hash the keys 50, 700, 76, 85, 92, 73, 101. Assuming collisions are handled by Quadratic probing. Don't write a program. Just please manually solve the problem. Thanks.
what is a good hash function for ID numbers of format "LM-0001312", "LM-04341313", "LM-4205114"
what is a good hash function for ID numbers of format "LM-0001312", "LM-04341313", "LM-4205114"
Does there appear to be a good fit between the Organizational Culture and the Organizational Structure?  
Does there appear to be a good fit between the Organizational Culture and the Organizational Structure?  
1.Describe a design pattern that incents good security behavior. 2.Design a hash function that uses any...
1.Describe a design pattern that incents good security behavior. 2.Design a hash function that uses any desired date as the salt. Demonstrate operation of the function, including input values. Describe benefits and shortcomings of the hash function.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT