From 83b24da40a6dffa7fe4730578f2921ac0070ab21 Mon Sep 17 00:00:00 2001
From: Logan oos Even <46396513+Logan007@users.noreply.github.com>
Date: Thu, 7 Jan 2021 22:13:40 +0545
Subject: [PATCH] updated section on hashing

typo
---
 doc/Crypto.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/doc/Crypto.md b/doc/Crypto.md
index 74cce22..a404c7f 100644
--- a/doc/Crypto.md
+++ b/doc/Crypto.md
@@ -72,7 +72,7 @@ Its initialization relies on seeding with a value as random as possible. Various
 
 For general purpose hashing, n2n employs [Pearson Block Hashing](https://github.com/Logan007/pearsonB) as it offers variable hash sizes and is said not to be too "collidy". However, this is not a cryptographically secure hashing function which by the way is not required here: The hashing is never applied in a way that the hash value shall publically prove the knowledge of a secret without showing the secret itself.
 
-_Pearson hashing is tweakable by using your own block-sized permutation._ Here, we use a three-round xor-rotate-multiply permutation scheme on 64-bit wide integer numbers with constants discovered by [David Stafford](http://zimbry.blogspot.com/2011/09/better-bit-mixing-improving-on.html) (`mix13`) permission obtained via eMail) which, these days, is better known as part of `splitmix64()`.
+_Pearson hashing is tweakable by using your own block-sized permutation._ Here, we use a three-round xor-rotate-multiply permutation scheme on 64-bit wide integer numbers with constants discovered by [David Stafford](http://zimbry.blogspot.com/2011/09/better-bit-mixing-improving-on.html) (`mix13`, permission obtained via eMail) which, these days, is better known as part of `splitmix64()`.
 
 _Pearson hashing allows verification of block-sized parts of the hash only – just in case performance requirements would urge to do so._