Hash function

12.1

INTRODUCTION

A cryptographic hash function takes a message of arbitrary length and creates a message digest of fixed length. The ultimate goal of this chapter is to discuss the details of the two most promising cryptographic hash algorithms SHA-512 and Whirlpool.

12.2

Iterated Hash Function

Hash function need to create fix size digest out of a variable size message and this is best accomplished with iterated.Its compresses an n-bit string to create m-bit string where n is normally greater than m.The scheme is referred to as an iterated hash function

12.3

Merkle damgard scheme:Message length and padding are appended to the message to create an augmented message and this is divided into blocks of n-bits and n is size of block. Its considerd as t blocks each of n-bits and we call block M1,M2Mt .We call the digest created at t iteration H1,H2Ht and H0 is fixed value Ht is cryptography function of original message that is h(M).
12.4

Iterated Hash Function

Merkle-Damgard Scheme
Figure :- Merkle-Damgard scheme

12.5

Two Groups of Compression Functions

1. The compression function is made from scratch. Message Digest (MD)

2. A symmetric-key block cipher serves as a compression function.

Whirlpool

12.6

Rabin Scheme
Its is based on merkle damgard scheme ,compression function replace by encrpyting cipher message block used as key and previous result are used as plain text

12.7

Continued
Davies-Meyer Scheme
Its same as Rabin scheme except that is uses forward feed to protect against meet-in-the-middle attack

12.8

WHIRLPOOL

Whirlpool is an iterated cryptographic hash function, based on the Miyaguchi-Preneel scheme, that uses a symmetric-key block cipher in place of the compression function. The block cipher is a modified AES cipher that has been tailored for this purpose.

12.9

Continued
Figure 12.12 Whirlpool hash function

12.10

Whirlpool Cipher
Figure :- General idea of the Whirlpool cipher

12.11