Scribd
Upload
7 views21 pages

Chapter 11 0

This chapter discusses hash functions, emphasizing their role in ensuring data integrity and message authentication. It outlines the properties of cryptographic hash functions, their applications in message authentication and digital signatures, and provides an overview of the SHA-512 algorithm. Various methods for utilizing hash codes for security purposes are also described, including encryption techniques and the creation of secure password files.

Uploaded by

Mahamad Ali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views21 pages

Chapter 11 0

This chapter discusses hash functions, emphasizing their role in ensuring data integrity and message authentication. It outlines the properties of cryptographic hash functions, their applications in message authentication and digital signatures, and provides an overview of the SHA-512 algorithm. Various methods for utilizing hash codes for security purposes are also described, including encryption techniques and the creation of secure password files.

Uploaded by

Mahamad Ali
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 21

Chapter 11

Hash Functions for


Message Authentication & Digital Signatures
Hash Functions
• The main objective of a hash function is data integrity. So,
hash used to detect changes to message
• A hash function H accepts a variable-length block of data M
as an input and produces a fixed-size hash value.
h = H(M)
• A change to any bit or bits in M results, with high probability,
in a change to the hash code.
• A cryptographic hash function is an algorithm for which it
is computationally infeasible to find :
– data mapping to a pre-specified hash result (one-way
property)
– two data mapping to same hash (collision-free property).
• Hash functions are often used to determine whether or
not data has changed.
Cryptographic Hash Function
Structure of Hash Functions

The hash algorithm involves repeated use of a compression function (f), that takes two
inputs (an n-bit input from the previous step, called the chaining variable, and a b-bit block)
and produces an n-bit output. At the start of hashing, the chaining variable has an initial value
that is specified as part of the algorithm. The final value of the chaining variable is the hash
value. Often, hence b > n the term compression. The hash function can be summarized as
Hash Functions & Message Authentication

Message authentication is a mechanism or service used to


verify the integrity of a message, by assuring that the data
received are exactly as sent.
A variety of ways in which a hash code can be
used to provide message authentication:

a.The message plus concatenated hash code is encrypted


using symmetric encryption. Since only A and B share the
secret key, the message must have come from A and has
not been altered. The hash code provides the structure or
redundancy required to achieve authentication.
b. Only the hash code is encrypted, using symmetric
encryption. This reduces the processing burden for those
applications not requiring confidentiality.
c. The two communicating parties share a common secret value S.
A computes the hash value over the concatenation of M and S
and appends the resulting hash value to M.
Because B possesses S, it can re-compute the hash value to
verify. Because the secret value itself is not sent, an opponent
(attacker) cannot modify an intercepted message and cannot
generate a false message.
d. Confidentiality can be added to the approach of
method (c) by encrypting the entire message plus
the hash code.
Hash Functions & Digital Signatures

The hash value of a message is encrypted with a user's


private key. Anyone who knows the user's public key can
verify the integrity of the message that is associated with
the digital signature.
In this case an attacker who wishes to alter the message
would need to know the user's private key.
A variety of ways in which a hash code can be
used to provide digital signature:

a. The hash code is encrypted, using public-key encryption


with the sender's private key.
b. The message plus the private-key-encrypted hash code
can be encrypted using a symmetric secret key. This is a
common technique.
Other Hash Function Uses

• To create a one-way password file


– store hash of password rather than actual password
• For intrusion detection and virus detection
– keep & check hash of files on system
• To construct a pseudorandom function (PRF) or a pseudorandom
number generator (PRNG). for the generation of symmetric keys.
Requirements for a Cryptographic Hash Function H
Secure Hash Algorithms (SHA) Versions
SHA-512 Overview

Step 1: Appending bits, consists of a single 1-bit followed by the


necessary number of 0-bits, so that its length is corresponding to 896
modulo 1024 [length = 896(mod 1024)]
– Padding is always added, even if the message is already of the desired length.
Step 2: Append length: A block of 128 bits [unsigned 128-bit integer]
Step 3: Initialize hash buffer. A 512-bit buffer is used to hold
intermediate and final results of the hash function.
Step 4: Process the message in 1024-bit blocks. Each round takes as
input the 512-bit buffer Hi, and updates the contents of that buffer.
Step 5: Output the final state value as the resulting hash
SHA-512 Overview
SHA-512 Processing of a Single 1024-Bit Block
SHA-512 Compression Function
• heart of the algorithm
• processing message in 1024-bit blocks
• consists of 80 rounds
– updating a 512-bit buffer
– using a 64-bit value Wt derived from the current
message block
– and a round constant based on cube root of first
80 prime numbers

You might also like