Cryptography and Network Security

5.

Cryptographic Hash Functions and Message Authentication

5.1.

5.1.1.

Definition and Properties

5.1.1.1.

Fixed Output Length

5.1.1.2.

Deterministic Computation

5.1.1.3.

Avalanche Effect

5.1.2.

Applications of Cryptographic Hash Functions

5.1.2.1.

Data Integrity Verification

5.1.2.2.

Password Storage and Verification

5.1.2.3.

Digital Signature Generation

5.1.2.4.

Message Authentication Codes

5.1.2.5.

Proof of Work Systems

5.1.3.

Security Requirements

5.1.3.1.

Preimage Resistance

5.1.3.1.1.

One-way Property

5.1.3.1.2.

First Preimage Attack

5.1.3.2.

Second Preimage Resistance

5.1.3.2.1.

Weak Collision Resistance

5.1.3.2.2.

Target Collision Attack

5.1.3.3.

Collision Resistance

5.1.3.3.1.

Strong Collision Resistance

5.1.3.3.2.

Birthday Attack

5.1.3.4.

Avalanche Effect

5.1.3.4.1.

Bit Independence

5.1.3.4.2.

Uniform Distribution

5.1.4.

Hash Function Construction

5.1.4.1.

Merkle-Damgård Construction

5.1.4.1.1.

Compression Function

5.1.4.1.2.

Padding Schemes

5.1.4.2.

Sponge Construction

5.1.4.2.1.

Absorption Phase

5.1.4.2.2.

Squeezing Phase

5.1.5.

Secure Hash Algorithm (SHA)

5.1.5.1.

5.1.5.1.1.

Structure and Operation

5.1.5.1.1.1.

Message Scheduling

5.1.5.1.1.2.

Compression Function

5.1.5.1.1.3.

Round Operations

5.1.5.1.2.

Security Issues

5.1.5.1.2.1.

Collision Attacks

5.1.5.1.2.2.

Deprecation Status

5.1.5.2.

5.1.5.2.1.

5.1.5.2.2.

5.1.5.2.2.1.

Algorithm Structure

5.1.5.2.2.2.

Message Expansion

5.1.5.2.2.3.

Compression Function

5.1.5.2.3.

5.1.5.2.4.

5.1.5.2.4.1.

64-bit Word Operations

5.1.5.2.4.2.

Extended Message Schedule

5.1.5.2.5.

Security Analysis

5.1.5.2.5.1.

Current Security Status

5.1.5.2.5.2.

5.1.5.3.

5.1.5.3.1.

Keccak Algorithm

5.1.5.3.1.1.

Sponge Construction

5.1.5.3.1.2.

Permutation Function

5.1.5.3.2.

Differences from SHA-2

5.1.5.3.2.1.

Construction Method

5.1.5.3.2.2.

Security Margins

5.1.5.3.3.

5.1.5.3.3.1.

5.1.5.3.3.2.

5.1.5.3.3.3.

5.1.5.3.3.4.

5.2.

Message Authentication Codes (MACs)

5.2.1.

MAC Requirements

5.2.1.1.

Authentication Property

5.2.1.2.

Integrity Verification

5.2.1.3.

Keyed Hash Functions

5.2.1.3.1.

Secret Key Requirement

5.2.1.4.

5.2.1.4.1.

Existential Unforgeability

5.2.1.4.2.

Strong Unforgeability

5.2.2.

Security Properties

5.2.2.1.

Computation Resistance

5.2.2.2.

Forgery Resistance

5.2.2.3.

Key Recovery Resistance

5.2.3.

MACs based on Hash Functions (HMAC)

5.2.3.1.

HMAC Construction

5.2.3.1.1.

Inner and Outer Padding

5.2.3.1.2.

5.2.3.2.

5.2.3.2.1.

Key Preparation

5.2.3.2.2.

Hash Computation

5.2.3.3.

Security Analysis

5.2.3.3.1.

Provable Security

5.2.3.3.2.

Resistance to Extension Attacks

5.2.4.

MACs based on Block Ciphers

5.2.4.1.

5.2.4.1.1.

Cipher Block Chaining

5.2.4.1.2.

Final Block Processing

5.2.4.2.

5.2.4.2.1.

CMAC Construction

5.2.4.2.2.

Subkey Generation

5.2.4.2.3.

Security Analysis

5.2.4.3.

5.2.4.3.1.

Galois Field Operations

5.2.4.3.2.

Authentication Tag Generation

Previous

4. Public-Key Cryptography and RSA

Go to top

Next

6. Digital Signatures and Authentication Protocols