Professional Documents
Culture Documents
Cryptographic Hash Function Ch11 - Stallings
Cryptographic Hash Function Ch11 - Stallings
Network Security
Chapter 11
Fifth Edition
by William Stallings
a) Message
encrypted
b) Message
unencrypted
Hash Functions & Message
Authentication
Symmetric Key
Keyed Hash
a) Message
unencrypted
d) Message
encrypted
Hash Functions & Digital
Signatures - PKCS
Other Hash Function Uses
pseudorandom function (PRF)
Generate session keys, nonces
Produce key from password
Derive keys from master key cooperatively
pseudorandom number generator
(PRNG)
Vernam Cipher/OTP
S/Key, proof of “what you have” via messages
More Hash Function Uses
to create a one-way password file
store hash of password not actual password
e.g., Unix, Windows NT, etc.
salt to deter precomputation attacks
Rainbow tables
for intrusion detection and virus detection
keep & check hash of files on system
e.g., Tripwire
Lamport One-time Passwords
Password safety in distributed system
server compromise does not compromise P
interception of authentication exchange does
not compromise password either
Alice picks Password PA
Hashes password N times, HN(PA)
Server stores (Alice, N, HN(PA))
Attacker can’t get PA from HN(PA)
Lamport One-time Passwords
Protocol
Alice sends “I’m Alice”
Server sends “N-1”
Alice sends “X” where X=HN-1(PA)
Server verifies H(X) = HN(PA)
Server updates to (Alice, N-1, X)
Attackerstill can’t get PA or
authenticate as Alice
Hash Function Requirements
Simple Insecure Hash
Functions
Let n be a large integer. Let h(m) = m (mod n) be
regarded as an integer between 0 and (n-1).