1. • Applications of Cryptographic Hash Functions
Message Authentication
Digital Signatures
Other Applications
• Two Simple Hash Functions
• Requirements and Security
Security Requirements for Cryptographic Hash Functions
Brute-Force Attacks
Cryptanalysis
• Hash Functions Based on Cipher Block Chaining
• Secure Hash Algorithm (SHA)
SHA-512 Logic
SHA-512 Round Function
• 11.6 SHA-3
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. Cryptographic Hash Functions
• Hash function
One-way property
Collision-free property
H
“Hash function”
M H(M)
Data Integrity
Computationally infeasible
6. 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
• 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
13. 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
18. Cryptographic Hash Functions
Two Simple Hash Functions
2. Rotated exclusive-OR (XOR) of every block
i. Initially set the -bit hash value to zero.
ii. Process each successive -bit block of data as
follows:
a. Rotate the current hash value to the left
by one bit.
b. XOR the block into the hash value.
27. 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
33. Cryptographic Hash Functions
SHA-512 Logic
• Let 32 bit quantity 90AB12CD16
• 4 bytes are: 90, AB, 12, CD
• Two ways to store in memory
Address Value
1000 90
1001 AB
1002 12
1003 CD
Address Value
1000 CD
1001 12
1002 AB
1003 90
Big -
endian
Little -
endian
38. Cryptographic Hash Functions
SHA-3
• SHA-1& SHA-2 Not broken
• NIST competition (2007) SHA-3
Replace SHA-2 with SHA-3 in any application by
a simple drop-in substitution.
Preserve online nature (SHA-2) small
blocks (no buffer-entire message)