Scribd
Upload
88 views

Cryptographic Hash Functions

This document discusses cryptographic hash functions and summarizes two specific algorithms: SHA-512 and Whirlpool. It begins with an introduction to cryptographic hash functions and describes how they take a message of arbitrary length and create a fixed-length message digest. It then provides details on the SHA-512 algorithm, including how it uses the Merkle-Damgard scheme and includes descriptions of its compression function and analysis. The document concludes with an overview of the Whirlpool algorithm, describing how it is based on the Miyaguchi-Preneel scheme and uses a modified AES cipher as its compression function.

Uploaded by

yohan surya
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
88 views

Cryptographic Hash Functions

This document discusses cryptographic hash functions and summarizes two specific algorithms: SHA-512 and Whirlpool. It begins with an introduction to cryptographic hash functions and describes how they take a message of arbitrary length and create a fixed-length message digest. It then provides details on the SHA-512 algorithm, including how it uses the Merkle-Damgard scheme and includes descriptions of its compression function and analysis. The document concludes with an overview of the Whirlpool algorithm, describing how it is based on the Miyaguchi-Preneel scheme and uses a modified AES cipher as its compression function.

Uploaded by

yohan surya
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 37

Dr. Yohan Suryanto, S.T, M.

T
Semester Genap 2019/2020

Cryptographic Hash
Functions
source:
1. Behrouz Foroyzan, “Introduction to Cryptography and Network Security”
2. Stallings, William. "Cryptography and Network Security“
1. Introduction
Outline 2. SHA 512
3. Whirlpool

Cryptographic Hash Functions


1 cryptographic hash function

Cryptographic Hash Functions


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.

Topics discussed in this section:

1. Iterated Hash Function


2. Two Groups of Compression Functions

Cryptographic Hash Functions


Iterated Hash Function
Merkle-Damgard Scheme

Cryptographic Hash Functions


Iterated Hash Function

Rabin Scheme

Cryptographic Hash Functions


Iterated Hash Function
Davies-Meyer Scheme

Cryptographic Hash Functions


Iterated Hash Function
Matyas-Meyer-Oseas scheme

Cryptographic Hash Functions


Iterated Hash Function
Miyaguchi-Preneel Scheme

Cryptographic Hash Functions


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

Cryptographic Hash Functions


2 SHA-512

Cryptographic Hash Functions


Transformations
SHA-512 is the version of SHA with a 512-bit message digest. This
version, like the others in the SHA family of algorithms, is based
on the Merkle-Damgard scheme.

Topics discussed in this section:

1. Introduction
2. Compression Function
3. Analysis

Cryptographic Hash Functions


Message digest creation SHA-512

Cryptographic Hash Functions


Message digest creation SHA-512 Cont
Message Preparation
SHA-512 insists that the length of the original message be less than 2128 bits.
SHA-512 creates a 512-bit message digest out of a message less than 2128.

Example:
This example shows that the message length limitation of SHA-512 is not a
serious problem. Suppose we need to send a message that is 2128 bits in
length. How long does it take for a communications network with a data rate
of 264 bits per second to send this message?

Solution
A communications network that can send 264 bits per second is not yet
available. Even if it were, it would take many years to send this message. This
tells us that we do not need to worry about the SHA-512 message length
restriction.
Cryptographic Hash Functions
Padding and length field in SHA-512

Cryptographic Hash Functions


A message block and the digest as words

Cryptographic Hash Functions


Word expansion in SHA-512

Cryptographic Hash Functions


Message Digest Initialization

Cryptographic Hash Functions


Compression function in SHA-512

Cryptographic Hash Functions


Structure of each round in SHA-512

Cryptographic Hash Functions


Compression function in SHA-512 Cont
Majority Function

Conditional Function

Rotate Functions

Cryptographic Hash Functions


Eighty constants used for eighty rounds in SHA-512

Cryptographic Hash Functions


3 Whirlpool

Cryptographic Hash Functions


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.

Topics discussed in this section:

1. Whirlpool Cipher
2. Summary
3. Analysis

Cryptographic Hash Functions


Whirlpool hash function

Cryptographic Hash Functions


General idea of the Whirlpool cipher

Cryptographic Hash Functions


Block and state in the Whirlpool cipher

Cryptographic Hash Functions


Structure of Each Round

Cryptographic Hash Functions


SubBytes transformations in the Whirlpool cipher
SubBytes Like in AES, SubBytes provide a nonlinear transformation.

Cryptographic Hash Functions


S-Box

Cryptographic Hash Functions


ShiftColumns transformation in the Whirlpool cipher

Cryptographic Hash Functions


MixRows transformation in the Whirlpool cipher

Cryptographic Hash Functions


Key expansion in the Whirlpool cipher

Cryptographic Hash Functions


Round constant for the third round

Cryptographic Hash Functions


Main characteristics of the Whirlpool cipher

Cryptographic Hash Functions


Analysis

Although Whirlpool has not been extensively studied or tested, it is based


on a robust scheme (Miyaguchi-Preneel), and for a compression function
uses a cipher that is based on AES, a cryptosystem that has been proved
very resistant to attacks. In addition, the size of the message digest is the
same as for SHA-512. Therefore it is expected to be a very strong
cryptographic hash function.

Cryptographic Hash Functions


Lifelong Learning
THANKS YOU

You might also like