merkle trree

What is the difference between a hash table and a binary search tree, and what are the advantages and disadvantages of each data structure in terms of search, insertion, and deletion operations?

Name and define the two (2) major weaknesses/attacks of hashing in cryptography.

Outline how various hash algorithms, such as SHA-2 and SHA-3, ensure data integrity during transmission.

Module 9 Discussion Module 9 Discussion Do some quick research on an encryption or hashing algorithm such as SHA-1, SHA-2, SHA-3, MD5, RSA, DES, 3DES, Blowfish, etc (there are many others). Take a few minutes to argue whether the algorithm is still viable and why/why not.

What properties must a hash function have to be useful for message authentication?

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.

A one-way hash algorithm is one sort of cryptographic algorithm. Extensively describe it and its attributes.

In what ways does a hash outperform a checksum (such as the Internet checksum) in terms of message integrity?

Define hash table, its limitation and possible solutions.

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

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