Cryptographic Hash Functions
Cryptographic Hash Functions
Cryptographic Hash Functions
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
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.
Rabin Scheme
1. Introduction
2. Compression Function
3. Analysis
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
Conditional Function
Rotate Functions
1. Whirlpool Cipher
2. Summary
3. Analysis