-
Notifications
You must be signed in to change notification settings - Fork 0
/
tlsh.js
594 lines (521 loc) · 17.5 KB
/
tlsh.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
/*
* Copyright 2013 Trend Micro Incorporated
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/*
* Port of C++ implementation tlsh to javascript.
*
* Construct Tlsh object with methods:
* update
* finale
* fromTlshStr
* reset
* hash
* totalDiff
*
* See tlsh.html for example use.
*/
var debug = false;
///////////////////////////////////////////////////////////////////////////////////
// From tlsh_util.cpp
var v_table = new Uint8Array([
1, 87, 49, 12, 176, 178, 102, 166, 121, 193, 6, 84, 249, 230, 44, 163,
14, 197, 213, 181, 161, 85, 218, 80, 64, 239, 24, 226, 236, 142, 38, 200,
110, 177, 104, 103, 141, 253, 255, 50, 77, 101, 81, 18, 45, 96, 31, 222,
25, 107, 190, 70, 86, 237, 240, 34, 72, 242, 20, 214, 244, 227, 149, 235,
97, 234, 57, 22, 60, 250, 82, 175, 208, 5, 127, 199, 111, 62, 135, 248,
174, 169, 211, 58, 66, 154, 106, 195, 245, 171, 17, 187, 182, 179, 0, 243,
132, 56, 148, 75, 128, 133, 158, 100, 130, 126, 91, 13, 153, 246, 216, 219,
119, 68, 223, 78, 83, 88, 201, 99, 122, 11, 92, 32, 136, 114, 52, 10,
138, 30, 48, 183, 156, 35, 61, 26, 143, 74, 251, 94, 129, 162, 63, 152,
170, 7, 115, 167, 241, 206, 3, 150, 55, 59, 151, 220, 90, 53, 23, 131,
125, 173, 15, 238, 79, 95, 89, 16, 105, 137, 225, 224, 217, 160, 37, 123,
118, 73, 2, 157, 46, 116, 9, 145, 134, 228, 207, 212, 202, 215, 69, 229,
27, 188, 67, 124, 168, 252, 42, 4, 29, 108, 21, 247, 19, 205, 39, 203,
233, 40, 186, 147, 198, 192, 155, 33, 164, 191, 98, 204, 165, 180, 117, 76,
140, 36, 210, 172, 41, 54, 159, 8, 185, 232, 113, 196, 231, 47, 146, 120,
51, 65, 28, 144, 254, 221, 93, 189, 194, 139, 112, 43, 71, 109, 184, 209]);
function b_mapping(salt, i, j, k)
{
var h = 0;
h = v_table[h ^ salt];
h = v_table[h ^ i];
h = v_table[h ^ j];
h = v_table[h ^ k];
return h;
}
var LOG_1_5 = 0.4054651;
var LOG_1_3 = 0.26236426;
var LOG_1_1 = 0.095310180;
function l_capturing(len) {
var i;
if( len <= 656 ) {
i = Math.floor( Math.log(len) / LOG_1_5 );
} else if( len <= 3199 ) {
i = Math.floor( Math.log(len) / LOG_1_3 - 8.72777 );
} else {
i = Math.floor( Math.log(len) / LOG_1_1 - 62.5472 );
}
return (i & 0xFF);
}
function swap_byte( i )
{
var byte = 0;
byte = ((i & 0xF0) >> 4) & 0x0F;
byte |= ((i & 0x0F) << 4) & 0xF0;
return byte;
}
function to_hex( data, len )
{
// Use TLSH.java implementation for to_hex
var s = new String;
for (var i=0; i<len; i++) {
if (data[i] < 16) {
s = s.concat("0");
}
debug && console.log("to_hex: "+data[i]);
s = s.concat(data[i].toString(16).toUpperCase());
}
return s;
}
function from_hex( str )
{
// Use TLSH.java implementation for from_hex
var ret = new Uint8Array(str.length / 2); // unsigned char array}
for (var i = 0; i < str.length; i += 2) {
ret[i / 2] = parseInt(str.substring(i, i + 2), 16);
}
return ret;
}
function mod_diff(x, y, R)
{
var dl = 0;
var dr = 0;
if ( y > x ){
dl = y - x;
dr = x + R - y;
}else{
dl = x - y;
dr = y + R - x;
}
return (dl > dr ? dr : dl);
}
// Use generateTable() from TLSH.java implementation
function generateTable()
{
var arraySize = 256;
var result = new Array(arraySize);
for (var i=0; i<result.length; i++)
{
result[i] = new Uint8Array(arraySize);
}
for (var i = 0; i < arraySize; i++) {
for (var j = 0; j < arraySize; j++) {
var x = i, y = j, d, diff = 0;
d = Math.abs(x % 4 - y % 4); diff += (d == 3 ? 6 : d);
x = Math.floor(x / 4);
y = Math.floor(y / 4);
d = Math.abs(x % 4 - y % 4); diff += (d == 3 ? 6 : d);
x = Math.floor(x / 4);
y = Math.floor(y / 4);
d = Math.abs(x % 4 - y % 4); diff += (d == 3 ? 6 : d);
x = Math.floor(x / 4);
y = Math.floor(y / 4);
d = Math.abs(x % 4 - y % 4); diff += (d == 3 ? 6 : d);
result[i][j] = diff;
}
}
return result;
}
var bit_pairs_diff_table = generateTable();
function h_distance( len, x, y)
{
var diff = 0;
for( var i=0; i<len; i++ ){
debug && console.log("bit_pairs_diff_table["+x[i]+"]["+y[i]+"]="+bit_pairs_diff_table[x[i]][y[i]]);
diff += bit_pairs_diff_table[ x[i] ][ y[i] ];
}
debug && console.log("h_distance returning "+diff);
return diff;
}
///////////////////////////////////////////////////////////////////////////////////
// from C #defines in tlsh_impl.h and tlsh_impl.cpp
var SLIDING_WND_SIZE = 5;
var RNG_SIZE = SLIDING_WND_SIZE;
function RNG_IDX(i) { return (i+RNG_SIZE) % RNG_SIZE; }
var TLSH_CHECKSUM_LEN = 1;
var BUCKETS = 256;
var EFF_BUCKETS = 128;
var CODE_SIZE = 32; // 128 * 2 bits = 32 bytes
var TLSH_STRING_LEN = 70; // 2 + 1 + 32 bytes = 70 hexidecimal chars
var RANGE_LVALUE = 256;
var RANGE_QRATIO = 16;
function SWAP_UINT(buf, x, y)
{
var int_tmp = buf.bucket_copy[x];
buf.bucket_copy[x] = buf.bucket_copy[y];
buf.bucket_copy[y] = int_tmp;
}
///////////////////////////////////////////////////////////////////////////////////
// TLSH member and non-member functions - from tlsh_impl.cpp
function partition(buf, left, right)
{
if( left == right ) {
return left;
}
if( left+1 == right ) {
if( buf.bucket_copy[left] > buf.bucket_copy[right] ) {
SWAP_UINT( buf, left, right );
}
return left;
}
var ret = left;
var pivot = (left + right)>>1;
var val = buf.bucket_copy[pivot];
buf.bucket_copy[pivot] = buf.bucket_copy[right];
buf.bucket_copy[right] = val;
for( var i = left; i < right; i++ ) {
if( buf.bucket_copy[i] < val ) {
SWAP_UINT( buf, ret, i );
ret++;
}
}
buf.bucket_copy[right] = buf.bucket_copy[ret];
buf.bucket_copy[ret] = val;
return ret;
}
function find_quartile(tlsh, quartiles)
{
var buf = new Object();
buf.bucket_copy = new Uint32Array(EFF_BUCKETS);
var short_cut_left = new Uint32Array(EFF_BUCKETS);
var short_cut_right = new Uint32Array(EFF_BUCKETS);
var spl = 0;
var spr = 0;
var p1 = EFF_BUCKETS/4-1;
var p2 = EFF_BUCKETS/2-1;
var p3 = EFF_BUCKETS-EFF_BUCKETS/4-1;
var end = EFF_BUCKETS-1;
for(var i=0; i<=end; i++) {
buf.bucket_copy[i] = tlsh.a_bucket[i];
}
for( var l=0, r=end; ; ) {
var ret = partition( buf, l, r );
if( ret > p2 ) {
r = ret - 1;
short_cut_right[spr] = ret;
spr++;
} else if( ret < p2 ){
l = ret + 1;
short_cut_left[spl] = ret;
spl++;
} else {
quartiles.q2 = buf.bucket_copy[p2];
break;
}
}
short_cut_left[spl] = p2-1;
short_cut_right[spr] = p2+1;
for( var i=0, l=0; i<=spl; i++ ) {
var r = short_cut_left[i];
if( r > p1 ) {
for( ; ; ) {
var ret = partition( buf, l, r );
if( ret > p1 ) {
r = ret-1;
} else if( ret < p1 ) {
l = ret+1;
} else {
quartiles.q1 = buf.bucket_copy[p1];
break;
}
}
break;
} else if( r < p1 ) {
l = r;
} else {
quartiles.q1 = buf.bucket_copy[p1];
break;
}
}
for( var i=0, r=end; i<=spr; i++ ) {
var l = short_cut_right[i];
if( l < p3 ) {
for( ; ; ) {
var ret = partition( buf, l, r );
if( ret > p3 ) {
r = ret-1;
} else if( ret < p3 ) {
l = ret+1;
} else {
quartiles.q3 = buf.bucket_copy[p3];
break;
}
}
break;
} else if( l > p3 ) {
r = l;
} else {
quartiles.q3 = buf.bucket_copy[p3];
break;
}
}
}
///////////////////////////////////////////////////////////////////////////////////
// Definition of tlsh object
var Tlsh = function ()
{
this.checksum = new Uint8Array(TLSH_CHECKSUM_LEN); // unsigned char array
this.slide_window = new Uint8Array(SLIDING_WND_SIZE);
this.a_bucket = new Uint32Array(BUCKETS); // unsigned int array
this.data_len = 0;
this.tmp_code = new Uint8Array(CODE_SIZE);
this.Lvalue = 0;
this.Q = 0;
this.lsh_code = new String;
this.lsh_code_valid = false;
};
// Use get/setQLo() and get/setQHi() from TLSH.java implementation
function getQLo(Q)
{
return (Q & 0x0F)
}
function getQHi(Q)
{
return ((Q & 0xF0) >> 4);
}
function setQLo(Q, x)
{
return (Q & 0xF0) | (x & 0x0F);
}
function setQHi(Q, x)
{
return (Q & 0x0F) | ((x & 0x0F) << 4);
}
// Allow caller to pass in length in case there are embedded null characters, as there
// are in strings str_1 and str_2 (see simple_test.cpp)
//
// length parameter defaults to str.length
Tlsh.prototype.update = function (str, length)
{
length = typeof length !== 'undefined' ? length : str.length;
var data = [];
for(var i = 0; i < length; i++) {
var code = str.charCodeAt(i);
if (code > 255) {
alert("Unexpected " + str[i] + " has value " + code + " which is too large");
return;
}
// Since charCodeAt returns between 0~65536, simply save every character as 2-bytes
// data.push(code & 0xff00, code & 0xff);
data.push(code & 0xff);
}
if (length != data.length)
{
alert("Unexpected string length:" + length + " is not equal to value unsigned char length: " + data.length);
return;
}
var j = this.data_len % RNG_SIZE;
var fed_len = this.data_len;
for( var i=0; i<length; i++, fed_len++, j=RNG_IDX(j+1) ) {
this.slide_window[j] = data[i];
debug && console.log("slide_window["+j+"]="+this.slide_window[j]);
if ( fed_len >= 4 ) {
//only calculate when input >= 5 bytes
var j_1 = RNG_IDX(j-1);
var j_2 = RNG_IDX(j-2);
var j_3 = RNG_IDX(j-3);
var j_4 = RNG_IDX(j-4);
for (var k = 0; k < TLSH_CHECKSUM_LEN; k++) {
if (k == 0) {
this.checksum[k] = b_mapping(0, this.slide_window[j], this.slide_window[j_1], this.checksum[k]);
debug && console.log("tlsh.checksum["+k+"]="+this.checksum[k]);
}
else {
// use calculated 1 byte checksums to expand the total checksum to 3 bytes
this.checksum[k] = b_mapping(this.checksum[k-1], this.slide_window[j], this.slide_window[j_1], this.checksum[k]);
}
}
var r;
r = b_mapping(2, this.slide_window[j], this.slide_window[j_1], this.slide_window[j_2]);
r = b_mapping(2, this.slide_window[j], this.slide_window[j_1], this.slide_window[j_2]);
r = b_mapping(2, this.slide_window[j], this.slide_window[j_1], this.slide_window[j_2]);
this.a_bucket[r]++;
r = b_mapping(3, this.slide_window[j], this.slide_window[j_1], this.slide_window[j_3]);
this.a_bucket[r]++;
r = b_mapping(5, this.slide_window[j], this.slide_window[j_2], this.slide_window[j_3]);
this.a_bucket[r]++;
r = b_mapping(7, this.slide_window[j], this.slide_window[j_2], this.slide_window[j_4]);
this.a_bucket[r]++;
r = b_mapping(11, this.slide_window[j], this.slide_window[j_1], this.slide_window[j_4]);
this.a_bucket[r]++;
r = b_mapping(13, this.slide_window[j], this.slide_window[j_3], this.slide_window[j_4]);
this.a_bucket[r]++;
}
}
this.data_len += length;
}
// final is a reserved word
Tlsh.prototype.finale = function (str, length)
{
if (typeof str !== 'undefined') {
this.update(str, length);
}
// incoming data must more than or equal to 512 bytes
if (this.data_len < 256) {
alert("ERROR: length too small - " + this.data_len); // + ")");
}
var quartiles = new Object();
quartiles.q1 = 0;
quartiles.q2 = 0;
quartiles.q3 = 0;
find_quartile(this, quartiles);
// buckets must be more than 50% non-zero
var nonzero = 0;
for(var i=0; i<CODE_SIZE; i++) {
for(var j=0; j<4; j++) {
if (this.a_bucket[4*i + j] > 0) {
nonzero++;
}
}
}
if (nonzero <= 4*CODE_SIZE/2) {
alert("ERROR: not enought variation in input - " + nonzero + " < " + 4*CODE_SIZE/2);
}
for(var i=0; i<CODE_SIZE; i++) {
var h=0;
for(var j=0; j<4; j++) {
var k = this.a_bucket[4*i + j];
if( quartiles.q3 < k ) {
h += 3 << (j*2); // leave the optimization j*2 = j<<1 or j*2 = j+j for compiler
} else if( quartiles.q2 < k ) {
h += 2 << (j*2);
} else if( quartiles.q1 < k ) {
h += 1 << (j*2);
}
}
this.tmp_code[i] = h;
}
this.Lvalue = l_capturing(this.data_len);
this.Q = setQLo(this.Q, ((quartiles.q1*100)/quartiles.q3) % 16);
this.Q = setQHi(this.Q, ((quartiles.q2*100)/quartiles.q3) % 16);
this.lsh_code_valid = true;
}
Tlsh.prototype.hash = function ()
{
if (this.lsh_code_valid == false) {
return "ERROR IN PROCESSING";
}
var tmp = new Object();
tmp.checksum = new Uint8Array(TLSH_CHECKSUM_LEN);
tmp.Lvalue = 0;
tmp.Q = 0;
tmp.tmp_code = new Uint8Array(CODE_SIZE);
for (var k = 0; k < TLSH_CHECKSUM_LEN; k++) {
tmp.checksum[k] = swap_byte( this.checksum[k] );
debug && console.log("After swap_byte for checksum: tmp.checksum:"+tmp.checksum[k]+", tlsh.checksum:"+this.checksum[k]);
}
tmp.Lvalue = swap_byte( this.Lvalue );
tmp.Q = swap_byte( this.Q );
debug && console.log("After swap_byte for Q: tmp.Q:"+tmp.Q+", tlsh.Q:"+this.Q);
for( var i=0; i < CODE_SIZE; i++ ){
tmp.tmp_code[i] = this.tmp_code[CODE_SIZE-1-i];
debug && console.log("tmp.tmp_code["+i+"]:"+tmp.tmp_code[i]);
}
this.lsh_code = to_hex(tmp.checksum, TLSH_CHECKSUM_LEN);
tmpArray = new Uint8Array(1);
tmpArray[0] = tmp.Lvalue;
this.lsh_code = this.lsh_code.concat(to_hex(tmpArray, 1));
tmpArray[0] = tmp.Q;
this.lsh_code = this.lsh_code.concat(to_hex(tmpArray, 1));
this.lsh_code = this.lsh_code.concat(to_hex(tmp.tmp_code, CODE_SIZE));
return this.lsh_code;
}
Tlsh.prototype.reset = function ()
{
this.checksum = new Uint8Array(TLSH_CHECKSUM_LEN);
this.slide_window = new Uint8Array(SLIDING_WND_SIZE);
this.a_bucket = new Uint32Array(BUCKETS);
this.data_len = 0;
this.tmp_code = new Uint8Array(CODE_SIZE);
this.Lvalue = 0;
this.Q = 0;
this.lsh_code = new String;
this.lsh_code_valid = false;
}
// len_diff defaults to true
Tlsh.prototype.totalDiff = function(other, len_diff)
{
if (this == other)
{
return 0;
}
len_diff = typeof len_diff !== 'undefined' ? len_diff : true;
var diff = 0;
if (len_diff) {
var ldiff = mod_diff( this.Lvalue, other.Lvalue, RANGE_LVALUE);
if ( ldiff == 0 )
diff = 0;
else if ( ldiff == 1 )
diff = 1;
else
diff += ldiff*12;
}
var q1diff = mod_diff( getQLo(this.Q), getQLo(other.Q), RANGE_QRATIO);
if ( q1diff <= 1 )
diff += q1diff;
else
diff += (q1diff-1)*12;
var q2diff = mod_diff( getQHi(this.Q), getQHi(other.Q), RANGE_QRATIO);
if ( q2diff <= 1)
diff += q2diff;
else
diff += (q2diff-1)*12;
for (var k = 0; k < TLSH_CHECKSUM_LEN; k++) {
if (this.checksum[k] != other.checksum[k] ) {
diff ++;
break;
}
}
diff += h_distance( CODE_SIZE, this.tmp_code, other.tmp_code );
return diff;
}
Tlsh.prototype.fromTlshStr = function(str)
{
if (str.length != TLSH_STRING_LEN) {
alert("Tlsh.fromTlshStr() - string has wrong length (" + str.length + " != " + TLSH_STRING_LEN + ")");
return;
}
for( var i=0; i < TLSH_STRING_LEN; i++ ) {
if (!(
(str[i] >= '0' && str[i] <= '9') ||
(str[i] >= 'A' && str[i] <= 'F') ||
(str[i] >= 'a' && str[i] <= 'f') ))
{
alert("Tlsh.fromTlshStr() - string has invalid (non-hex) characters");
return;
}
}
var tmp = from_hex(str);
// Order of assignment is based on order of fields in lsh_bin
// Also note that TLSH_CHECKSUM_LEN is 1
var i = 0;
this.checksum[i] = swap_byte( tmp[i++] );
this.Lvalue = swap_byte( tmp[i++] );
this.Q = swap_byte( tmp[i++] );
for( var j=0; j < CODE_SIZE; j++ ) {
this.tmp_code[j] = (tmp[i+CODE_SIZE-1-j]);
}
this.lsh_code_valid = true;
}