should a hash function be reversible? ABсDO Yes, because this would allow the hash to contribute to error detection and correction operations.OIn a limited way, they are reversible, because the hash acts as a pointer or key into database and file management systems where the plaintextcomes from.OONo, because a hash is a many-to-one function and thus must have a collision detection and avoidance mechanism as part of its implementation;being reversible would negate this.No, because this would allow the plaintext to be decrypted from the hash, rendering message digests and digital signatures unworkable

Hash functions play a critical role in cryptography and data integrity. They are used to map data of…

A C Yes, because this would allow the hash to contribute to error detection and correction operations. B O In a limited way, they are reversible, because the hash acts as a pointer or key into database and file management systems where the plaintext comes from. C D O No, because a hash is a many-to-one function and thus must have a collision detection and avoidance mechanism as part of its implementation; being reversible would negate this. O No, because this would allow the plaintext to be decrypted from the hash, rendering message digests and digital signatures unworkable

A C Yes, because this would allow the hash to contribute to error detection and correction operations. B O In a limited way, they are reversible, because the hash acts as a pointer or key into database and file management systems where the plaintext comes from. C D O No, because a hash is a many-to-one function and thus must have a collision detection and avoidance mechanism as part of its implementation; being reversible would negate this. O No, because this would allow the plaintext to be decrypted from the hash, rendering message digests and digital signatures unworkable

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

Hashing is a technique that is used to uniquely identify a specific object from a group of similar objects. Can you use one or two real-world example(s) to explain what a "hash" really is? How can a programmer implement it? Pls, give a thorough ans.
should a hash function be reversible? - no, because this woild allow the plaintext to be decrypted from the hash, rendering message digests and digital signatures unworkable -yes, because this would allow the hash to contribute to error detection and correction operations -in a limited way, they are reversible, bevause the hash acts as a pointer or key into database and file management systems where the plaintext comes from -none of the above
The first step of most signature schemes consists in hashing the message to be signed. Discuss which security property a suitable hash function must have, and briefly show an attack that is possible if the hash function does not have this property.
Create a thorough note on Hashing. (Hashing, hash table, collision, collision detection algorithms, time complexity, and hashing applications). Describe in detail one application of hashing. Do you know of any Java libraries that can be used for this purpose?
Explain “Collisions in the hashing” in detail.
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.
In a well organized essay, not a series of bullets, explain what "hashing" is. What is it used for? What makes it particularly attractive. In your essay be sure to indicate the order of magnitude required to store or to search for data using hashing.
Identify the risks associated with the different authentication techniques, and provide a solution to the following problem: Bob creates a hash of the password and compares it to a database of previously generated hashes. Bob checks a password against a database of previous passwords by using a double-hashing method.
Determine the dangers of the various authentication methods and provide a countermeasure for the following situation: Bob generates a hash of the password and checks it against a repository of hashes. Bob uses a double-hashing algorithm to compare a password to a database of other passwords.
Using linear hashing to insert the given values in the order provided with the hash function hi(K) = K mod 2i . Display how the file grows and the hash functions changes as the records are inserted. Draw the diagrams showing the loading of the data into buckets, overflows, and splits. Also, calculate the average number of block accesses for a random retrieval on the given records. Given records are 2369, 3760, 4692, 4871, 5659, 1821, 1074, 7115, 1620, 2428, 3943, 4750, 6975, 4981 and 9208.
Find the holes in the following authentication methods and provide a fix to the identified issue:In order to verify the authenticity of a password, Bob first generates a hash of it and then compares it to a collection of previously hashed passwords.Bob uses a hashing technique to run a password twice and then compares the results to a database of hashed passwords.
It's important to think about Lamport's OLP algorithm and its security in light of the features of the hash function.