This repository has been archived by the owner on Oct 3, 2020. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 1
/
auth.ntlm.js
635 lines (565 loc) · 28.5 KB
/
auth.ntlm.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
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
(function(w) {
'use strict';
/* global FetchAuth */
/*
* A JavaScript implementation of the RSA Data Security, Inc. MD4 Message
* Digest Algorithm, as defined in RFC 1320.
* Version 2.1 Copyright (C) Jerrad Pierce, Paul Johnston 1999 - 2002.
* Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
* Distributed under the BSD License
* See http://pajhome.org.uk/crypt/md5 for more info.
*/
class MD4 {
static str(s) {
return MD4.binl2str(MD4.core(MD4.str2binl(s), s.length * MD4.chrsz));
}
static core(x, len) {
x[len >> 5] |= 0x80 << (len % 32);
x[(((len + 64) >>> 9) << 4) + 14] = len;
var a = 1732584193;
var b = -271733879;
var c = -1732584194;
var d = 271733878;
for (var i = 0; i < x.length; i += 16) {
var olda = a;
var oldb = b;
var oldc = c;
var oldd = d;
a = MD4.ff(a, b, c, d, x[i + 0], 3);
d = MD4.ff(d, a, b, c, x[i + 1], 7);
c = MD4.ff(c, d, a, b, x[i + 2], 11);
b = MD4.ff(b, c, d, a, x[i + 3], 19);
a = MD4.ff(a, b, c, d, x[i + 4], 3);
d = MD4.ff(d, a, b, c, x[i + 5], 7);
c = MD4.ff(c, d, a, b, x[i + 6], 11);
b = MD4.ff(b, c, d, a, x[i + 7], 19);
a = MD4.ff(a, b, c, d, x[i + 8], 3);
d = MD4.ff(d, a, b, c, x[i + 9], 7);
c = MD4.ff(c, d, a, b, x[i + 10], 11);
b = MD4.ff(b, c, d, a, x[i + 11], 19);
a = MD4.ff(a, b, c, d, x[i + 12], 3);
d = MD4.ff(d, a, b, c, x[i + 13], 7);
c = MD4.ff(c, d, a, b, x[i + 14], 11);
b = MD4.ff(b, c, d, a, x[i + 15], 19);
a = MD4.gg(a, b, c, d, x[i + 0], 3);
d = MD4.gg(d, a, b, c, x[i + 4], 5);
c = MD4.gg(c, d, a, b, x[i + 8], 9);
b = MD4.gg(b, c, d, a, x[i + 12], 13);
a = MD4.gg(a, b, c, d, x[i + 1], 3);
d = MD4.gg(d, a, b, c, x[i + 5], 5);
c = MD4.gg(c, d, a, b, x[i + 9], 9);
b = MD4.gg(b, c, d, a, x[i + 13], 13);
a = MD4.gg(a, b, c, d, x[i + 2], 3);
d = MD4.gg(d, a, b, c, x[i + 6], 5);
c = MD4.gg(c, d, a, b, x[i + 10], 9);
b = MD4.gg(b, c, d, a, x[i + 14], 13);
a = MD4.gg(a, b, c, d, x[i + 3], 3);
d = MD4.gg(d, a, b, c, x[i + 7], 5);
c = MD4.gg(c, d, a, b, x[i + 11], 9);
b = MD4.gg(b, c, d, a, x[i + 15], 13);
a = MD4.hh(a, b, c, d, x[i + 0], 3);
d = MD4.hh(d, a, b, c, x[i + 8], 9);
c = MD4.hh(c, d, a, b, x[i + 4], 11);
b = MD4.hh(b, c, d, a, x[i + 12], 15);
a = MD4.hh(a, b, c, d, x[i + 2], 3);
d = MD4.hh(d, a, b, c, x[i + 10], 9);
c = MD4.hh(c, d, a, b, x[i + 6], 11);
b = MD4.hh(b, c, d, a, x[i + 14], 15);
a = MD4.hh(a, b, c, d, x[i + 1], 3);
d = MD4.hh(d, a, b, c, x[i + 9], 9);
c = MD4.hh(c, d, a, b, x[i + 5], 11);
b = MD4.hh(b, c, d, a, x[i + 13], 15);
a = MD4.hh(a, b, c, d, x[i + 3], 3);
d = MD4.hh(d, a, b, c, x[i + 11], 9);
c = MD4.hh(c, d, a, b, x[i + 7], 11);
b = MD4.hh(b, c, d, a, x[i + 15], 15);
a = MD4.safeAdd(a, olda);
b = MD4.safeAdd(b, oldb);
c = MD4.safeAdd(c, oldc);
d = MD4.safeAdd(d, oldd);
}
return Array(a, b, c, d);
}
static cmn(q, a, b, x, s, t) {
return MD4.safeAdd(MD4.rol(MD4.safeAdd(MD4.safeAdd(a, q), MD4.safeAdd(x, t)), s), b);
}
static ff(a, b, c, d, x, s) {
return MD4.cmn((b & c) | ((~b) & d), a, 0, x, s, 0);
}
static gg(a, b, c, d, x, s) {
return MD4.cmn((b & c) | (b & d) | (c & d), a, 0, x, s, 1518500249);
}
static hh(a, b, c, d, x, s) {
return MD4.cmn(b ^ c ^ d, a, 0, x, s, 1859775393);
}
static safeAdd(x, y) {
var lsw = (x & 0xFFFF) + (y & 0xFFFF);
var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
return (msw << 16) | (lsw & 0xFFFF);
}
static rol(num, cnt) {
return (num << cnt) | (num >>> (32 - cnt));
}
static str2binl(str) {
var bin = Array();
var mask = (1 << MD4.chrsz) - 1;
for (var i = 0; i < str.length * MD4.chrsz; i += MD4.chrsz) {
bin[i >> 5] |= (str.charCodeAt(i / MD4.chrsz) & mask) << (i % 32);
}
return bin;
}
static binl2str(bin) {
var str = '';
var mask = (1 << MD4.chrsz) - 1;
for (var i = 0; i < bin.length * 32; i += MD4.chrsz) {
str += String.fromCharCode((bin[i >> 5] >>> (i % 32)) & mask);
}
return str;
}
static get chrsz() {
return 8;
}
}
//Paul Tero, July 2001
//http://www.tero.co.uk/des/
//
//Optimised for performance with large blocks by Michael Hayworth, November 2001
//http://www.netdealing.com
//
//THIS SOFTWARE IS PROVIDED "AS IS" AND
//ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
//IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
//ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
//FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
//DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
//OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
//HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
//LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
//OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
//SUCH DAMAGE.
class Des {
//this takes the key, the message, and whether to encrypt or decrypt
static des(key, message, encrypt, mode, iv, padding) {
//declaring this locally speeds things up a bit
var spfunction1 = new Array(0x1010400, 0, 0x10000, 0x1010404, 0x1010004, 0x10404, 0x4, 0x10000, 0x400, 0x1010400, 0x1010404, 0x400, 0x1000404, 0x1010004, 0x1000000, 0x4, 0x404, 0x1000400, 0x1000400, 0x10400, 0x10400, 0x1010000, 0x1010000, 0x1000404, 0x10004, 0x1000004, 0x1000004, 0x10004, 0, 0x404, 0x10404, 0x1000000, 0x10000, 0x1010404, 0x4, 0x1010000, 0x1010400, 0x1000000, 0x1000000, 0x400, 0x1010004, 0x10000, 0x10400, 0x1000004, 0x400, 0x4, 0x1000404, 0x10404, 0x1010404, 0x10004, 0x1010000, 0x1000404, 0x1000004, 0x404, 0x10404, 0x1010400, 0x404, 0x1000400, 0x1000400, 0, 0x10004, 0x10400, 0, 0x1010004);
var spfunction2 = new Array(-0x7fef7fe0, -0x7fff8000, 0x8000, 0x108020, 0x100000, 0x20, -0x7fefffe0, -0x7fff7fe0, -0x7fffffe0, -0x7fef7fe0, -0x7fef8000, -0x80000000, -0x7fff8000, 0x100000, 0x20, -0x7fefffe0, 0x108000, 0x100020, -0x7fff7fe0, 0, -0x80000000, 0x8000, 0x108020, -0x7ff00000, 0x100020, -0x7fffffe0, 0, 0x108000, 0x8020, -0x7fef8000, -0x7ff00000, 0x8020, 0, 0x108020, -0x7fefffe0, 0x100000, -0x7fff7fe0, -0x7ff00000, -0x7fef8000, 0x8000, -0x7ff00000, -0x7fff8000, 0x20, -0x7fef7fe0, 0x108020, 0x20, 0x8000, -0x80000000, 0x8020, -0x7fef8000, 0x100000, -0x7fffffe0, 0x100020, -0x7fff7fe0, -0x7fffffe0, 0x100020, 0x108000, 0, -0x7fff8000, 0x8020, -0x80000000, -0x7fefffe0, -0x7fef7fe0, 0x108000);
var spfunction3 = new Array(0x208, 0x8020200, 0, 0x8020008, 0x8000200, 0, 0x20208, 0x8000200, 0x20008, 0x8000008, 0x8000008, 0x20000, 0x8020208, 0x20008, 0x8020000, 0x208, 0x8000000, 0x8, 0x8020200, 0x200, 0x20200, 0x8020000, 0x8020008, 0x20208, 0x8000208, 0x20200, 0x20000, 0x8000208, 0x8, 0x8020208, 0x200, 0x8000000, 0x8020200, 0x8000000, 0x20008, 0x208, 0x20000, 0x8020200, 0x8000200, 0, 0x200, 0x20008, 0x8020208, 0x8000200, 0x8000008, 0x200, 0, 0x8020008, 0x8000208, 0x20000, 0x8000000, 0x8020208, 0x8, 0x20208, 0x20200, 0x8000008, 0x8020000, 0x8000208, 0x208, 0x8020000, 0x20208, 0x8, 0x8020008, 0x20200);
var spfunction4 = new Array(0x802001, 0x2081, 0x2081, 0x80, 0x802080, 0x800081, 0x800001, 0x2001, 0, 0x802000, 0x802000, 0x802081, 0x81, 0, 0x800080, 0x800001, 0x1, 0x2000, 0x800000, 0x802001, 0x80, 0x800000, 0x2001, 0x2080, 0x800081, 0x1, 0x2080, 0x800080, 0x2000, 0x802080, 0x802081, 0x81, 0x800080, 0x800001, 0x802000, 0x802081, 0x81, 0, 0, 0x802000, 0x2080, 0x800080, 0x800081, 0x1, 0x802001, 0x2081, 0x2081, 0x80, 0x802081, 0x81, 0x1, 0x2000, 0x800001, 0x2001, 0x802080, 0x800081, 0x2001, 0x2080, 0x800000, 0x802001, 0x80, 0x800000, 0x2000, 0x802080);
var spfunction5 = new Array(0x100, 0x2080100, 0x2080000, 0x42000100, 0x80000, 0x100, 0x40000000, 0x2080000, 0x40080100, 0x80000, 0x2000100, 0x40080100, 0x42000100, 0x42080000, 0x80100, 0x40000000, 0x2000000, 0x40080000, 0x40080000, 0, 0x40000100, 0x42080100, 0x42080100, 0x2000100, 0x42080000, 0x40000100, 0, 0x42000000, 0x2080100, 0x2000000, 0x42000000, 0x80100, 0x80000, 0x42000100, 0x100, 0x2000000, 0x40000000, 0x2080000, 0x42000100, 0x40080100, 0x2000100, 0x40000000, 0x42080000, 0x2080100, 0x40080100, 0x100, 0x2000000, 0x42080000, 0x42080100, 0x80100, 0x42000000, 0x42080100, 0x2080000, 0, 0x40080000, 0x42000000, 0x80100, 0x2000100, 0x40000100, 0x80000, 0, 0x40080000, 0x2080100, 0x40000100);
var spfunction6 = new Array(0x20000010, 0x20400000, 0x4000, 0x20404010, 0x20400000, 0x10, 0x20404010, 0x400000, 0x20004000, 0x404010, 0x400000, 0x20000010, 0x400010, 0x20004000, 0x20000000, 0x4010, 0, 0x400010, 0x20004010, 0x4000, 0x404000, 0x20004010, 0x10, 0x20400010, 0x20400010, 0, 0x404010, 0x20404000, 0x4010, 0x404000, 0x20404000, 0x20000000, 0x20004000, 0x10, 0x20400010, 0x404000, 0x20404010, 0x400000, 0x4010, 0x20000010, 0x400000, 0x20004000, 0x20000000, 0x4010, 0x20000010, 0x20404010, 0x404000, 0x20400000, 0x404010, 0x20404000, 0, 0x20400010, 0x10, 0x4000, 0x20400000, 0x404010, 0x4000, 0x400010, 0x20004010, 0, 0x20404000, 0x20000000, 0x400010, 0x20004010);
var spfunction7 = new Array(0x200000, 0x4200002, 0x4000802, 0, 0x800, 0x4000802, 0x200802, 0x4200800, 0x4200802, 0x200000, 0, 0x4000002, 0x2, 0x4000000, 0x4200002, 0x802, 0x4000800, 0x200802, 0x200002, 0x4000800, 0x4000002, 0x4200000, 0x4200800, 0x200002, 0x4200000, 0x800, 0x802, 0x4200802, 0x200800, 0x2, 0x4000000, 0x200800, 0x4000000, 0x200800, 0x200000, 0x4000802, 0x4000802, 0x4200002, 0x4200002, 0x2, 0x200002, 0x4000000, 0x4000800, 0x200000, 0x4200800, 0x802, 0x200802, 0x4200800, 0x802, 0x4000002, 0x4200802, 0x4200000, 0x200800, 0, 0x2, 0x4200802, 0, 0x200802, 0x4200000, 0x800, 0x4000002, 0x4000800, 0x800, 0x200002);
var spfunction8 = new Array(0x10001040, 0x1000, 0x40000, 0x10041040, 0x10000000, 0x10001040, 0x40, 0x10000000, 0x40040, 0x10040000, 0x10041040, 0x41000, 0x10041000, 0x41040, 0x1000, 0x40, 0x10040000, 0x10000040, 0x10001000, 0x1040, 0x41000, 0x40040, 0x10040040, 0x10041000, 0x1040, 0, 0, 0x10040040, 0x10000040, 0x10001000, 0x41040, 0x40000, 0x41040, 0x40000, 0x10041000, 0x1000, 0x40, 0x10040040, 0x1000, 0x41040, 0x10001000, 0x40, 0x10000040, 0x10040000, 0x10040040, 0x10000000, 0x40000, 0x10001040, 0, 0x10041040, 0x40040, 0x10000040, 0x10040000, 0x10001000, 0x10001040, 0, 0x10041040, 0x41000, 0x41000, 0x1040, 0x1040, 0x40040, 0x10000000, 0x10041000);
//create the 16 or 48 subkeys we will need
var keys = Des.createKeys(key);
var m = 0,
i, j, temp, right1, right2, left, right, looping;
var cbcleft, cbcleft2, cbcright, cbcright2;
var endloop, loopinc;
var len = message.length;
var chunk = 0;
//set up the loops for single and triple des
var iterations = keys.length === 32 ? 3 : 9; //single or triple des
if (iterations === 3) {
looping = encrypt ? new Array(0, 32, 2) : new Array(30, -2, -2);
} else {
looping = encrypt ? new Array(0, 32, 2, 62, 30, -2, 64, 96, 2) : new Array(94, 62, -2, 32, 64, 2, 30, -2, -2);
}
//pad the message depending on the padding parameter
if (padding === 2) {
message += ' '; //pad the message with spaces
} else if (padding === 1) {
temp = 8 - (len % 8);
message += String.fromCharCode(temp, temp, temp, temp, temp, temp, temp, temp);
if (temp === 8) {
len += 8;
}
//PKCS7 padding
} else if (!padding) {
message += '\0\0\0\0\0\0\0\0'; //pad the message out with null bytes
}
//store the result here
var result = '';
var tempresult = '';
if (mode === 1) { //CBC mode
cbcleft = (iv.charCodeAt(m++) << 24) | (iv.charCodeAt(m++) << 16) | (iv.charCodeAt(m++) << 8) | iv.charCodeAt(m++);
cbcright = (iv.charCodeAt(m++) << 24) | (iv.charCodeAt(m++) << 16) | (iv.charCodeAt(m++) << 8) | iv.charCodeAt(m++);
m = 0;
}
//loop through each 64 bit chunk of the message
while (m < len) {
left = (message.charCodeAt(m++) << 24) | (message.charCodeAt(m++) << 16) | (message.charCodeAt(m++) << 8) | message.charCodeAt(m++);
right = (message.charCodeAt(m++) << 24) | (message.charCodeAt(m++) << 16) | (message.charCodeAt(m++) << 8) | message.charCodeAt(m++);
//for Cipher Block Chaining mode, xor the message with the previous result
if (mode === 1) {
if (encrypt) {
left ^= cbcleft;
right ^= cbcright;
} else {
cbcleft2 = cbcleft;
cbcright2 = cbcright;
cbcleft = left;
cbcright = right;
}
}
//first each 64 but chunk of the message must be permuted according to IP
temp = ((left >>> 4) ^ right) & 0x0f0f0f0f;
right ^= temp;
left ^= (temp << 4);
temp = ((left >>> 16) ^ right) & 0x0000ffff;
right ^= temp;
left ^= (temp << 16);
temp = ((right >>> 2) ^ left) & 0x33333333;
left ^= temp;
right ^= (temp << 2);
temp = ((right >>> 8) ^ left) & 0x00ff00ff;
left ^= temp;
right ^= (temp << 8);
temp = ((left >>> 1) ^ right) & 0x55555555;
right ^= temp;
left ^= (temp << 1);
left = ((left << 1) | (left >>> 31));
right = ((right << 1) | (right >>> 31));
//do this either 1 or 3 times for each chunk of the message
for (j = 0; j < iterations; j += 3) {
endloop = looping[j + 1];
loopinc = looping[j + 2];
//now go through and perform the encryption or decryption
for (i = looping[j]; i !== endloop; i += loopinc) { //for efficiency
right1 = right ^ keys[i];
right2 = ((right >>> 4) | (right << 28)) ^ keys[i + 1];
//the result is attained by passing these bytes through the S selection functions
temp = left;
left = right;
right = temp ^ (spfunction2[(right1 >>> 24) & 0x3f] | spfunction4[(right1 >>> 16) & 0x3f] | spfunction6[(right1 >>> 8) & 0x3f] | spfunction8[right1 & 0x3f] | spfunction1[(right2 >>> 24) & 0x3f] | spfunction3[(right2 >>> 16) & 0x3f] | spfunction5[(right2 >>> 8) & 0x3f] | spfunction7[right2 & 0x3f]);
}
temp = left;
left = right;
right = temp; //unreverse left and right
} //for either 1 or 3 iterations
//move then each one bit to the right
left = ((left >>> 1) | (left << 31));
right = ((right >>> 1) | (right << 31));
//now perform IP-1, which is IP in the opposite direction
temp = ((left >>> 1) ^ right) & 0x55555555;
right ^= temp;
left ^= (temp << 1);
temp = ((right >>> 8) ^ left) & 0x00ff00ff;
left ^= temp;
right ^= (temp << 8);
temp = ((right >>> 2) ^ left) & 0x33333333;
left ^= temp;
right ^= (temp << 2);
temp = ((left >>> 16) ^ right) & 0x0000ffff;
right ^= temp;
left ^= (temp << 16);
temp = ((left >>> 4) ^ right) & 0x0f0f0f0f;
right ^= temp;
left ^= (temp << 4);
//for Cipher Block Chaining mode, xor the message with the previous result
if (mode === 1) {
if (encrypt) {
cbcleft = left;
cbcright = right;
} else {
left ^= cbcleft2;
right ^= cbcright2;
}
}
tempresult += String.fromCharCode((left >>> 24), ((left >>> 16) & 0xff), ((left >>> 8) & 0xff), (left & 0xff), (right >>> 24), ((right >>> 16) & 0xff), ((right >>> 8) & 0xff), (right & 0xff));
chunk += 8;
if (chunk === 512) {
result += tempresult;
tempresult = '';
chunk = 0;
}
} //for every 8 characters, or 64 bits in the message
//return the result as an array
return result + tempresult;
}
static createKeys(key) {
//declaring this locally speeds things up a bit
var pc2bytes0 = new Array(0, 0x4, 0x20000000, 0x20000004, 0x10000, 0x10004, 0x20010000, 0x20010004, 0x200, 0x204, 0x20000200, 0x20000204, 0x10200, 0x10204, 0x20010200, 0x20010204);
var pc2bytes1 = new Array(0, 0x1, 0x100000, 0x100001, 0x4000000, 0x4000001, 0x4100000, 0x4100001, 0x100, 0x101, 0x100100, 0x100101, 0x4000100, 0x4000101, 0x4100100, 0x4100101);
var pc2bytes2 = new Array(0, 0x8, 0x800, 0x808, 0x1000000, 0x1000008, 0x1000800, 0x1000808, 0, 0x8, 0x800, 0x808, 0x1000000, 0x1000008, 0x1000800, 0x1000808);
var pc2bytes3 = new Array(0, 0x200000, 0x8000000, 0x8200000, 0x2000, 0x202000, 0x8002000, 0x8202000, 0x20000, 0x220000, 0x8020000, 0x8220000, 0x22000, 0x222000, 0x8022000, 0x8222000);
var pc2bytes4 = new Array(0, 0x40000, 0x10, 0x40010, 0, 0x40000, 0x10, 0x40010, 0x1000, 0x41000, 0x1010, 0x41010, 0x1000, 0x41000, 0x1010, 0x41010);
var pc2bytes5 = new Array(0, 0x400, 0x20, 0x420, 0, 0x400, 0x20, 0x420, 0x2000000, 0x2000400, 0x2000020, 0x2000420, 0x2000000, 0x2000400, 0x2000020, 0x2000420);
var pc2bytes6 = new Array(0, 0x10000000, 0x80000, 0x10080000, 0x2, 0x10000002, 0x80002, 0x10080002, 0, 0x10000000, 0x80000, 0x10080000, 0x2, 0x10000002, 0x80002, 0x10080002);
var pc2bytes7 = new Array(0, 0x10000, 0x800, 0x10800, 0x20000000, 0x20010000, 0x20000800, 0x20010800, 0x20000, 0x30000, 0x20800, 0x30800, 0x20020000, 0x20030000, 0x20020800, 0x20030800);
var pc2bytes8 = new Array(0, 0x40000, 0, 0x40000, 0x2, 0x40002, 0x2, 0x40002, 0x2000000, 0x2040000, 0x2000000, 0x2040000, 0x2000002, 0x2040002, 0x2000002, 0x2040002);
var pc2bytes9 = new Array(0, 0x10000000, 0x8, 0x10000008, 0, 0x10000000, 0x8, 0x10000008, 0x400, 0x10000400, 0x408, 0x10000408, 0x400, 0x10000400, 0x408, 0x10000408);
var pc2bytes10 = new Array(0, 0x20, 0, 0x20, 0x100000, 0x100020, 0x100000, 0x100020, 0x2000, 0x2020, 0x2000, 0x2020, 0x102000, 0x102020, 0x102000, 0x102020);
var pc2bytes11 = new Array(0, 0x1000000, 0x200, 0x1000200, 0x200000, 0x1200000, 0x200200, 0x1200200, 0x4000000, 0x5000000, 0x4000200, 0x5000200, 0x4200000, 0x5200000, 0x4200200, 0x5200200);
var pc2bytes12 = new Array(0, 0x1000, 0x8000000, 0x8001000, 0x80000, 0x81000, 0x8080000, 0x8081000, 0x10, 0x1010, 0x8000010, 0x8001010, 0x80010, 0x81010, 0x8080010, 0x8081010);
var pc2bytes13 = new Array(0, 0x4, 0x100, 0x104, 0, 0x4, 0x100, 0x104, 0x1, 0x5, 0x101, 0x105, 0x1, 0x5, 0x101, 0x105);
//how many iterations (1 for des, 3 for triple des)
var iterations = key.length > 8 ? 3 : 1; //changed by Paul 16/6/2007 to use Triple DES for 9+ byte keys
//stores the return keys
var keys = new Array(32 * iterations);
//now define the left shifts which need to be done
var shifts = new Array(0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0);
//other variables
var lefttemp, righttemp, m = 0,
n = 0,
temp;
for (var j = 0; j < iterations; j++) { //either 1 or 3 iterations
let left = (key.charCodeAt(m++) << 24) | (key.charCodeAt(m++) << 16) | (key.charCodeAt(m++) << 8) | key.charCodeAt(m++);
let right = (key.charCodeAt(m++) << 24) | (key.charCodeAt(m++) << 16) | (key.charCodeAt(m++) << 8) | key.charCodeAt(m++);
temp = ((left >>> 4) ^ right) & 0x0f0f0f0f;
right ^= temp;
left ^= (temp << 4);
temp = ((right >>> -16) ^ left) & 0x0000ffff;
left ^= temp;
right ^= (temp << -16);
temp = ((left >>> 2) ^ right) & 0x33333333;
right ^= temp;
left ^= (temp << 2);
temp = ((right >>> -16) ^ left) & 0x0000ffff;
left ^= temp;
right ^= (temp << -16);
temp = ((left >>> 1) ^ right) & 0x55555555;
right ^= temp;
left ^= (temp << 1);
temp = ((right >>> 8) ^ left) & 0x00ff00ff;
left ^= temp;
right ^= (temp << 8);
temp = ((left >>> 1) ^ right) & 0x55555555;
right ^= temp;
left ^= (temp << 1);
//the right side needs to be shifted and to get the last four bits of the left side
temp = (left << 8) | ((right >>> 20) & 0x000000f0);
//left needs to be put upside down
left = (right << 24) | ((right << 8) & 0xff0000) | ((right >>> 8) & 0xff00) | ((right >>> 24) & 0xf0);
right = temp;
//now go through and perform these shifts on the left and right keys
for (var i = 0; i < shifts.length; i++) {
//shift the keys either one or two bits to the left
if (shifts[i]) {
left = (left << 2) | (left >>> 26);
right = (right << 2) | (right >>> 26);
} else {
left = (left << 1) | (left >>> 27);
right = (right << 1) | (right >>> 27);
}
left &= -0xf;
right &= -0xf;
//now apply PC-2, in such a way that E is easier when encrypting or decrypting
//this conversion will look like PC-2 except only the last 6 bits of each byte are used
//rather than 48 consecutive bits and the order of lines will be according to
//how the S selection functions will be applied: S2, S4, S6, S8, S1, S3, S5, S7
lefttemp = pc2bytes0[left >>> 28] | pc2bytes1[(left >>> 24) & 0xf] | pc2bytes2[(left >>> 20) & 0xf] | pc2bytes3[(left >>> 16) & 0xf] | pc2bytes4[(left >>> 12) & 0xf] | pc2bytes5[(left >>> 8) & 0xf] | pc2bytes6[(left >>> 4) & 0xf];
righttemp = pc2bytes7[right >>> 28] | pc2bytes8[(right >>> 24) & 0xf] | pc2bytes9[(right >>> 20) & 0xf] | pc2bytes10[(right >>> 16) & 0xf] | pc2bytes11[(right >>> 12) & 0xf] | pc2bytes12[(right >>> 8) & 0xf] | pc2bytes13[(right >>> 4) & 0xf];
temp = ((righttemp >>> 16) ^ lefttemp) & 0x0000ffff;
keys[n++] = lefttemp ^ temp;
keys[n++] = righttemp ^ (temp << 16);
}
} //for each iterations
//return the keys we've created
return keys;
}
}
class NtlmMessage {
constructor(data) {
this.data = [];
if (!data) {
return;
}
if (data.indexOf('NTLM ') === 0) {
data = data.substr(5);
}
atob(data).split('').map(function(c) {
this.push(c.charCodeAt(0));
}, this.data);
}
addByte(b) {
this.data.push(b);
}
addShort(s) {
this.data.push(s & 0xFF);
this.data.push((s >> 8) & 0xFF);
}
addString(str, utf16) {
if (utf16) {
// Fake UTF16 by padding each character in string.
str = str.split('').map(function(c) {
return (c + '\0');
}).join('');
}
for (var i = 0; i < str.length; i++) {
this.data.push(str.charCodeAt(i));
}
}
getString(offset, length) {
var result = '';
for (var i = 0; i < length; i++) {
if (offset + i >= this.data.length) {
return '';
}
result += String.fromCharCode(this.data[offset + i]);
}
return result;
}
getByte(offset) {
return this.data[offset];
}
toBase64() {
var str = String.fromCharCode.apply(null, this.data);
return btoa(str).replace(/.{76}(?=.)/g, '$&');
}
}
/**
* A base class for auth methods used in the library.
* On the base of https://github.com/erlandranvinge/ntlm.js/blob/master/ntlm.js
*/
class FetchNtlmAuth extends FetchAuth {
constructor(opts) {
super(opts);
this.url = opts.url;
this.lmHashedPassword = undefined;
this.ntHashedPassword = undefined;
this.setCredentials();
}
createMessage1(hostname) {
var msg1 = new NtlmMessage();
msg1.addString('NTLMSSP\0');
msg1.addByte(1);
msg1.addString('\0\0\0');
msg1.addShort(0xb203);
msg1.addString('\0\0');
msg1.addShort(this.domain.length);
msg1.addShort(this.domain.length);
msg1.addShort(32 + hostname.length);
msg1.addString('\0\0');
msg1.addShort(hostname.length);
msg1.addShort(hostname.length);
msg1.addShort(32);
msg1.addString('\0\0');
msg1.addString(hostname.toUpperCase());
msg1.addString(this.domain.toUpperCase());
return msg1;
}
getChallenge(data) {
var msg2 = new NtlmMessage(data);
if (msg2.getString(0, 8) !== 'NTLMSSP\0') {
throw new Error('Invalid NTLM response header.');
}
if (msg2.getByte(8) !== 2) {
throw new Error('Invalid NTLM response type.');
}
var challenge = msg2.getString(24, 8);
return challenge;
}
createMessage3(challenge, hostname) {
var lmResponse = this.buildResponse(this.lmHashedPassword, challenge);
var ntResponse = this.buildResponse(this.ntHashedPassword, challenge);
var username = this.uid;
var domain = this.domain;
var msg3 = new NtlmMessage();
msg3.addString('NTLMSSP\0');
msg3.addByte(3);
msg3.addString('\0\0\0');
msg3.addShort(24); // lmResponse
msg3.addShort(24);
msg3.addShort(64 + (domain.length + username.length + hostname.length) * 2);
msg3.addString('\0\0');
msg3.addShort(24); // ntResponse
msg3.addShort(24);
msg3.addShort(88 + (domain.length + username.length + hostname.length) * 2);
msg3.addString('\0\0');
msg3.addShort(domain.length * 2); // Domain.
msg3.addShort(domain.length * 2);
msg3.addShort(64);
msg3.addString('\0\0');
msg3.addShort(username.length * 2); // Username.
msg3.addShort(username.length * 2);
msg3.addShort(64 + domain.length * 2);
msg3.addShort('\0\0');
msg3.addShort(hostname.length * 2); // Hostname.
msg3.addShort(hostname.length * 2);
msg3.addShort(64 + (domain.length + username.length) * 2);
msg3.addString('\0\0');
msg3.addString('\0\0\0\0');
msg3.addShort(112 + (domain.length + username.length + hostname.length) * 2);
msg3.addString('\0\0');
msg3.addShort(0x8201);
msg3.addString('\0\0');
msg3.addString(domain.toUpperCase(), true); // "Some" string are passed as UTF-16.
msg3.addString(username, true);
msg3.addString(hostname.toUpperCase(), true);
msg3.addString(lmResponse);
msg3.addString(ntResponse);
return msg3;
}
createKey(str) {
var key56 = [];
while (str.length < 7) {
str += '\0';
}
str = str.substr(0, 7);
str.split('').map(function(c) {
this.push(c.charCodeAt(0));
}, key56);
var key = [0, 0, 0, 0, 0, 0, 0, 0];
key[0] = key56[0]; // Convert 56 bit key to 64 bit.
key[1] = ((key56[0] << 7) & 0xFF) | (key56[1] >> 1);
key[2] = ((key56[1] << 6) & 0xFF) | (key56[2] >> 2);
key[3] = ((key56[2] << 5) & 0xFF) | (key56[3] >> 3);
key[4] = ((key56[3] << 4) & 0xFF) | (key56[4] >> 4);
key[5] = ((key56[4] << 3) & 0xFF) | (key56[5] >> 5);
key[6] = ((key56[5] << 2) & 0xFF) | (key56[6] >> 6);
key[7] = (key56[6] << 1) & 0xFF;
for (var i = 0; i < key.length; i++) { // Fix DES key parity bits.
var bit = 0;
for (var k = 0; k < 7; k++) {
let t = key[i] >> k;
bit = (t ^ bit) & 0x1;
}
key[i] = (key[i] & 0xFE) | bit;
}
var result = '';
key.forEach((i) => {
result += String.fromCharCode(i);
});
return result;
}
buildResponse(key, text) {
while (key.length < 21) {
key += '\0';
}
var key1 = this.createKey(key.substr(0, 7));
var key2 = this.createKey(key.substr(7, 7));
var key3 = this.createKey(key.substr(14, 7));
return Des.des(key1, text, 1, 0) +
Des.des(key2, text, 1, 0) +
Des.des(key3, text, 1, 0);
}
getLocation(url) {
var l = document.createElement('a');
l.href = url;
return l;
}
// to be called by constructor
setCredentials() {
var domain = this.domain;
var password = this.passwd;
var magic = 'KGS!@#$%'; // Create LM password hash.
var lmPassword = password.toUpperCase().substr(0, 14);
while (lmPassword.length < 14) {
lmPassword += '\0';
}
var key1 = this.createKey(lmPassword);
var key2 = this.createKey(lmPassword.substr(7));
var lmHashedPassword = Des.des(key1, magic, 1, 0) +
Des.des(key2, magic, 1, 0);
var ntPassword = ''; // Create NT password hash.
for (var i = 0; i < password.length; i++) {
ntPassword += password.charAt(i) + '\0';
}
var ntHashedPassword = MD4.str(ntPassword);
this.domain = domain;
this.lmHashedPassword = lmHashedPassword;
this.ntHashedPassword = ntHashedPassword;
}
}
w.FetchNtlmAuth = FetchNtlmAuth;
})(window);