Introduction to Hash Functions – Part 2/2

Hash function is a process of taking any input (long or short message) and return a fixed-size alphanumeric string. The output string is known as the “hash value”, “message digest”, “digital fingerprint” or sometime is called as “checksum”. The figure below shows how the Hash functions work.

how-hashing-works

The figure above shows the following:

  1. Message (x) is the long message, which is divided into number n of blocks.
  2. (z) is typically much smaller than (x), which is the result of hashing the original message h(x). Note: h(x) is public.
  3. The result of (z), will be signed with the private-key
  4. (s) will be sent to the other party, where it can be verified via the sender’s public-key.

 

There are many advantages can be found in the Hash functions such as:

  1. Arbitrary size of input message (x), gives a fixed-size output.
  2. Difficult to know the original message (x) after hashing it.
  3. The hash computation should be fast.

 

Note: any small change in the input in the hash function will make a big change in the output. The following figure shows the fixed-size result of hashing any message.

hash-functions

 

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s