This repository has been archived by the owner on Nov 16, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathgenpw.html
1953 lines (1815 loc) · 69.5 KB
/
genpw.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
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<!--
/**
* Simple password manager, based on a master password and patterns
*
* This file is a lightweight alternative to password managers/safes
* like KeePass, Clipperz, LastPass and others. The core of all operations
* is pure JavaScript, the whole generation will be done *locally* within
* your browser. No password data will be submitted over the network. No
* generated data will be stored.
*
* NOTE: You have to set a personal salt value before you can use this
* script. See http://andreas-haerter.com/projects/genpw and/or
* the README for installation and usage instructions.
*
* This program is using a SHA-512 implementation by Paul Johnston,
* distributed under the BSD License.
*
* LICENSE: This file is open source software (OSS) and may be copied under
* certain conditions. See COPYING file for details or try to
* contact the author(s) of this file in doubt.
*
* @version 2011-04-06
* @license New/3-clause BSD (http://opensource.org/licenses/bsd-license.php)
* @author Andreas Haerter <[email protected]>
* @link http://andreas-haerter.com/projects/genpw
* @link http://pajhome.org.uk/crypt/md5/sha512.html
*/
-->
<!-- I'm sure: nobody wants to see his generator accidentally listed on Google... -->
<meta name="allow-search" content="no" />
<meta name="audience" content="noone" />
<meta name="audience" content="no" />
<meta name="robots" content="noindex,nofollow,noarchive" />
<meta name="MSSmartTagsPreventParsing" content="true" />
<meta name="description" content="" />
<meta name="keywords" content="" />
<!-- no title: we are living in times of "intelligent" browser address bars
and not everybody using the browser should "find" this generator while
typing - let the filename/domain decide the behaviour. -->
<title></title>
<style type="text/css">
/* maintags */
body {
background-color: #fff;
}
font, td, body, p, div, select {
font-family: Verdana,Arial,Helvetica,Sans-Serif;
color: #202020;
font-size: 12px;
line-height: 16px;
text-decoration: none;
}
/* main form layout */
form {
margin: 50px 15px 15px 15px;
}
form table {
border: 0px;
width: 510px;
}
form table td {
background-color: #e9e9e9;
}
form table td.headline {
font-weight: bold;
}
form table td.left-col {
text-align: left;
width: 210px;
font-weight: bold;
padding-left: 10px;
}
form table td.right-col {
text-align: left;
}
form table td.colspan {
text-align: center;
}
/* input tags */
input, textarea {
font-family: "Courier New",Courier;
color: #202020;
font-size: 12px;
line-height: 16px;
}
/* links */
a:link, a:visited {
font-family: Verdana,Arial,Helvetica,Sans-Serif;
font-weight: normal;
color: #373c76;
text-decoration: underline;
}
a:hover {
font-family: Verdana,Arial,Helvetica,Sans-Serif;
font-weight: normal;
color: #000;
text-decoration: none;
}
/* classes */
.msg-err {
color: #f00;
font-weight: bold;
}
.msg-success {
color: #3c0;
font-weight: bold;
};
</style>
<script type="text/javascript">
/* <![CDATA[ */
/******************************************************************************/
/* SHA-512 implementation from sha512.js distributed under the BSD License
/* See <http://pajhome.org.uk/crypt/md5/sha512.html> for details.
/******************************************************************************/
/* BEGIN COPY & PASTE
/******************************************************************************/
/**
* A JavaScript implementation of the Secure Hash Algorithm, SHA-512, as defined
* in FIPS 180-2
* Version 2.2 Copyright Anonymous Contributor, Paul Johnston 2000 - 2009.
* 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 */
/*
* 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_sha512(s) { return rstr2hex(rstr_sha512(str2rstr_utf8(s))); }
function b64_sha512(s) { return rstr2b64(rstr_sha512(str2rstr_utf8(s))); }
function any_sha512(s, e) { return rstr2any(rstr_sha512(str2rstr_utf8(s)), e);}
function hex_hmac_sha512(k, d)
{ return rstr2hex(rstr_hmac_sha512(str2rstr_utf8(k), str2rstr_utf8(d))); }
function b64_hmac_sha512(k, d)
{ return rstr2b64(rstr_hmac_sha512(str2rstr_utf8(k), str2rstr_utf8(d))); }
function any_hmac_sha512(k, d, e)
{ return rstr2any(rstr_hmac_sha512(str2rstr_utf8(k), str2rstr_utf8(d)), e);}
/*
* Perform a simple self-test to see if the VM is working
*/
function sha512_vm_test()
{
return hex_sha512("abc").toLowerCase() ==
"ddaf35a193617abacc417349ae20413112e6fa4e89a97ea20a9eeee64b55d39a" +
"2192992a274fc1a836ba3c23a3feebbd454d4423643ce80e2a9ac94fa54ca49f";
}
/*
* Calculate the SHA-512 of a raw string
*/
function rstr_sha512(s)
{
return binb2rstr(binb_sha512(rstr2binb(s), s.length * 8));
}
/*
* Calculate the HMAC-SHA-512 of a key and some data (raw strings)
*/
function rstr_hmac_sha512(key, data)
{
var bkey = rstr2binb(key);
if(bkey.length > 32) bkey = binb_sha512(bkey, key.length * 8);
var ipad = Array(32), opad = Array(32);
for(var i = 0; i < 32; i++)
{
ipad[i] = bkey[i] ^ 0x36363636;
opad[i] = bkey[i] ^ 0x5C5C5C5C;
}
var hash = binb_sha512(ipad.concat(rstr2binb(data)), 1024 + data.length * 8);
return binb2rstr(binb_sha512(opad.concat(hash), 1024 + 512));
}
/*
* Convert a raw string to a hex string
*/
function rstr2hex(input)
{
try { hexcase } catch(e) { hexcase=0; }
var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
var output = "";
var x;
for(var i = 0; i < input.length; i++)
{
x = input.charCodeAt(i);
output += hex_tab.charAt((x >>> 4) & 0x0F)
+ hex_tab.charAt( x & 0x0F);
}
return output;
}
/*
* Convert a raw string to a base-64 string
*/
function rstr2b64(input)
{
try { b64pad } catch(e) { b64pad=''; }
var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
var output = "";
var len = input.length;
for(var i = 0; i < len; i += 3)
{
var triplet = (input.charCodeAt(i) << 16)
| (i + 1 < len ? input.charCodeAt(i+1) << 8 : 0)
| (i + 2 < len ? input.charCodeAt(i+2) : 0);
for(var j = 0; j < 4; j++)
{
if(i * 8 + j * 6 > input.length * 8) output += b64pad;
else output += tab.charAt((triplet >>> 6*(3-j)) & 0x3F);
}
}
return output;
}
/*
* Convert a raw string to an arbitrary string encoding
*/
function rstr2any(input, encoding)
{
var divisor = encoding.length;
var i, j, q, x, quotient;
/* Convert to an array of 16-bit big-endian values, forming the dividend */
var dividend = Array(Math.ceil(input.length / 2));
for(i = 0; i < dividend.length; i++)
{
dividend[i] = (input.charCodeAt(i * 2) << 8) | input.charCodeAt(i * 2 + 1);
}
/*
* Repeatedly perform a long division. The binary array forms the dividend,
* the length of the encoding is the divisor. Once computed, the quotient
* forms the dividend for the next step. All remainders are stored for later
* use.
*/
var full_length = Math.ceil(input.length * 8 /
(Math.log(encoding.length) / Math.log(2)));
var remainders = Array(full_length);
for(j = 0; j < full_length; j++)
{
quotient = Array();
x = 0;
for(i = 0; i < dividend.length; i++)
{
x = (x << 16) + dividend[i];
q = Math.floor(x / divisor);
x -= q * divisor;
if(quotient.length > 0 || q > 0)
quotient[quotient.length] = q;
}
remainders[j] = x;
dividend = quotient;
}
/* Convert the remainders to the output string */
var output = "";
for(i = remainders.length - 1; i >= 0; i--)
output += encoding.charAt(remainders[i]);
return output;
}
/*
* Encode a string as utf-8.
* For efficiency, this assumes the input is valid utf-16.
*/
function str2rstr_utf8(input)
{
var output = "";
var i = -1;
var x, y;
while(++i < input.length)
{
/* Decode utf-16 surrogate pairs */
x = input.charCodeAt(i);
y = i + 1 < input.length ? input.charCodeAt(i + 1) : 0;
if(0xD800 <= x && x <= 0xDBFF && 0xDC00 <= y && y <= 0xDFFF)
{
x = 0x10000 + ((x & 0x03FF) << 10) + (y & 0x03FF);
i++;
}
/* Encode output as utf-8 */
if(x <= 0x7F)
output += String.fromCharCode(x);
else if(x <= 0x7FF)
output += String.fromCharCode(0xC0 | ((x >>> 6 ) & 0x1F),
0x80 | ( x & 0x3F));
else if(x <= 0xFFFF)
output += String.fromCharCode(0xE0 | ((x >>> 12) & 0x0F),
0x80 | ((x >>> 6 ) & 0x3F),
0x80 | ( x & 0x3F));
else if(x <= 0x1FFFFF)
output += String.fromCharCode(0xF0 | ((x >>> 18) & 0x07),
0x80 | ((x >>> 12) & 0x3F),
0x80 | ((x >>> 6 ) & 0x3F),
0x80 | ( x & 0x3F));
}
return output;
}
/*
* Encode a string as utf-16
*/
function str2rstr_utf16le(input)
{
var output = "";
for(var i = 0; i < input.length; i++)
output += String.fromCharCode( input.charCodeAt(i) & 0xFF,
(input.charCodeAt(i) >>> 8) & 0xFF);
return output;
}
function str2rstr_utf16be(input)
{
var output = "";
for(var i = 0; i < input.length; i++)
output += String.fromCharCode((input.charCodeAt(i) >>> 8) & 0xFF,
input.charCodeAt(i) & 0xFF);
return output;
}
/*
* Convert a raw string to an array of big-endian words
* Characters >255 have their high-byte silently ignored.
*/
function rstr2binb(input)
{
var output = Array(input.length >> 2);
for(var i = 0; i < output.length; i++)
output[i] = 0;
for(var i = 0; i < input.length * 8; i += 8)
output[i>>5] |= (input.charCodeAt(i / 8) & 0xFF) << (24 - i % 32);
return output;
}
/*
* Convert an array of big-endian words to a string
*/
function binb2rstr(input)
{
var output = "";
for(var i = 0; i < input.length * 32; i += 8)
output += String.fromCharCode((input[i>>5] >>> (24 - i % 32)) & 0xFF);
return output;
}
/*
* Calculate the SHA-512 of an array of big-endian dwords, and a bit length
*/
var sha512_k;
function binb_sha512(x, len)
{
if(sha512_k == undefined)
{
//SHA512 constants
sha512_k = new Array(
new int64(0x428a2f98, -685199838), new int64(0x71374491, 0x23ef65cd),
new int64(-1245643825, -330482897), new int64(-373957723, -2121671748),
new int64(0x3956c25b, -213338824), new int64(0x59f111f1, -1241133031),
new int64(-1841331548, -1357295717), new int64(-1424204075, -630357736),
new int64(-670586216, -1560083902), new int64(0x12835b01, 0x45706fbe),
new int64(0x243185be, 0x4ee4b28c), new int64(0x550c7dc3, -704662302),
new int64(0x72be5d74, -226784913), new int64(-2132889090, 0x3b1696b1),
new int64(-1680079193, 0x25c71235), new int64(-1046744716, -815192428),
new int64(-459576895, -1628353838), new int64(-272742522, 0x384f25e3),
new int64(0xfc19dc6, -1953704523), new int64(0x240ca1cc, 0x77ac9c65),
new int64(0x2de92c6f, 0x592b0275), new int64(0x4a7484aa, 0x6ea6e483),
new int64(0x5cb0a9dc, -1119749164), new int64(0x76f988da, -2096016459),
new int64(-1740746414, -295247957), new int64(-1473132947, 0x2db43210),
new int64(-1341970488, -1728372417), new int64(-1084653625, -1091629340),
new int64(-958395405, 0x3da88fc2), new int64(-710438585, -1828018395),
new int64(0x6ca6351, -536640913), new int64(0x14292967, 0xa0e6e70),
new int64(0x27b70a85, 0x46d22ffc), new int64(0x2e1b2138, 0x5c26c926),
new int64(0x4d2c6dfc, 0x5ac42aed), new int64(0x53380d13, -1651133473),
new int64(0x650a7354, -1951439906), new int64(0x766a0abb, 0x3c77b2a8),
new int64(-2117940946, 0x47edaee6), new int64(-1838011259, 0x1482353b),
new int64(-1564481375, 0x4cf10364), new int64(-1474664885, -1136513023),
new int64(-1035236496, -789014639), new int64(-949202525, 0x654be30),
new int64(-778901479, -688958952), new int64(-694614492, 0x5565a910),
new int64(-200395387, 0x5771202a), new int64(0x106aa070, 0x32bbd1b8),
new int64(0x19a4c116, -1194143544), new int64(0x1e376c08, 0x5141ab53),
new int64(0x2748774c, -544281703), new int64(0x34b0bcb5, -509917016),
new int64(0x391c0cb3, -976659869), new int64(0x4ed8aa4a, -482243893),
new int64(0x5b9cca4f, 0x7763e373), new int64(0x682e6ff3, -692930397),
new int64(0x748f82ee, 0x5defb2fc), new int64(0x78a5636f, 0x43172f60),
new int64(-2067236844, -1578062990), new int64(-1933114872, 0x1a6439ec),
new int64(-1866530822, 0x23631e28), new int64(-1538233109, -561857047),
new int64(-1090935817, -1295615723), new int64(-965641998, -479046869),
new int64(-903397682, -366583396), new int64(-779700025, 0x21c0c207),
new int64(-354779690, -840897762), new int64(-176337025, -294727304),
new int64(0x6f067aa, 0x72176fba), new int64(0xa637dc5, -1563912026),
new int64(0x113f9804, -1090974290), new int64(0x1b710b35, 0x131c471b),
new int64(0x28db77f5, 0x23047d84), new int64(0x32caab7b, 0x40c72493),
new int64(0x3c9ebe0a, 0x15c9bebc), new int64(0x431d67c4, -1676669620),
new int64(0x4cc5d4be, -885112138), new int64(0x597f299c, -60457430),
new int64(0x5fcb6fab, 0x3ad6faec), new int64(0x6c44198c, 0x4a475817));
}
//Initial hash values
var H = new Array(
new int64(0x6a09e667, -205731576),
new int64(-1150833019, -2067093701),
new int64(0x3c6ef372, -23791573),
new int64(-1521486534, 0x5f1d36f1),
new int64(0x510e527f, -1377402159),
new int64(-1694144372, 0x2b3e6c1f),
new int64(0x1f83d9ab, -79577749),
new int64(0x5be0cd19, 0x137e2179));
var T1 = new int64(0, 0),
T2 = new int64(0, 0),
a = new int64(0,0),
b = new int64(0,0),
c = new int64(0,0),
d = new int64(0,0),
e = new int64(0,0),
f = new int64(0,0),
g = new int64(0,0),
h = new int64(0,0),
//Temporary variables not specified by the document
s0 = new int64(0, 0),
s1 = new int64(0, 0),
Ch = new int64(0, 0),
Maj = new int64(0, 0),
r1 = new int64(0, 0),
r2 = new int64(0, 0),
r3 = new int64(0, 0);
var j, i;
var W = new Array(80);
for(i=0; i<80; i++)
W[i] = new int64(0, 0);
// append padding to the source string. The format is described in the FIPS.
x[len >> 5] |= 0x80 << (24 - (len & 0x1f));
x[((len + 128 >> 10)<< 5) + 31] = len;
for(i = 0; i<x.length; i+=32) //32 dwords is the block size
{
int64copy(a, H[0]);
int64copy(b, H[1]);
int64copy(c, H[2]);
int64copy(d, H[3]);
int64copy(e, H[4]);
int64copy(f, H[5]);
int64copy(g, H[6]);
int64copy(h, H[7]);
for(j=0; j<16; j++)
{
W[j].h = x[i + 2*j];
W[j].l = x[i + 2*j + 1];
}
for(j=16; j<80; j++)
{
//sigma1
int64rrot(r1, W[j-2], 19);
int64revrrot(r2, W[j-2], 29);
int64shr(r3, W[j-2], 6);
s1.l = r1.l ^ r2.l ^ r3.l;
s1.h = r1.h ^ r2.h ^ r3.h;
//sigma0
int64rrot(r1, W[j-15], 1);
int64rrot(r2, W[j-15], 8);
int64shr(r3, W[j-15], 7);
s0.l = r1.l ^ r2.l ^ r3.l;
s0.h = r1.h ^ r2.h ^ r3.h;
int64add4(W[j], s1, W[j-7], s0, W[j-16]);
}
for(j = 0; j < 80; j++)
{
//Ch
Ch.l = (e.l & f.l) ^ (~e.l & g.l);
Ch.h = (e.h & f.h) ^ (~e.h & g.h);
//Sigma1
int64rrot(r1, e, 14);
int64rrot(r2, e, 18);
int64revrrot(r3, e, 9);
s1.l = r1.l ^ r2.l ^ r3.l;
s1.h = r1.h ^ r2.h ^ r3.h;
//Sigma0
int64rrot(r1, a, 28);
int64revrrot(r2, a, 2);
int64revrrot(r3, a, 7);
s0.l = r1.l ^ r2.l ^ r3.l;
s0.h = r1.h ^ r2.h ^ r3.h;
//Maj
Maj.l = (a.l & b.l) ^ (a.l & c.l) ^ (b.l & c.l);
Maj.h = (a.h & b.h) ^ (a.h & c.h) ^ (b.h & c.h);
int64add5(T1, h, s1, Ch, sha512_k[j], W[j]);
int64add(T2, s0, Maj);
int64copy(h, g);
int64copy(g, f);
int64copy(f, e);
int64add(e, d, T1);
int64copy(d, c);
int64copy(c, b);
int64copy(b, a);
int64add(a, T1, T2);
}
int64add(H[0], H[0], a);
int64add(H[1], H[1], b);
int64add(H[2], H[2], c);
int64add(H[3], H[3], d);
int64add(H[4], H[4], e);
int64add(H[5], H[5], f);
int64add(H[6], H[6], g);
int64add(H[7], H[7], h);
}
//represent the hash as an array of 32-bit dwords
var hash = new Array(16);
for(i=0; i<8; i++)
{
hash[2*i] = H[i].h;
hash[2*i + 1] = H[i].l;
}
return hash;
}
//A constructor for 64-bit numbers
function int64(h, l)
{
this.h = h;
this.l = l;
//this.toString = int64toString;
}
//Copies src into dst, assuming both are 64-bit numbers
function int64copy(dst, src)
{
dst.h = src.h;
dst.l = src.l;
}
//Right-rotates a 64-bit number by shift
//Won't handle cases of shift>=32
//The function revrrot() is for that
function int64rrot(dst, x, shift)
{
dst.l = (x.l >>> shift) | (x.h << (32-shift));
dst.h = (x.h >>> shift) | (x.l << (32-shift));
}
//Reverses the dwords of the source and then rotates right by shift.
//This is equivalent to rotation by 32+shift
function int64revrrot(dst, x, shift)
{
dst.l = (x.h >>> shift) | (x.l << (32-shift));
dst.h = (x.l >>> shift) | (x.h << (32-shift));
}
//Bitwise-shifts right a 64-bit number by shift
//Won't handle shift>=32, but position never needed in SHA512
function int64shr(dst, x, shift)
{
dst.l = (x.l >>> shift) | (x.h << (32-shift));
dst.h = (x.h >>> shift);
}
//Adds two 64-bit numbers
//Like the original implementation, does not rely on 32-bit operations
function int64add(dst, x, y)
{
var w0 = (x.l & 0xffff) + (y.l & 0xffff);
var w1 = (x.l >>> 16) + (y.l >>> 16) + (w0 >>> 16);
var w2 = (x.h & 0xffff) + (y.h & 0xffff) + (w1 >>> 16);
var w3 = (x.h >>> 16) + (y.h >>> 16) + (w2 >>> 16);
dst.l = (w0 & 0xffff) | (w1 << 16);
dst.h = (w2 & 0xffff) | (w3 << 16);
}
//Same, except with 4 addends. Works faster than adding them one by one.
function int64add4(dst, a, b, c, d)
{
var w0 = (a.l & 0xffff) + (b.l & 0xffff) + (c.l & 0xffff) + (d.l & 0xffff);
var w1 = (a.l >>> 16) + (b.l >>> 16) + (c.l >>> 16) + (d.l >>> 16) + (w0 >>> 16);
var w2 = (a.h & 0xffff) + (b.h & 0xffff) + (c.h & 0xffff) + (d.h & 0xffff) + (w1 >>> 16);
var w3 = (a.h >>> 16) + (b.h >>> 16) + (c.h >>> 16) + (d.h >>> 16) + (w2 >>> 16);
dst.l = (w0 & 0xffff) | (w1 << 16);
dst.h = (w2 & 0xffff) | (w3 << 16);
}
//Same, except with 5 addends
function int64add5(dst, a, b, c, d, e)
{
var w0 = (a.l & 0xffff) + (b.l & 0xffff) + (c.l & 0xffff) + (d.l & 0xffff) + (e.l & 0xffff);
var w1 = (a.l >>> 16) + (b.l >>> 16) + (c.l >>> 16) + (d.l >>> 16) + (e.l >>> 16) + (w0 >>> 16);
var w2 = (a.h & 0xffff) + (b.h & 0xffff) + (c.h & 0xffff) + (d.h & 0xffff) + (e.h & 0xffff) + (w1 >>> 16);
var w3 = (a.h >>> 16) + (b.h >>> 16) + (c.h >>> 16) + (d.h >>> 16) + (e.h >>> 16) + (w2 >>> 16);
dst.l = (w0 & 0xffff) | (w1 << 16);
dst.h = (w2 & 0xffff) | (w3 << 16);
}
/******************************************************************************/
/* END COPY & PASTE
/******************************************************************************/
/* SHA-512 implementation from sha512.js distributed under the BSD License
/* See <http://pajhome.org.uk/crypt/md5/sha512.html> for details.
/******************************************************************************/
/* ]]> */
</script>
<script type="text/javascript">
/* <![CDATA[ */
/**
* Stores the genpw configuration
*
*
* de: Speichert die genpw-Konfiguration
*
* @access public
* @author Andreas Haerter <[email protected]>
*/
var cfg = {
/**
* Salt to personalize the generator. You have to set this to make
* genpw work.
*
* Only printable 7bit ASCII chars are allowed (=charcode 32 till
* 126). This limit exists to exclude every thinkable compatibility
* and/or codepage problem (think about non-UTF8 editors...).
*
* ATTENTION: If you change this, ALL generated password are new
* ones! Means you will get NEW results for the same
* input!
*
*
* de: "Salz" um den Generator zu personalisieren, muss gesetzt
* werden. damit der Generator funktioniert.
*
* Nur druckbare 7bit ASCII-Zeichen erlaubt (=Zeichennummer 32 bis
* 126). Diese Einschränkung existiert, um jedes denkbare
* Kompatibilitäts- und/oder Codepage-Problem zu vermeiden (man
* denke nur an nicht-UTF8-Editoren...).
*
* ACHTUNG: Falls Sie diesen Wert ändern, ändern sich auch ALLE
* generierten Passwörter, d.h. Sie erhalten bei gleichen
* Ausgangsdaten ANDERE Ergebnisse.
*
* @access public
* @author Andreas Haerter <[email protected]>
* @link http://www.joelonsoftware.com/articles/Unicode.html
*/
salt: "",
/**
* SHA512 hash of "your masterpassword"+"cfg.salt"
*
* You can store the hash within this value. If so, you will get
* warned if there is a typo within your masterpassword as you
* type. If you don't want to use this feature, you may set this
* value to FALSE.
* In PHP5 you can get the needed value with the following code:
* echo base64_encode(hash("sha512", <haystack>, true)); //STRIP ENDING "=" from the resulting string!
* Or use JavaScript, e.g. copy and paste the following code
* temporarily into this file to show it:
* alert(b64_sha512("your pwd here"+cfg.salt));
*
*
* de: SHA512 hash von "Ihr Masterpasswort"+"cfg.salt"
*
* Sie können hier den Hash hinterlegen. So werden Sie direkt bei
* der Eingabe gewarnt, sofern Sie sich bei der Eingabe Ihres
* Masterpassworts vertippen. Sollte dies nicht gewünscht sein kann
* der Wert einfach auf FALSE gesetzt werden.
*
* In PHP5 können Sie den Wert über den folgenden Code berechnen:
* echo base64_encode(hash("sha512", <haystack>, true)); //Das "=" am Ende der sich ergebenden Zeichenkette muss ENTFERT werden!
* Oder nutzen Sie JavaScript. Sie können Sie sich den Wert z.B.
* anzeigen lassen, indem Sie den folgenden Code temporär in diese
* Datei einfügen:
* alert(b64_sha512("hier ihr pwd einfügen"+cfg.salt));
*
* @var false|string
* @access public
* @author Andreas Haerter <[email protected]>
*/
master_sha512: false,
/**
* Seconds until the output field for generated pwds will be cleared
*
* This option gives you got the possibility to define a period in
* seconds until the input field where the generated password are
* written into will be cleared. However, the password can be
* generated again trough a new click on "Generate".
* This feature should prevent presenting a generated password in
* clear text to someone who is standing next to you.
* To disable it, simply set this value to FALSE.
*
*
* de: Sekunden, bis das Ausgabefeld für generierte Passwörter
* geleert wird
*
* Über diese Option können Sie eine Zeitspanne in Sekunden
* festlegen, nach der genierte Passwörter aus dem entsprechenden
* Eingabefeld gelöscht werden. Das Passwort kann natürlich sofort
* durch einen Klick auf "Generieren" wieder erzeugt werden.
* Dieses Feature hat das Ziel, zu verhindern, dass man fertig
* generierte Passwörter jemanden präsentiert, der z.B. neben
* einem steht.
* Falls diese Funktion nicht genutzt werden soll, setzen Sie den
* Wert einfach auf FALSE.
*
* @var false|integer
* @access public
* @author Andreas Haerter <[email protected]>
*/
clearOutputTime: false,
/**
* Language to use
*
*
* de: Zu nutzende Sprache
*
* Available/Verfügbar:
* - "auto" (the script tries to detect the language automatically,
* based on the current browser language)
* - "de" (Deutsch/German)
* - "en" (Englisch/English - will also be used as fallback if the
* given value is invalid or auto-detection does not work)
*
* @var string
* @access public
* @author Andreas Haerter <[email protected]>
*/
language: "auto",
/**
* Default output length
*
* To get strong passwords, you should use at least 12 chars. 16
* chars is a good value to prevent problems with too long passwords
* (many services are limiting the password length to 16 chars).
*
*
* de: Standard-Ausgabelänge
*
* Um starke Passwörter zu erhalten, sollten mindestens 12 Zeichen
* genutzt werden. Um in der Praxis keine Probleme mit zu langen
* Passwörtern zu bekommen (viele Dienste begrenzen die Länge) haben
* sich 16 Zeichen bewährt.
*
* @var integer
* @access public
* @author Andreas Haerter <[email protected]>
* @see cfg::defaultOutputLength
*/
defaultOutputLength: 16,
/**
* INTERNAL flag to check if cfg::check() was passed successfully
*
*
* de: INTERNER Schalter um zu speichern, ob der Environment-Test
* cfg::check() erfolgreich war
*
* @var boolean
* @access private
* @author Andreas Haerter <[email protected]>
*/
_check_passed: false, //DO NOT TOUCH!
/**
* Checks if we can use the generator/SHA-512 in the expected way
*
* In addition to a basic config check, this method also checks if
* the file was stored with the correct codepage (UTF-8) and the
* calling client is able to handle this codepage.
*
*
* de: Prüft, ob wir den Generator und und die SHA-512 lib in der
* erwarteten Art und Weise nutzen können.
*
* Neben der Konfiguration als solcher wird auch geprüft, ob die
* Datei mit der richtigen Codepage (UTF-8) gespeichert ist und der
* aufrufende Client richtig damit umgehen kann.
*
* @param boolean Flag to control if a notification via alert()
* should be suppress when things go wrong (=TRUE) or an
* alert() is OK (=FALSE, default).
* @return boolean TRUE if all tests were passed and the environment
* is ready to go, FALSE in all other cases.
* @access public
* @author Andreas Haerter <[email protected]>
* @uses cfg::salt
* @uses cfg::_check_passed
* @uses special_chars
* @uses lang::cfg_check_envCheckFailed
* @uses lang::cfg_check_cfgSaltInvalidLength
* @uses lang::cfg_check_specCharPoolBroken
* @uses lang::cfg_check_cfgSaltBroken
* @uses lang::cfg_check_cfgMasterHashBroken
* @uses lang::cfg_check_statusReady
*/
check: function(suppress_alert) {
if (//basic onboard test delivered by the used SHA-512 library
!sha512_vm_test()
//hex
|| hex_sha512("").toLowerCase() != "cf83e1357eefb8bdf1542850d66d8007d620e4050b5715dc83f4a921d36ce9ce"
+ "47d0d13c5d85f2b0ff8318d2877eec2f63b931bd47417a81a538327af927da3e"
|| hex_sha512("Franz jagt im komplett verwahrlosten Taxi quer durch Bayern").toLowerCase() !== "af9ed2de700433b803240a552b41b5a472a6ef3fe1431a722b2063c75e9f0745"
+ "1f67a28e37d09cde769424c96aea6f8971389db9e1993d6c565c3c71b855723c"
|| hex_sha512("Frank jagt im komplett verwahrlosten Taxi quer durch Bayern").toLowerCase() !== "90b30ef9902ae4c4c691d2d78c2f8fa0aa785afbc5545286b310f68e91dd2299"
+ "c84a2484f0419fc5eaa7de598940799e1091c4948926ae1c9488dddae180bb80"
|| hex_sha512("abc123öäüß").toLowerCase() != "d55ee1e415ba7d60523e1a7cce1688d80c49c7404979c9f5ed5362e9c21f55e3" //test contains three German Umlauts suppress are UTF-8 multibyte chars - if this file is not encoded correctly, this would fail!
+ "8924e53400f2dbd74fe3a077e9f9da57d85ca4c44e4ef5b0fd36f69246f3b818"
//same with raw output, base64 encoded.
//testvectors created with PHP5: base64_encode(hash("sha512", <haystack>, true));
|| b64_sha512("") != "z4PhNX7vuL3xVChQ1m2AB9Yg5AULVxXcg/SpIdNs6c5"
+ "H0NE8XYXysP+DGNKHfuwvY7kxvUdBeoGlODJ6+SfaPg"
|| b64_sha512("Franz jagt im komplett verwahrlosten Taxi quer durch Bayern") !== "r57S3nAEM7gDJApVK0G1pHKm7z/hQxpyKyBjx16fB0U"
+ "fZ6KON9Cc3naUJMlq6m+JcTidueGZPWxWXDxxuFVyPA"
|| b64_sha512("Frank jagt im komplett verwahrlosten Taxi quer durch Bayern") !== "kLMO+ZAq5MTGkdLXjC+PoKp4WvvFVFKGsxD2jpHdIpn"
+ "ISiSE8EGfxeqn3lmJQHmeEJHElIkmrhyUiN3a4YC7gA"
|| b64_sha512("abc123öäüß") != "1V7h5BW6fWBSPhp8zhaI2AxJx0BJecn17VNi6cIfVeO" //test contains three German umlauts which are UTF-8 multibyte chars - if this file is not encoded correctly, this would fail!
+ "JJOU0APLb10/joHfp+dpX2FykxE5O9bD9NvaSRvO4GA") {
//something is wrong...
if (!suppress_alert) {
//inform user about it
alert(lang.cfg_check_envCheckFailed);
}
//break operation
return false;
} else {
//all right. if we are here, the SHA-512 lib works and we
//got no problems handling UTF-8. Check the current config.
//special char pools
//detect the fitting special char pool, stored as project property
for (var pool in special_chars) {
//jump over SHA512 control checksums properties
if (pool.substring(0, 7) === "sha512_") {
continue;
}
//check
if (hex_sha512(special_chars[pool]).toString() !== special_chars["sha512_"+pool].toString()) {
//something is wrong...
if (!suppress_alert) {
//inform user about it
alert(lang.cfg_check_specCharPoolBroken);
}
//break operation
return false;
}
}
//salt
if (parseInt(cfg.salt.length, 10) < 10
|| parseInt(cfg.salt.length, 10) > 1000) {
if (!suppress_alert) {
//inform user about it
alert(lang.cfg_check_cfgSaltInvalidLength);
}
return false;
}
for (var i=0; i < parseInt(cfg.salt.length, 10); i++) {
if (cfg.salt.charCodeAt(i) < 32 // 32 is " "
|| cfg.salt.charCodeAt(i) > 126) { // 126 is "~"
//only printable 7bit ASCII is allowed - for compatibility reasons.
//better safe than sorry - all passwords would be lost if the salt
//is gone... which may happen when a wrong codepage and non-ASCII
//is used to store this file! With ASCII salt, the user can download
//genpw again + copy&paste his salt value to get a working genpw.
if (!suppress_alert) {
//inform user about it
alert(lang.cfg_check_cfgSaltBroken);
}
return false;
}
}
//master hash
if (cfg.master_sha512 !== false
&& cfg.master_sha512.length !== 86) {
if (!suppress_alert) {
//inform user about it
alert(lang.cfg_check_cfgMasterHashBroken);
}
return false;
}
//if we are here, everything seems to be fine
if (!suppress_alert) {
window.status = lang.cfg_check_statusReady;
}
//set control flag
cfg._check_passed = true;
return true;
}
}
};
/**
* Encapsulates all data and functionality regarding the generator form
*
*
* de: Kapselt alle Daten und Funktionalität bzgl. des
* Generatorformulars
*
* @access public
* @author Andreas Haerter <[email protected]>
*/
var generator_form = {
/**
* ID of the input field to type the master password into
*
*
* de: ID des input-Feldes in welches das Masterpasswort eingegeben
* wird
*
* @var string
* @access public
* @author Andreas Haerter <[email protected]>
*/
id_master: "master",
/**
* ID of the input field to type the pattern into
*
*
* de: ID des input-Feldes in welches das Pattern/Muster eingegeben
* wird
*
* @var string
* @access public
* @author Andreas Haerter <[email protected]>
*/
id_pattern: "pattern",
/**
* ID of the input field to type the password length into
*
*
* de: ID des input-Feldes in welches die Passwortlänge eingegeben
* wird
*
* @var string
* @access public
* @author Andreas Haerter <[email protected]>
*/
id_pwdlen: "outputlength",
/**
* ID of the select box to choose the password notation
*
*
* de: ID der select-Box über welche die Schreibweise ausgewählt
* werden kann
*
* @var string
* @access public
* @author Andreas Haerter <[email protected]>
*/
id_notation: "notation",
/**