From d33c8d7933d3fd4bbd8894ec96c59d7a37d9c53e Mon Sep 17 00:00:00 2001 From: Heiko Schaefer Date: Thu, 2 Nov 2023 14:02:03 +0100 Subject: [PATCH] ch3: sharpen our terminology, use "hash digest" by default Fixes #98 --- book/source/03-cryptography.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/book/source/03-cryptography.md b/book/source/03-cryptography.md index 32c989b..12cbb66 100644 --- a/book/source/03-cryptography.md +++ b/book/source/03-cryptography.md @@ -8,12 +8,12 @@ SPDX-License-Identifier: CC-BY-SA-4.0 ## Cryptographic hash functions -[Cryptographic hash functions](https://en.wikipedia.org/wiki/Cryptographic_hash_function) take data strings of any length (like a text message or file) and output a fixed-size code, often called a "hash" or "digest." This hash acts like a unique identifier for the original data. +[Cryptographic hash functions](https://en.wikipedia.org/wiki/Cryptographic_hash_function) take data strings of any length (like a text message or file) and output a fixed-size code, a "hash digest". Often abbreviated as either "digest" or "hash." A hash digest acts like a unique identifier for the original data. Here are two important properties of cryptographic hash functions: -- ["Pre-image resistance"](https://en.wikipedia.org/wiki/Preimage_attack): Given a hash value, it should be very difficult to determine the original data it represents. -- ["Collision resistance"](https://en.wikipedia.org/wiki/Collision_resistance): It should be very difficult to find two distinct pieces of data that map to the same hash value. +- ["Pre-image resistance"](https://en.wikipedia.org/wiki/Preimage_attack): Given a hash digest, it should be very difficult to determine the original data it represents. +- ["Collision resistance"](https://en.wikipedia.org/wiki/Collision_resistance): It should be very difficult to find two distinct pieces of data that map to the same hash digest. ## Message authentication codes