1. Explain which of the practical and security properties of a hash function are most useful for the following applications: (a) storing a passphrase; (b) generating a short-lived key by hashing a long-term key; (c) HMAC; (d) computer virus detection. Explain your answer by giving examples from results obtained through implementation in a cryptography tool.

1. Explain which of the practical and security properties of a hash function are most useful for the following applications: (a) storing a passphrase; (b) generating a short-lived key by hashing a long-term key; (c) HMAC; (d) computer virus detection. Explain your answer by giving examples from results obtained through implementation in a cryptography tool.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Answer the following in a 2- to 3-page paper: Define cryptographic hash function (CFH). List and define the main properties of an ideal cryptographic hash function. Give at least 2 applications or uses for a CFH (example: password verification) and a brief description of how it is used. Format your paper according to appropriate course-level APA guidelines.
Look up the following properties of a cryptographic hash function on the internet or elsewhere: Collision resistance, hiding, and puzzle friendliness. Give a careful formal definition. This could be copied, if so, make it clear where it is from. Then in your own words explain what each of the properties means and why it is an important property to ensure security.
Is it possible to encrypt an AES key by using a common password? Justify the answer you gave.Check out the difference between the hash function and the keyed hash function. Check out this working example of a hash function with one key.
How about encrypting an AES key using a secret password? Extend your justification for why you chose that particular answerKeyed hash functions are compared to hash functions. Check out a sample of a hash function with a single key.
Problem 2. One key difference between a cryptographic hash and an encryption algorithm is that the former does not need a "key" to be used. Given a good encryption algorithm (say, AES), it is infeasible to recover the plaintext of an encryption message. So why not use something like AES with a fixed key (say, 0) as a hash algorithm? Problem 3. The purpose of this problem is to get you to work though an actual Diffie-Hellman ephemeral key exchange algorithm. (The algorithm itself can be found in the slides for the Video
QUESTION 1 [Estimated time to solve this question is 5 minutes] From the material that we discussed in the lecture about the cryptographic hash function, answer the following question: Why it is always recommended to use the cryptographic hash function to store the hash of the password in the password file (or the password database) instead of storing the plaintext password? Explain. For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac). I U S Paragraph Open Sans,sa. v 14px Ix ...
What distinguishes a Key Derivation Function from other families of secure hash functions that have been explored in the past (such as the SHA family of algorithms)? To ensure that your message is well understood, you should include as much detail as possible.
Is it possible to encrypt an AES key using a shared secret? Justify your answer Consider the hash function in comparison to the keyed hash function. Consider an example of a one-keyed hash function.
Hence, organizations with established IAM practices can rapidly adopt cloud services while maintaining the efficiency and efficacy of their security controls.We are aware that a digital signature serves to guarantee the validity and purity of data. a) Since checksums add up all the message's bits (or blocks), are they a viable method to build digital signature schemes? Consider a hash function, such as Sign(M)=h(M).b) If we create a signature using a hash in a trickier manner, as in Sign(k,m) = = h(k) XOR m XOR h(m), then m, will be transmitted. Would this warning be trustworthy? Describe in detail. Please refrain from using chegg or other AI tools like chat GPT.
Problem 2. One key difference between a cryptographic hash and an encryption algorithm is that the former does not need a "key" to be used. Given a good encryption algorithm (say, AES), it is infeasible to recover the plaintext of an encryption message. So why not use something like AES with a fixed key (say, 0) as a hash algorithm?
1. (a) Explain the need for digital signatures when using public-key ciphers. (b) Describe a simple hash algorithm, or a simple check sum. Your explanation should include a quick example of how the algorithm/check sum works.
Name and define the two (2) major weaknesses/attacks of hashing in cryptography.