... files¹

MD5 checksums are designed to detect intentional tampering as well.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... ``difficult.''²

A cryptographically secure hash is defined as a hash with no known method better than brute force for finding collisions.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... paradox''³

The ``birthday paradox'' is best illustrated by the question, ``How many people do you need in a room to have a 50% or greater chance that two of them have the same birthday?'' The answer is $23$ (assuming that birthdays are uniformly distributed and neglecting leap years). This is easier to understand if you realize that there are $23 \times (22/2) = 253$ different pairs of people in the room.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... system⁴

LBFS uses variable sized blocks, but has minimum block size of 2KB to avoid pathologically small block sizes[4]

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.