Theoremadvanced
Merkle-Damgard theorem
Also called Merkle-Damgard collision resistance preservation.
If the compression function is collision resistant, so is the iterated hash.
If the compression function is collision resistant, so is the iterated hash.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 0WC6B8 Edit this page History Report an error