liveBook · Manning

Compression function

A compression function is a function that transforms input information into a shorter or fixed-size representation.

How 2 Manning books explain it

Hacking Cryptography

A function that combines a fixed-size message block with a fixed-size state to produce a new fixed-size state in an iterative hash construction.

How it is used
Processes padded fixed-size message blocks into an iterative hash value within Merkle–Damgård constructions.
How deep it goes
Defines sequential state updates and contrasts sponge processing, without detailing the internal round function of a specific hash.
Examples
Uses MD5, SHA-1, SHA-256, and SHA-512 as Merkle–Damgård hash-function examples.
What you can do after
Evaluate/understand how iterative hash constructions transform message blocks into successive internal states.

Read how Hacking Cryptography explains compression function →

Real-World Cryptography

A compression function maps two inputs to one output whose size is the size of one input, thereby reducing represented data size.

How it is used
Supports SHA-2 hashing by repeatedly compressing padded message blocks into a final digest.
How deep it goes
Defines the size reduction and outlines Davies–Meyer and Merkle–Damgård, but defers block-cipher details.
Examples
Uses a size diagram, an eight-byte block padding example, and an iterative compression diagram.
What you can do after
Evaluate how SHA-2 transforms padded message blocks into a digest through repeated compression.

Read how Real-World Cryptography explains compression function →

Related concepts

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.