From b7c20ec368e3c501cb51ec44decd255ba3a468dd Mon Sep 17 00:00:00 2001 From: whileunless <160837828+whileunless@users.noreply.github.com> Date: Fri, 5 Apr 2024 09:05:26 +0200 Subject: [PATCH] Update crypto-hashes-and-collisions.md https://books.google.com/ngrams/graph?content=the+chance+is+extremely+little%2Cthe+chance+is+extremely+small&year_start=1800&year_end=2019&corpus=en-2019&smoothing=10&case_insensitive=true https://books.google.com/ngrams/graph?content=is+extremely+*&year_start=1800&year_end=2019&corpus=en-2019&smoothing=20&case_insensitive=true --- cryptographic-hash-functions/crypto-hashes-and-collisions.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/cryptographic-hash-functions/crypto-hashes-and-collisions.md b/cryptographic-hash-functions/crypto-hashes-and-collisions.md index 4630690..6dabffa 100644 --- a/cryptographic-hash-functions/crypto-hashes-and-collisions.md +++ b/cryptographic-hash-functions/crypto-hashes-and-collisions.md @@ -12,7 +12,7 @@ A **collision** means the same hash value for two different inputs. For simple h **Collisions** in the cryptographic hash functions are **extremely unlikely** to be found, so crypto **hashes** are considered to almost uniquely identify their corresponding input. Moreover, it is extremely hard to find an input message that hashes to given value. -Cryptographic hash functions are **one-way hash functions**, which are **infeasible to invert**. The chance to find a collision (by brute force) for a strong cryptographic hash function (like SHA-256) is extremely little. Let's define this in more details: +Cryptographic hash functions are **one-way hash functions**, which are **infeasible to invert**. The chance to find a collision (by brute force) for a strong cryptographic hash function (like SHA-256) is extremely small. Let's define this in more details: * Let's have hash value `h`=`hash(p)` for certain strong cryptographic hash function `hash`. * It is expected to be **extremely hard** to find an input `p'`, such that `hash(p')`=`h`.