From ce135edaa331d761a38e2aa29e8692d304fb6682 Mon Sep 17 00:00:00 2001 From: Francis Date: Mon, 22 Jun 2020 12:27:49 -0400 Subject: [PATCH 1/2] typo --- 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 523dcaa..7bc5f0a 100644 --- a/cryptographic-hash-functions/crypto-hashes-and-collisions.md +++ b/cryptographic-hash-functions/crypto-hashes-and-collisions.md @@ -15,7 +15,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`. -* It is expected to be **extremely hard** to find an input `p'`, such that `hash(p')`=`h`. +* 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**. The **ideal cryptographic hash function** should have the following properties: From ae8f03249c80bb57c50634d9a92bebf837e6dad0 Mon Sep 17 00:00:00 2001 From: Francis Date: Mon, 22 Jun 2020 12:49:24 -0400 Subject: [PATCH 2/2] spelling mistakes and typo correction --- cryptographic-hash-functions/hash-functions-applications.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/cryptographic-hash-functions/hash-functions-applications.md b/cryptographic-hash-functions/hash-functions-applications.md index d553ec7..f7eb737 100644 --- a/cryptographic-hash-functions/hash-functions-applications.md +++ b/cryptographic-hash-functions/hash-functions-applications.md @@ -20,7 +20,7 @@ The above example comes from the `/etc/shadow` file in a modern Linux system. Th ## Generate Unique ID -Generate an \(**almost**\) **unique ID** of certain document / message. Cryptographic hash functions almost uniquely identify documents based on their content. In theory **collisions are possible** with any cryptographic hash function, but are very unlikely to happen, so most systems \(like **Git**\) assume that the hash function they use is **collistion free**. +Generate an \(**almost**\) **unique ID** of certain document / message. Cryptographic hash functions almost uniquely identify documents based on their content. In theory **collisions are possible** with any cryptographic hash function, but are very unlikely to happen, so most systems \(like **Git**\) assume that the hash function they use is **collision free**. Usually a document is **hashed** and the **document ID** \(hash value\) is used later to prove the existence of the document, or to retrieve the document from a storage system. Example of hash-based unique IDs are the commit hashes in **Git** and **GitHub**, based on the content of the commit \(e.g. `3c3be25bc1757ca99aba55d4157596a8ea217698`\) and the **Bitcoin** addresses \(e.g. `1BvBMSEYstWetqTFn5Au4m4GFg7xJaNVN2`\). @@ -38,5 +38,5 @@ In the above example the SHA-1 unique ID identifies a certain commit in GitHub. ## Cryptographic Hashes are Part of Modern Programming -**Cryptographic hash functions** are so widely used, that they are often implemented as **build-in functions** in the standard libraries for the modern programming languages and platforms. +**Cryptographic hash functions** are so widely used, that they are often implemented as **built-in functions** in the standard libraries for the modern programming languages and platforms.