**4.10.1**

30/09/2021
        merge in pull request 108 Configure CMake for pthreads
        fix to 48 Bucket hash

Author: jonjoliver

CMakeLists.txt

@@ -57,7 +57,7 @@ project(TLSH)
 
 set(VERSION_MAJOR 4)
 set(VERSION_MINOR 10)
-set(VERSION_PATCH 0)
+set(VERSION_PATCH 1)
 
 # TLSH uses only half the counting buckets.
 # It can use all the buckets now.

Change_History.md

@@ -703,3 +703,10 @@ TIME	ms= 21.00	per million iterations
 		using HAC-T
 	we provide scripts to show people how to cluster the Malware Bazaar dataset using TLSH
 </PRE>
+
+**4.10.1**
+<PRE>
+30/09/2021
+	merge in pull request 108 Configure CMake for pthreads
+	fix to 48 Bucket hash
+</PRE>

README.md

@@ -299,13 +299,11 @@ TLSH similarity is expressed as a difference score:
 
 # Current Version
 
-**4.10.0**
+**4.10.1**
 <PRE>
-22/09/2021
-	added Python tools for clustering file
-		using DBSCAN
-		using HAC-T
-	we provide scripts to show people how to cluster the Malware Bazaar dataset using TLSH
+30/09/2021
+	merge in pull request 108 Configure CMake for pthreads
+	fix to 48 Bucket hash
 </PRE>
 
 # Change History

include/tlsh_win_version.h

@@ -7,7 +7,7 @@
 
 #define VERSION_MAJOR		4
 #define VERSION_MINOR		10
-#define VERSION_PATCH		0
+#define VERSION_PATCH		1
 #define TLSH_HASH		"compact hash"
 #define TLSH_CHECKSUM		"1 byte checksum"
 

src/tlsh_impl.cpp

@@ -121,6 +121,25 @@ static unsigned char v_table[256] = {
     51, 65, 28, 144, 254, 221, 93, 189, 194, 139, 112, 43, 71, 109, 184, 209
 };
 
+static unsigned char v_table48[256] = {
+	1, 39, 1, 12, 32, 34, 6, 22, 25, 1, 6, 36, 48, 38, 44, 19,
+	14, 5, 21, 37, 17, 37, 26, 32, 16, 47, 24, 34, 44, 46, 38, 8,
+	14, 33, 8, 7, 45, 48, 48, 2, 29, 5, 33, 18, 45, 0, 31, 30,
+	25, 11, 46, 22, 38, 45, 48, 34, 24, 48, 20, 22, 48, 35, 5, 43,
+	1, 42, 9, 22, 12, 48, 34, 31, 16, 5, 31, 7, 15, 14, 39, 48,
+	30, 25, 19, 10, 18, 10, 10, 3, 48, 27, 17, 43, 38, 35, 0, 48,
+	36, 8, 4, 27, 32, 37, 14, 4, 34, 30, 43, 13, 9, 48, 24, 27,
+	23, 20, 31, 30, 35, 40, 9, 3, 26, 11, 44, 32, 40, 18, 4, 10,
+	42, 30, 0, 39, 12, 35, 13, 26, 47, 26, 48, 46, 33, 18, 15, 8,
+	26, 7, 19, 23, 48, 14, 3, 6, 7, 11, 7, 28, 42, 5, 23, 35,
+	29, 29, 15, 46, 31, 47, 41, 16, 9, 41, 33, 32, 25, 16, 37, 27,
+	22, 25, 2, 13, 46, 20, 9, 1, 38, 36, 15, 20, 10, 23, 21, 37,
+	27, 44, 19, 28, 24, 48, 42, 4, 29, 12, 21, 48, 19, 13, 39, 11,
+	41, 40, 42, 3, 6, 0, 11, 33, 20, 47, 2, 12, 21, 36, 21, 28,
+	44, 36, 18, 28, 41, 6, 15, 8, 41, 40, 17, 4, 39, 47, 2, 24,
+	3, 17, 28, 0, 48, 29, 45, 45, 2, 43, 16, 43, 23, 13, 40, 17,
+};
+
 // Pearson's algorithm
 unsigned char b_mapping(unsigned char salt, unsigned char i, unsigned char j, unsigned char k) {
     unsigned char h = 0;
@@ -144,7 +163,11 @@ unsigned char faster_b_mapping(unsigned char mod_salt, unsigned char i, unsigned
 }
 */
 
-#define fast_b_mapping(ms,i,j,k) (v_table[ v_table[ v_table[ms^i] ^ j] ^ k ])
+#if defined BUCKETS_48
+#define fast_b_mapping(ms,i,j,k) (v_table48[ v_table[ v_table[ms^i] ^ j] ^ k ])
+#else
+#define fast_b_mapping(ms,i,j,k) (v_table  [ v_table[ v_table[ms^i] ^ j] ^ k ])
+#endif
 
 ////////////////////////////////////////////////////////////////////////////////////////////