From 7dcb7626d0101164386667842350b76214ec719b Mon Sep 17 00:00:00 2001
From: whileunless <160837828+whileunless@users.noreply.github.com>
Date: Fri, 5 Apr 2024 09:10:27 +0200
Subject: [PATCH] Add the article 'a' [ crypto-hashes-and-collisions.md]

---
 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..b9f2a3d 100644
--- a/cryptographic-hash-functions/crypto-hashes-and-collisions.md
+++ b/cryptographic-hash-functions/crypto-hashes-and-collisions.md
@@ -14,7 +14,7 @@ A **collision** means the same hash value for two different inputs. For simple h
 
 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:
 
-* Let's have hash value `h`=`hash(p)` for certain strong cryptographic hash function `hash`.
+* Let's have a hash value `h`=`hash(p)` for a certain strong cryptographic hash function `hash`.
 * It is expected to be **extremely hard** to find an input `p'`, such that `hash(p')`=`h`.
 * For most modern strong cryptographic hash functions there are **no known collisions**.