Skip to content

Interview question · Cryptography, PKI & TLS

What properties should a cryptographic hash have, and why does a 256-bit hash give only about 128 bits of collision resistance?

Preimage, second preimage and collision resistance sound alike and protect different things. The birthday bound explains why the last one costs half the bits.

easyEssentialNewPreparation tags: Google, Microsoft, AmazonUpdated Nov 2026

Preimage, second preimage and collision resistance sound alike and protect different things. The birthday bound explains why the last one costs half the bits.

Make your first attempt

What would you say before reading the answer?

  1. 01 State the assumptions your answer depends on.
  2. 02 Explain the mechanism and choose a control.
  3. 03 Name a condition that would change your decision.

The worked answer includes an approach, scoring criteria and follow-up questions. Compare the reasoning with your own.

10 answers per topic instead of 5, plus saved progress and bookmarks · costs nothingor unlock all 529 remaining answers · $25

Every worked answer in all 17 topics, every lesson in every course, the full concept curriculum, the complete practice-test bank, and the downloadable security field guides.

6 months · One payment · No auto-renewal

What if · the follow-ups in this answer

The answer works through 6 follow-ups like an interviewer would

A team truncates SHA-256 to its first 32 bits to use as a short ID for uploaded documents, and as the key in a deduplication cache.

  1. What properties should a cryptographic hash have?
  2. What is the birthday bound?
  3. What goes wrong in the deduplication cache?
  4. What length should IDs and keys use?
  5. Should a hash ID also grant access?
  6. How would you fix the design?

Each rung has a nudge, a model answer, the principle that carries over and the weak answer to avoid. Premium opens every answer and ladder.

UP NEXT ON YOUR JOURNEY
DISCUSSION · 0

No comments yet. Share a correction or a different way to answer it.