Log out Go to App
Go to App

Learning Materials

Features

Discover

Chapter 8: Problem 32

Give at least two examples of situations in which hashing is not appropriate.

Short Answer

Expert verified
Hashing is not appropriate when the data needs to be retrieved in the order it was originally input (e.g., for time-series data), or when the original data needs to be recovered from the hashed output (e.g., for encryption).

Step by step solution

01

Situation 1 - Original Order Retrieval

If the order in which data was originally entered or recorded matters for the application at hand, using a hash function could disrupt that order. As hash functions map input data to numerical values in a deterministic but seemingly random way, there's no way to reverse-engineer the input's original order from the hashed output. For instance, consider an application which records the time-series data (e.g. stock prices). If this data is hashed, the time-series information will be lost.
02

Situation 2 - Reversible Data

If you need to retrieve the original data from the hashed output, hashing is not appropriate. Although hash functions are deterministic, they are designed to be difficult to reverse. In other words, if you know the output of a hash function, it should still be computationally infeasible to determine what the input was. This is a feature, not a bug, for many applications (for example, storing password data). But for applications such as encryption where you want to be able to recover the original data by reversing the action, hashing is inappropriate. Encryption requires using a deterministic function that's easily reversible with the right key.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Start your free trial

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Write an algorithm to delete an element from a hash table that uses linear probing as its clash resolution strategy, Analyze your algorithm, and show the results using order notation.

Discuss the advantages of using each of the following instead of the other: (a) A binary search tree with a balancing mechanism (b) \(A 3-2\) tree

Write a probabilistic algorithm that determines whether an array of \(n\) elements has a majority element (the element that appears the most). Analyze your algorithm, and show the results using order notation.

Show that the average-case time complexity of Interpolation Search is in \(\Theta(\lg (\lg n)),\) assuming the keys are uniformly distributed and that search key \(x\) is equally probable to be in cach of the array slots.

Let \(S\) and \(T\) be two arrays of \(m\) and \(n\) elements, respectively. Write an algorithm that finds all the common elements and stores them in an array \(U\) Show that this can be done in \(\Theta(n+m)\) time.
See all solutions

Recommended explanations on Computer Science Textbooks

Computer Organisation and Architecture

Read Explanation

Functional Programming

Read Explanation

Computer Network

Read Explanation

Computer Systems

Read Explanation

Data Representation in Computer Science

Read Explanation

Computer Programming

Read Explanation
View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free