In the context of a hash function, what is a compression function?

The National Security Agency of the United States developed the SHA1 hashing algorithm. What are the potential downsides of its use?

What is the benefit of hash index table?

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.

This section provides a prioritized list of factors that affect the Big-O performance of a hash table:

Explain the collision resolution techniques used in hash tables when dealing with key collisions in dictionaries.

Explain the major differences between hash functions and keyed-hash functions. In which scenarios would you use one or the other?

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.

Define hash as it relates to cryptography. Give one example of where a hash algorithm might be used. Name one specific hash algorithm.

The following factors affect a hash table's Big-O performance in decreasing order: