forked from tabatkins/password
-
Notifications
You must be signed in to change notification settings - Fork 0
/
index.html
813 lines (739 loc) · 25.9 KB
/
index.html
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
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
<!DOCTYPE html>
<html lang="en-GB" class="no-js">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<meta name="viewport" content="width=device-width, initial-scale=1, shrink-to-fit=no" />
<title>Password hasher</title>
<meta name="application-name" content="Password hasher" />
<meta name="author" content="tabatkins,tripu" />
<meta name="description" content="https://github.com/tripu/password" />
<meta name="keywords" content="password,hash,tool,security" />
<style type="text/css">
* {
box-sizing: border-box;
margin: 0;
border: 0;
padding: 0;
font-family: 'Lucida Sans Unicode', 'Lucida Grande', 'Trebuchet MS', Helvetica, Verdana, Geneva, Calibri, sans-serif;
color: #404040;
}
main {
position: absolute;
width: 100%;
height: 100%;
background: linear-gradient(90deg, rgb(224,240,255) 0%,rgb(255,255,255) 25%,rgb(255,255,255) 75%,rgb(224,240,255) 100%);
}
form {
position: relative;
top: 50%;
transform: translateY(-50%);
width: 90%;
max-width: 40rem;
margin: 1rem auto;
text-align: center;
}
fieldset:not(:last-child):not(.close), button {
margin-bottom: 1rem;
}
fieldset.close, fieldset.inline {
line-height: 1.5;
}
fieldset, button {
text-align: center;
}
fieldset.aligned {
text-align: right;
}
div {
display: block;
}
fieldset:not(.aligned) div {
display: inline-block;
}
fieldset.aligned div:not(:last-child) {
margin-bottom: .25rem;
}
label, input {
vertical-align: middle;
}
fieldset.close label, fieldset.close input, fieldset.inline label, fieldset.inline input {
vertical-align: baseline;
}
label, button:not(:disabled) {
cursor: pointer;
}
label {
overflow: hidden;
text-overflow: ellipsis;
transition: color .25s linear;
}
fieldset label {
padding-left: .25rem;
}
fieldset.close div:not(:last-child) label, fieldset.inline div:not(:last-child) label {
padding-right: 2rem;
}
fieldset.aligned label {
display: inline-block;
width: 33%;
padding: 0 .5rem 0 0;
max-width: 30%;
}
input {
border: 1px solid #808080;
padding: .2rem;
font-size: 1.25rem;
font-family: 'Source Code Pro', 'Source Code', Inconsolata, Consolas, monospace;
background-color: #ffffff;
}
input[type="text"], input[type="number"], input[type="password"], button {
outline: none;
}
input[type="text"]:focus, input[type="number"]:focus, input[type="password"]:focus, button:focus,
input[type="text"]:active, input[type="number"]:active, input[type="password"]:active, button:active,
input[type="text"]:hover, input[type="number"]:hover, input[type="password"]:hover, button:hover {
outline: 1px solid #000000;
}
fieldset.aligned input {
width: 67%;
}
button {
border-width: .1rem;
border-style: solid;
border-color: #f0f0f0 #d0d0d0 #d0d0d0 #f0f0f0;
padding: .25rem 1rem;
background-color: #e0e0e0;
}
button:disabled {
border-color: #d0d0d0 #f0f0f0 #f0f0f0 #d0d0d0;
color: #808080;
}
button:not(:disabled):hover, button:not(:disabled):active, button:not(:disabled):focus {
border-color: #f8f8f8 #c8c8c8 #c8c8c8 #f8f8f8;
background-color: #f0f0f0;
}
@media (min-width: 576px) {
body, body * {
font-size: 1.25rem;
}
fieldset:not(:last-child):not(.close), button {
margin-bottom: 2rem;
}
fieldset.aligned div:not(:last-child) {
margin-bottom: .5rem;
}
}
</style>
</head>
<body>
<main>
<form onsubmit="return generateCustomPassword(event)">
<fieldset class="aligned">
<div>
<label for="site-tag">Tag</label>
<input type=text id="site-tag" placeholder="twitter" autofocus autocomplete="on" name="Zae7Emie" />
</div>
<div>
<label for="master-key">Master key</label>
<input type="password" id="master-key" placeholder="zecretPassw0rd" />
</div>
</fieldset>
<fieldset class="close">
<div>
<input type="checkbox" id="digitsOnly" />
<label for="digitsOnly"><strong>Digits only</strong></label>
</div>
<div>
<input type="checkbox" id="noSpecial" />
<label for="noSpecial"><strong>No special</strong></label>
</div>
</fieldset>
<fieldset class="close">
<div>
<label for="digit">Ensure:</label>
</div>
<div>
<input type="checkbox" id="digit" checked />
<label for="digit">digits</label>
</div>
<div>
<input type="checkbox" id="punctuation" checked />
<label for="punctuation">punctuation</label>
</div>
<div>
<input type="checkbox" id="mixedCase" checked />
<label for="mixedCase">mixed case</label>
</div>
</fieldset>
<fieldset class="inline">
<div>
<label for="size" class="size">Size</label>
<input id="size" type="number" min="4" max="26" value="26" step="1" />
</div>
</fieldset>
<button id="generate" type="submit" disabled>Generate password</button>
<fieldset class="aligned">
<div>
<label for="hash-word">Password</label>
<input type="text" id="hash-word" readonly="readonly" />
</div>
</fieldset>
</form>
</main>
<script type="text/javascript">
{ 'use strict';
function findAll(sel) { return [].slice.call(document.querySelectorAll(sel)); }
function find(sel) { return document.querySelector(sel); }
function populateForm() {
var tag = find('#site-tag'),
masterKey = find('#master-key'),
digitsOnly = find('#digitsOnly'),
noSpecial = find('#noSpecial'),
digit = find('#digit'),
punctuation = find('#punctuation'),
mixedCase = find('#mixedCase'),
size = find('#size'),
url = new URL(window.location.href),
params = url.searchParams;
if (params.has('s')) {
var s = parseInt(params.get('s'));
if (isNaN(s) || s < 4 || s > 26)
throw new Error('Parameter "s" has an invalid value or is out of bounds.');
else {
size.value = s;
params.delete('s');
}
}
if (params.has('mc')) {
var mc = params.get('mc');
if ('0' !== mc && '1' !== mc)
throw new Error('Parameter "mc" has an invalid value.');
else {
mixedCase.checked = '1' === mc;
params.delete('mc');
}
}
if (params.has('p')) {
var p = params.get('p');
if ('0' !== p && '1' !== p)
throw new Error('Parameter "p" has an invalid value.');
else {
punctuation.checked = '1' === p;
params.delete('p');
}
}
if (params.has('d')) {
var d = params.get('d');
if ('0' !== d && '1' !== d)
throw new Error('Parameter "d" has an invalid value.');
else {
digit.checked = '1' === d;
params.delete('d');
}
}
if (params.has('ns')) {
var ns = params.get('ns');
if ('0' !== ns && '1' !== ns)
throw new Error('Parameter "ns" has an invalid value.');
else {
noSpecial.checked = '1' === ns;
params.delete('ns');
}
}
if (params.has('do')) {
var donly = params.get('do');
if ('0' !== donly && '1' !== donly)
throw new Error('Parameter "do" has an invalid value.');
else {
digitsOnly.checked = '1' === donly;
params.delete('do');
}
}
if (params.has('t')) {
var t = params.get('t');
if (!t)
throw new Error('Parameter "t" has an invalid value.');
else {
tag.value = t;
setTimeout(function() {
masterKey.select();
masterKey.focus();
}, 500);
params.delete('t');
}
}
if ('' == params)
update();
else
throw new Error('These parameters are not valid: "' + params + '"');
}
function checkReady() {
var siteTag = find('#site-tag'),
masterKey = find('#master-key'),
button = find('#generate'),
enabled = siteTag.value && masterKey.value;
button.disabled = !enabled;
return enabled;
}
function update(event) {
var digitsOnly = find('#digitsOnly'),
noSpecial = find('#noSpecial'),
digit = find('#digit'),
punctuation = find('#punctuation'),
mixedCase = find('#mixedCase');
if (digitsOnly.checked) {
noSpecial.disabled = digit.disabled = punctuation.disabled = mixedCase.disabled = true;
noSpecial.checked = punctuation.checked = mixedCase.checked = false;
digit.checked = true;
} else {
noSpecial.disabled = digit.disabled = mixedCase.disabled = false;
if (event && event.target && 'digitsOnly' === event.target.id) {
punctuation.disabled = false;
noSpecial.checked = false;
digit.checked = punctuation.checked = mixedCase.checked = true;
} else {
if (noSpecial.checked) {
punctuation.disabled = true;
punctuation.checked = false;
} else {
punctuation.disabled = false;
if (event && event.target && 'noSpecial' === event.target.id)
punctuation.checked = true;
}
}
}
findAll('input[type="checkbox"]:not(:disabled)').forEach(function (element) {
if (element && element.parentElement && element.parentElement.children && element.parentElement.children.length > 1)
element.parentElement.children[1].style.color = '#404040';
});
findAll('input[type="checkbox"]:disabled').forEach(function (element) {
if (element && element.parentElement && element.parentElement.children && element.parentElement.children.length > 1)
element.parentElement.children[1].style.color = '#c0c0c0';
});
}
function generateCustomPassword(e) {
if (e && e.preventDefault)
e.preventDefault();
if (!checkReady())
return;
var siteTag = find('#site-tag');
var masterKey = find('#master-key');
var hashWord = find('#hash-word');
var requireDigit = find("#digit").checked;
var requirePunctuation = find("#punctuation").checked;
var requireMixedCase = find("#mixedCase").checked;
var restrictSpecial = find("#noSpecial").checked;
var restrictDigits = find("#digitsOnly").checked;
var hashWordSize = Number(find("#size").value);
hashWord.value = PassHashCommon.generateHashWord(
siteTag.value,
masterKey.value,
hashWordSize,
requireDigit,
requirePunctuation,
requireMixedCase,
restrictSpecial,
restrictDigits);
hashWord.select();
hashWord.focus();
return false;
}
window.onload = function() {
try {
populateForm();
} catch (e) {
if (e) {
alert(e);
window.location.href = window.location.pathname;
}
}
findAll('input[type="text"], input[type="password"]').forEach(function (element) {
element.onkeyup = checkReady;
});
findAll("input[type='radio'], input[type='checkbox']").forEach(function(el){
el.onclick = update;
});
find('form').addEventListener('keydown', function (e) {
if ('Enter' === e.key)
generateCustomPassword();
});
};
}
</script>
<script>
/*
* A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined
* in FIPS PUB 180-1
* Version 2.1a Copyright Paul Johnston 2000 - 2002.
* Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
* Distributed under the BSD License
* See http://pajhome.org.uk/crypt/md5 for details.
*/
/*
* Configurable variables. You may need to tweak these to be compatible with
* the server-side, but the defaults work in most cases.
*/
var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */
var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */
var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */
/*
* These are the functions you'll usually want to call
* They take string arguments and return either hex or base-64 encoded strings
*/
function hex_sha1(s){return binb2hex(core_sha1(str2binb(s),s.length * chrsz));}
function b64_sha1(s){return binb2b64(core_sha1(str2binb(s),s.length * chrsz));}
function str_sha1(s){return binb2str(core_sha1(str2binb(s),s.length * chrsz));}
function hex_hmac_sha1(key, data){ return binb2hex(core_hmac_sha1(key, data));}
function b64_hmac_sha1(key, data){ return binb2b64(core_hmac_sha1(key, data));}
function str_hmac_sha1(key, data){ return binb2str(core_hmac_sha1(key, data));}
/*
* Perform a simple self-test to see if the VM is working
*/
function sha1_vm_test()
{
return hex_sha1("abc") == "a9993e364706816aba3e25717850c26c9cd0d89d";
}
/*
* Calculate the SHA-1 of an array of big-endian words, and a bit length
*/
function core_sha1(x, len)
{
/* append padding */
/* SC - Get rid of warning */
var i = (len >> 5);
if (x[i] == undefined)
x[i] = 0x80 << (24 - len % 32);
else
x[i] |= 0x80 << (24 - len % 32);
/*x[len >> 5] |= 0x80 << (24 - len % 32);*/
x[((len + 64 >> 9) << 4) + 15] = len;
var w = Array(80);
var a = 1732584193;
var b = -271733879;
var c = -1732584194;
var d = 271733878;
var e = -1009589776;
for(var i = 0; i < x.length; i += 16)
{
var olda = a;
var oldb = b;
var oldc = c;
var oldd = d;
var olde = e;
for(var j = 0; j < 80; j++)
{
if(j < 16) w[j] = x[i + j];
else w[j] = rol(w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16], 1);
var t = safe_add(safe_add(rol(a, 5), sha1_ft(j, b, c, d)),
safe_add(safe_add(e, w[j]), sha1_kt(j)));
e = d;
d = c;
c = rol(b, 30);
b = a;
a = t;
}
a = safe_add(a, olda);
b = safe_add(b, oldb);
c = safe_add(c, oldc);
d = safe_add(d, oldd);
e = safe_add(e, olde);
}
return Array(a, b, c, d, e);
}
/*
* Perform the appropriate triplet combination function for the current
* iteration
*/
function sha1_ft(t, b, c, d)
{
if(t < 20) return (b & c) | ((~b) & d);
if(t < 40) return b ^ c ^ d;
if(t < 60) return (b & c) | (b & d) | (c & d);
return b ^ c ^ d;
}
/*
* Determine the appropriate additive constant for the current iteration
*/
function sha1_kt(t)
{
return (t < 20) ? 1518500249 : (t < 40) ? 1859775393 :
(t < 60) ? -1894007588 : -899497514;
}
/*
* Calculate the HMAC-SHA1 of a key and some data
*/
function core_hmac_sha1(key, data)
{
var bkey = str2binb(key);
if(bkey.length > 16) bkey = core_sha1(bkey, key.length * chrsz);
var ipad = Array(16), opad = Array(16);
for(var i = 0; i < 16; i++)
{
/* SC - Get rid of warning */
var k = (bkey[i] != undefined ? bkey[i] : 0);
ipad[i] = k ^ 0x36363636;
opad[i] = k ^ 0x5C5C5C5C;
/* ipad[i] = bkey[i] ^ 0x36363636;
opad[i] = bkey[i] ^ 0x5C5C5C5C;*/
}
var hash = core_sha1(ipad.concat(str2binb(data)), 512 + data.length * chrsz);
return core_sha1(opad.concat(hash), 512 + 160);
}
/*
* Add integers, wrapping at 2^32. This uses 16-bit operations internally
* to work around bugs in some JS interpreters.
*/
function safe_add(x, y)
{
var lsw = (x & 0xFFFF) + (y & 0xFFFF);
var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
return (msw << 16) | (lsw & 0xFFFF);
}
/*
* Bitwise rotate a 32-bit number to the left.
*/
function rol(num, cnt)
{
return (num << cnt) | (num >>> (32 - cnt));
}
/*
* Convert an 8-bit or 16-bit string to an array of big-endian words
* In 8-bit function, characters >255 have their hi-byte silently ignored.
*/
function str2binb(str)
{
var bin = Array();
var mask = (1 << chrsz) - 1;
/* SC - Get rid of warnings */
for(var i = 0; i < str.length * chrsz; i += chrsz)
{
if (bin[i>>5] != undefined)
bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (32 - chrsz - i%32);
else
bin[i>>5] = (str.charCodeAt(i / chrsz) & mask) << (32 - chrsz - i%32);
}
/*for(var i = 0; i < str.length * chrsz; i += chrsz)
bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (32 - chrsz - i%32);*/
return bin;
}
/*
* Convert an array of big-endian words to a string
*/
function binb2str(bin)
{
var str = "";
var mask = (1 << chrsz) - 1;
for(var i = 0; i < bin.length * 32; i += chrsz)
str += String.fromCharCode((bin[i>>5] >>> (32 - chrsz - i%32)) & mask);
return str;
}
/*
* Convert an array of big-endian words to a hex string.
*/
function binb2hex(binarray)
{
var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
var str = "";
for(var i = 0; i < binarray.length * 4; i++)
{
str += hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8+4)) & 0xF) +
hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8 )) & 0xF);
}
return str;
}
/*
* Convert an array of big-endian words to a base-64 string
*/
function binb2b64(binarray)
{
var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
var str = "";
for(var i = 0; i < binarray.length * 4; i += 3)
{
/* SC - Get rid of warning */
var b1 = binarray[i >> 2] != undefined ? ((binarray[i >> 2] >> 8 * (3 - i %4)) & 0xFF) << 16 : 0;
var b2 = binarray[i+1 >> 2] != undefined ? ((binarray[i+1 >> 2] >> 8 * (3 - (i+1)%4)) & 0xFF) << 8 : 0;
var b3 = binarray[i+2 >> 2] != undefined ? ((binarray[i+2 >> 2] >> 8 * (3 - (i+2)%4)) & 0xFF) : 0;
var triplet = b1 | b2 | b3;
/*var triplet = (((binarray[i >> 2] >> 8 * (3 - i %4)) & 0xFF) << 16)
| (((binarray[i+1 >> 2] >> 8 * (3 - (i+1)%4)) & 0xFF) << 8 )
| ((binarray[i+2 >> 2] >> 8 * (3 - (i+2)%4)) & 0xFF);*/
for(var j = 0; j < 4; j++)
{
if(i * 8 + j * 6 > binarray.length * 32) str += b64pad;
else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);
}
}
return str;
}
</script>
<script>
/* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (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.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Password Hasher
*
* The Initial Developer of the Original Code is Steve Cooper.
* Portions created by the Initial Developer are Copyright (C) 2006
* the Initial Developer. All Rights Reserved.
*
* Contributor(s): (none)
*
* Alternatively, the contents of this file may be used under the terms of
* either the GNU General Public License Version 2 or later (the "GPL"), or
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
* in which case the provisions of the GPL or the LGPL are applicable instead
* of those above. If you wish to allow use of your version of this file only
* under the terms of either the GPL or the LGPL, and not to allow others to
* use your version of this file under the terms of the MPL, indicate your
* decision by deleting the provisions above and replace them with the notice
* and other provisions required by the GPL or the LGPL. If you do not delete
* the provisions above, a recipient may use your version of this file under
* the terms of any one of the MPL, the GPL or the LGPL.
*
* ***** END LICENSE BLOCK ***** */
var PassHashCommon =
{
// IMPORTANT: This function should be changed carefully. It must be
// completely deterministic and consistent between releases. Otherwise
// users would be forced to update their passwords. In other words, the
// algorithm must always be backward-compatible. It's only acceptable to
// violate backward compatibility when new options are used.
// SECURITY: The optional adjustments are positioned and calculated based
// on the sum of all character codes in the raw hash string. So it becomes
// far more difficult to guess the injected special characters without
// knowing the master key.
// TODO: Is it ok to assume ASCII is ok for adjustments?
generateHashWord: function(
siteTag,
masterKey,
hashWordSize,
requireDigit,
requirePunctuation,
requireMixedCase,
restrictSpecial,
restrictDigits)
{
// Start with the SHA1-encrypted master key/site tag.
var s = b64_hmac_sha1(masterKey, siteTag);
// Use the checksum of all characters as a pseudo-randomizing seed to
// avoid making the injected characters easy to guess. Note that it
// isn't random in the sense of not being deterministic (i.e.
// repeatable). Must share the same seed between all injected
// characters so that they are guaranteed unique positions based on
// their offsets.
var sum = 0;
for (var i = 0; i < s.length; i++)
sum += s.charCodeAt(i);
// Restrict digits just does a mod 10 of all the characters
if (restrictDigits)
s = PassHashCommon.convertToDigits(s, sum, hashWordSize);
else
{
// Inject digit, punctuation, and mixed case as needed.
if (requireDigit)
s = PassHashCommon.injectSpecialCharacter(s, 0, 4, sum, hashWordSize, 48, 10);
if (requirePunctuation && !restrictSpecial)
s = PassHashCommon.injectSpecialCharacter(s, 1, 4, sum, hashWordSize, 33, 15);
if (requireMixedCase)
{
s = PassHashCommon.injectSpecialCharacter(s, 2, 4, sum, hashWordSize, 65, 26);
s = PassHashCommon.injectSpecialCharacter(s, 3, 4, sum, hashWordSize, 97, 26);
}
// Strip out special characters as needed.
if (restrictSpecial)
s = PassHashCommon.removeSpecialCharacters(s, sum, hashWordSize);
}
// Trim it to size.
return s.substr(0, hashWordSize);
},
// This is a very specialized method to inject a character chosen from a
// range of character codes into a block at the front of a string if one of
// those characters is not already present.
// Parameters:
// sInput = input string
// offset = offset for position of injected character
// reserved = # of offsets reserved for special characters
// seed = seed for pseudo-randomizing the position and injected character
// lenOut = length of head of string that will eventually survive truncation.
// cStart = character code for first valid injected character.
// cNum = number of valid character codes starting from cStart.
injectSpecialCharacter: function(sInput, offset, reserved, seed, lenOut, cStart, cNum)
{
var pos0 = seed % lenOut;
var pos = (pos0 + offset) % lenOut;
// Check if a qualified character is already present
// Write the loop so that the reserved block is ignored.
for (var i = 0; i < lenOut - reserved; i++)
{
var i2 = (pos0 + reserved + i) % lenOut
var c = sInput.charCodeAt(i2);
if (c >= cStart && c < cStart + cNum)
return sInput; // Already present - nothing to do
}
var sHead = (pos > 0 ? sInput.substring(0, pos) : "");
var sInject = String.fromCharCode(((seed + sInput.charCodeAt(pos)) % cNum) + cStart);
var sTail = (pos + 1 < sInput.length ? sInput.substring(pos+1, sInput.length) : "");
return (sHead + sInject + sTail);
},
// Another specialized method to replace a class of character, e.g.
// punctuation, with plain letters and numbers.
// Parameters:
// sInput = input string
// seed = seed for pseudo-randomizing the position and injected character
// lenOut = length of head of string that will eventually survive truncation.
removeSpecialCharacters: function(sInput, seed, lenOut)
{
var s = '';
var i = 0;
while (i < lenOut)
{
var j = sInput.substring(i).search(/[^a-z0-9]/i);
if (j < 0)
break;
if (j > 0)
s += sInput.substring(i, i + j);
s += String.fromCharCode((seed + i) % 26 + 65);
i += (j + 1);
}
if (i < sInput.length)
s += sInput.substring(i);
return s;
},
// Convert input string to digits-only.
// Parameters:
// sInput = input string
// seed = seed for pseudo-randomizing the position and injected character
// lenOut = length of head of string that will eventually survive truncation.
convertToDigits: function(sInput, seed, lenOut)
{
var s = '';
var i = 0;
while (i < lenOut)
{
var j = sInput.substring(i).search(/[^0-9]/i);
if (j < 0)
break;
if (j > 0)
s += sInput.substring(i, i + j);
s += String.fromCharCode((seed + sInput.charCodeAt(i)) % 10 + 48);
i += (j + 1);
}
if (i < sInput.length)
s += sInput.substring(i);
return s;
},
}
</script>
</body>
</html>