The document discusses cryptographic hash functions, which are designed to ensure message integrity by producing a fixed-length digest from variable-length messages, making them secure and practically infeasible to invert. Key properties include collision resistance and pre-image resistance, vital for applications such as message authentication and digital signatures. Popular hashing algorithms mentioned include MD5 and various SHA versions, which are used in several security protocols.

1. McGraw-Hill ©The McGraw-Hill Companies, Inc.,
15.1
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Chapter 11
Message Integrity,Message Authentication
And Hash Functions

2. Cryptographic Hash Functions
Key Points
• Hash function Variable-length message
Fixed-length message digest
h=H(M)
• Cryptographic hash functions iterative use
of a compression function

3. Introduction
 When hash function provides security, this is called cryptographic hash functions.
Hash function protects the integrity of the message. If encryption process is
applying on message with hash function, it is also providing authentication and
confidentiality
 A hash function provides a property that has function applied on variable amount
of data (M) and then it produces the fixed amount of output data. If any bit or bits
changes in the data, then whole hash function output data will also change.
Cryptographic has function is one-way function, which is practically infeasible to
invert. The most popular hashing algorithm is MD5 and SHA.
l
,

4. Cryptographic Hash Functions
• Hash function
 One-way property
 Collision-free property
H
“Hash function”
M H(M)
Data Integrity
Computationally infeasible

5. Cryptographic Hash Functions
Block diagram

6. Properties of hash Function
Compression: As per compression properties, output of the hash function is much smaller
than the size of input.
Pre-image resistance: Pre-image resistance means difficult to find the input from given
hash function output. i.e., x=H(m). So if x is given, it is difficult to message m.
Weak Collision Resistance: Given message m1, weak collision resistance means that it is
difficult to produce another message m2 such that H(m1)=H(m2). i.e, it means it is
infeasible to find two different messages with the same hash value.
Strong Collision Resistance: Strong collision resistance means that is difficult to find any
two different messages that hash to the same value. i.e., it means it is hard to find m1 &
m2 such that same hash value H(m1) = H(m2)

7. Cryptographic Hash Functions
Applications
1. Message Authentication
2. Digital Signatures
3. Other Applications (Internet protocols)

8. Cryptographic Hash Functions
Message Authentication
• Message authentication
Mechanism or service used to verify the
integrity of a message.
No modification
No insertion
No deletion
No replay

9. Cryptographic Hash Functions
Message Authentication
Confidentiality
No
Confidentiality

10. Cryptographic Hash Functions
Message Authentication
Confidentiality

11. Cryptographic Hash Functions
Message Authentication
• No confidentiality: method (b) has an
advantage over methods (a) and (d)
less computation
• Avoid encryption method (c)
 Encryption software relatively slow
 Encryption hardware high cost
 Time high
 Encryption algorithms patents cost

12. Cryptographic Hash Functions
Message Authentication
M: variable-length message
K: secret key K
Output: fixed-size
MAC: message authentication code (keyed hash function)

13. Cryptographic Hash Functions
Digital Signatures
Public key
H
“Hash
function”
M H(M)
Encryption
algorithm
Private
key

14. Cryptographic Hash Functions
Digital Signatures

15. Cryptographic Hash Functions
Digital Signatures
• Digital signature private-key-
encrypted hash code authentication
(only the sender could have produced the
encrypted hash code, essence of the digital
signature technique)
• Confidentiality + Digital signature
message + private-key-encrypted hash code
encrypted using a symmetric secret key

16. Cryptographic Hash Functions
Other Applications
1. One-way password file
2. Intrusion detection
3. Virus detection
4. Pseudorandom function(PRF) or a
Pseudorandom number generator
(PRNG).

17. Cryptographic Hash Functions
Two Simple Hash Functions
1. Bit-by-Bit exclusive-OR (XOR) of every block

18. Cryptographic Hash Functions
Requirements and Security

19. Cryptographic Hash Functions
Secure Hash Algorithm(SHA)
• National Institute of Standards and
Technology (NIST)- Federal information
processing standard (FIPS 180)-1993
SHA-0 (1993)
SHA-1 (1995)
SHA-256
SHA-384 (2002)
SHA-512

20. Cryptographic Hash Functions
Secure Hash Algorithm(SHA)

21. Cryptographic Hash Functions
SHA-512 Logic

23. Cryptographic Hash Functions
SHA-512 Round Function

24. Thank you for your
attention