-
Notifications
You must be signed in to change notification settings - Fork 2
/
quigeonpaste_clientsideencryption.user.js
1008 lines (834 loc) · 23.4 KB
/
quigeonpaste_clientsideencryption.user.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
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
// ==UserScript==
// @name QuigeonPaste Encrypt Text
// @author Romain Coltel
// @namespace http://tc.giboulees.net/
// @description Allows QuigeonPaste users to encrypt the paste before sending it
// @include http*://coltel.iiens.net/paste/*
// @date 2016/05/07
// @version 0.1
// @grant GM_getValue
// @grant GM_setValue
// @grant GM_deleteValue
// ==/UserScript==
// ------------------------------------------------------------------------
// Inspired from http://www.langenhoven.com/code/emailencrypt/gmailencrypt.user.js
//
// Copyright (c) 2016, Romain Coltel
// Released under the GPL license
// http://www.gnu.org/copyleft/gpl.html
//
//
// This script encrypts your pastes using a system similar to AES. The key is
// put in the anchor part of the URL.
// Note that the AES mode is currently ECB, which is not very good.
//
// I don't claim to be a crypto guru. There are problems with this
// implementation, we all know this. Feel free to send me improvements, it will
// be gladly appreciated.
//
// ------------------------------------------------------------------------
DEBUG = false;
beforeText = '--- Encrypted start --- ';
afterText = ' --- Encrypted end ---';
theresencryptedtext = false;
function debug(str)
{
if(DEBUG)
{
var fn_name = arguments.callee.caller.name;
console.log(fn_name + ': ' + str);
}
}
function error(str)
{
var fn_name = arguments.callee.caller.name;
console.error(fn_name + ': ' + str);
}
// We have to grab the text in this event listener because it does not exist
// at the time the script is normally called
document.addEventListener('click', function(event)
{
// If the submit button has been clicked
// and the user asked to encrypt the paste
if (event.target.id === 'btn_submit' && document.getElementById('opt_gmchkbox').checked === true)
{
try
{
// Get the paste's content (in clear)
var content = document.getElementById('content').value;
if(content)
{
// Generate a new AES key
var key = makeKey();
// Store the AES key for after the form has been submitted
GM_setValue('aeskey', key);
// Encrypt the current text
var new_content = encryptText(key, content);
// Put the encrypted text in the paste content
document.getElementById('content').value = new_content;
}
}
catch (err)
{
error('Exception: "' + err.message + '" on line ' + err.lineNumber);
event.preventDefault();
alert('Cannot encrypt the paste. By security, the paste hasn\'t been sent.');
}
}
}, true);
//--- aes initialisations -----------------------
// S-Box substitution table
var S_enc = new Array(
0x63, 0x7c, 0x77, 0x7b, 0xf2, 0x6b, 0x6f, 0xc5,
0x30, 0x01, 0x67, 0x2b, 0xfe, 0xd7, 0xab, 0x76,
0xca, 0x82, 0xc9, 0x7d, 0xfa, 0x59, 0x47, 0xf0,
0xad, 0xd4, 0xa2, 0xaf, 0x9c, 0xa4, 0x72, 0xc0,
0xb7, 0xfd, 0x93, 0x26, 0x36, 0x3f, 0xf7, 0xcc,
0x34, 0xa5, 0xe5, 0xf1, 0x71, 0xd8, 0x31, 0x15,
0x04, 0xc7, 0x23, 0xc3, 0x18, 0x96, 0x05, 0x9a,
0x07, 0x12, 0x80, 0xe2, 0xeb, 0x27, 0xb2, 0x75,
0x09, 0x83, 0x2c, 0x1a, 0x1b, 0x6e, 0x5a, 0xa0,
0x52, 0x3b, 0xd6, 0xb3, 0x29, 0xe3, 0x2f, 0x84,
0x53, 0xd1, 0x00, 0xed, 0x20, 0xfc, 0xb1, 0x5b,
0x6a, 0xcb, 0xbe, 0x39, 0x4a, 0x4c, 0x58, 0xcf,
0xd0, 0xef, 0xaa, 0xfb, 0x43, 0x4d, 0x33, 0x85,
0x45, 0xf9, 0x02, 0x7f, 0x50, 0x3c, 0x9f, 0xa8,
0x51, 0xa3, 0x40, 0x8f, 0x92, 0x9d, 0x38, 0xf5,
0xbc, 0xb6, 0xda, 0x21, 0x10, 0xff, 0xf3, 0xd2,
0xcd, 0x0c, 0x13, 0xec, 0x5f, 0x97, 0x44, 0x17,
0xc4, 0xa7, 0x7e, 0x3d, 0x64, 0x5d, 0x19, 0x73,
0x60, 0x81, 0x4f, 0xdc, 0x22, 0x2a, 0x90, 0x88,
0x46, 0xee, 0xb8, 0x14, 0xde, 0x5e, 0x0b, 0xdb,
0xe0, 0x32, 0x3a, 0x0a, 0x49, 0x06, 0x24, 0x5c,
0xc2, 0xd3, 0xac, 0x62, 0x91, 0x95, 0xe4, 0x79,
0xe7, 0xc8, 0x37, 0x6d, 0x8d, 0xd5, 0x4e, 0xa9,
0x6c, 0x56, 0xf4, 0xea, 0x65, 0x7a, 0xae, 0x08,
0xba, 0x78, 0x25, 0x2e, 0x1c, 0xa6, 0xb4, 0xc6,
0xe8, 0xdd, 0x74, 0x1f, 0x4b, 0xbd, 0x8b, 0x8a,
0x70, 0x3e, 0xb5, 0x66, 0x48, 0x03, 0xf6, 0x0e,
0x61, 0x35, 0x57, 0xb9, 0x86, 0xc1, 0x1d, 0x9e,
0xe1, 0xf8, 0x98, 0x11, 0x69, 0xd9, 0x8e, 0x94,
0x9b, 0x1e, 0x87, 0xe9, 0xce, 0x55, 0x28, 0xdf,
0x8c, 0xa1, 0x89, 0x0d, 0xbf, 0xe6, 0x42, 0x68,
0x41, 0x99, 0x2d, 0x0f, 0xb0, 0x54, 0xbb, 0x16);
// inverse S-Box for decryptions
var S_dec = new Array(
0x52, 0x09, 0x6a, 0xd5, 0x30, 0x36, 0xa5, 0x38,
0xbf, 0x40, 0xa3, 0x9e, 0x81, 0xf3, 0xd7, 0xfb,
0x7c, 0xe3, 0x39, 0x82, 0x9b, 0x2f, 0xff, 0x87,
0x34, 0x8e, 0x43, 0x44, 0xc4, 0xde, 0xe9, 0xcb,
0x54, 0x7b, 0x94, 0x32, 0xa6, 0xc2, 0x23, 0x3d,
0xee, 0x4c, 0x95, 0x0b, 0x42, 0xfa, 0xc3, 0x4e,
0x08, 0x2e, 0xa1, 0x66, 0x28, 0xd9, 0x24, 0xb2,
0x76, 0x5b, 0xa2, 0x49, 0x6d, 0x8b, 0xd1, 0x25,
0x72, 0xf8, 0xf6, 0x64, 0x86, 0x68, 0x98, 0x16,
0xd4, 0xa4, 0x5c, 0xcc, 0x5d, 0x65, 0xb6, 0x92,
0x6c, 0x70, 0x48, 0x50, 0xfd, 0xed, 0xb9, 0xda,
0x5e, 0x15, 0x46, 0x57, 0xa7, 0x8d, 0x9d, 0x84,
0x90, 0xd8, 0xab, 0x00, 0x8c, 0xbc, 0xd3, 0x0a,
0xf7, 0xe4, 0x58, 0x05, 0xb8, 0xb3, 0x45, 0x06,
0xd0, 0x2c, 0x1e, 0x8f, 0xca, 0x3f, 0x0f, 0x02,
0xc1, 0xaf, 0xbd, 0x03, 0x01, 0x13, 0x8a, 0x6b,
0x3a, 0x91, 0x11, 0x41, 0x4f, 0x67, 0xdc, 0xea,
0x97, 0xf2, 0xcf, 0xce, 0xf0, 0xb4, 0xe6, 0x73,
0x96, 0xac, 0x74, 0x22, 0xe7, 0xad, 0x35, 0x85,
0xe2, 0xf9, 0x37, 0xe8, 0x1c, 0x75, 0xdf, 0x6e,
0x47, 0xf1, 0x1a, 0x71, 0x1d, 0x29, 0xc5, 0x89,
0x6f, 0xb7, 0x62, 0x0e, 0xaa, 0x18, 0xbe, 0x1b,
0xfc, 0x56, 0x3e, 0x4b, 0xc6, 0xd2, 0x79, 0x20,
0x9a, 0xdb, 0xc0, 0xfe, 0x78, 0xcd, 0x5a, 0xf4,
0x1f, 0xdd, 0xa8, 0x33, 0x88, 0x07, 0xc7, 0x31,
0xb1, 0x12, 0x10, 0x59, 0x27, 0x80, 0xec, 0x5f,
0x60, 0x51, 0x7f, 0xa9, 0x19, 0xb5, 0x4a, 0x0d,
0x2d, 0xe5, 0x7a, 0x9f, 0x93, 0xc9, 0x9c, 0xef,
0xa0, 0xe0, 0x3b, 0x4d, 0xae, 0x2a, 0xf5, 0xb0,
0xc8, 0xeb, 0xbb, 0x3c, 0x83, 0x53, 0x99, 0x61,
0x17, 0x2b, 0x04, 0x7e, 0xba, 0x77, 0xd6, 0x26,
0xe1, 0x69, 0x14, 0x63, 0x55, 0x21, 0x0c, 0x7d);
// convert two-dimensional indicies to one-dim array indices
var I00 = 0;
var I01 = 1;
var I02 = 2;
var I03 = 3;
var I10 = 4;
var I11 = 5;
var I12 = 6;
var I13 = 7;
var I20 = 8;
var I21 = 9;
var I22 = 10;
var I23 = 11;
var I30 = 12;
var I31 = 13;
var I32 = 14;
var I33 = 15;
//--- end of AES inits --------------------------
init();
// Create a random AES key, encoded in base 64
// The key will be 16 chars long by default (AES-128 is used here)
function makeKey()
{
var key = new Uint8Array(16);
for (var i = 0; i < 16; i++)
key[i] = Math.floor(Math.random() * 255);
return btoa(String.fromCharCode.apply(null, key));
}
// Extract key from base64 to binary
function b64tob(b64encoded)
{
return new Uint8Array(atob(b64encoded).split("").map(function(c) {
return c.charCodeAt(0);
}));
}
// This function is called by the button click and
// is encrypting a plaintext
function encryptText( AESkey, plainmsg )
{
// Encrypt the paste
var aes_text = aes_encrypt(AESkey, plainmsg);
etext = beforeText + aes_text + afterText;
// Return the encrypted text
return etext;
} // encryptText
// This is called automatically at init time and decrypt the text if found
// encrypted
function decryptText( AESkey, encryptmsg )
{
// Find the place where the actual text is stored
var beforepos = encryptmsg.indexOf(beforeText);
var afterpos = encryptmsg.indexOf(afterText);
if (beforepos === -1 || afterpos === -1)
return '';
aes_text = encryptmsg.slice(beforeText.length, afterpos);
// Now decrypt the paste body using AES
var finaltxt = aes_decrypt(AESkey, aes_text);
return finaltxt;
} // decryptText
// Place the new options on the screen
function enhanceForm()
{
debug('Called');
var optlistTag = document.getElementById("add_opt_list");
if (!optlistTag)
{
window.setTimeout(enhanceForm, 2000);
return;
}
// Make sure we have not already added the buttons to this page
if(document.getElementById("opt_gmcrypt"))
return;
// Create a DIV element to be added as an option to the paste
// The idea is to have this in the options fieldset:
// <div class="opt_desc">
// <label>
// <input type="checkbox" id="opt_gmchkbox" />
// Encrypt before submit
// </label>
// </div>
var divTag = document.createElement('div');
divTag.setAttribute('id', 'opt_gmcrypt');
divTag.setAttribute('class', 'opt_desc');
var labelTag = document.createElement('label');
var inputTag = document.createElement('input');
inputTag.setAttribute('id', 'opt_gmchkbox');
inputTag.setAttribute('type', 'checkbox');
var textTag = document.createTextNode('Encrypt before submit');
if (theresencryptedtext)
inputTag.setAttribute('checked', 'checked');
labelTag.appendChild(inputTag);
labelTag.appendChild(textTag);
divTag.appendChild(labelTag);
optlistTag.appendChild(divTag);
} // enhanceForm
// Add the AES key to the current URL so that copying it will enable someone
// else to decrypt the content
function addKeyToURL()
{
debug('Called');
var key = GM_getValue('aeskey');
if (typeof key != 'undefined')
{
var link = document.getElementById('newpastelink');
var curr_loc = window.location.toString();
var link_loc = link.getAttribute('href');
debug('Looking if "' + curr_loc + '" equals "' + link_loc + '"');
if (curr_loc === link_loc)
{
window.location.hash = key;
}
link_loc += '#' + key;
link.setAttribute('href', link_loc);
link.innerHTML = link_loc;
GM_deleteValue('aeskey');
}
}
// Decrypt the paste if found encrypted and an AES key is in the hash part of
// the current URL
function decryptPaste()
{
debug('Called');
var hash = window.location.hash;
if (hash === '')
{
debug('No hash part found in URL');
return;
}
// Remove the leading #
hash = hash.substring(1);
// FIXME doesn't work for geshi-colored pastes
var code_content = document.getElementById('code_content');
if (!code_content)
{
debug('No content to check for decrypting');
return;
}
// Find the first LI tag, then find the first (and only) DIV tag, to get the
// text from it
var enc = null;
for (var i = 0; i < code_content.childNodes.length; i++)
{
if (code_content.childNodes[i].nodeType === 1)
{
enc = code_content.childNodes[i];
break;
}
}
if (enc === null)
{
debug('No valid tag found');
return;
}
for (var i = 0; i < enc.childNodes.length; i++)
{
if (enc.childNodes[i].nodeType === 1)
{
enc = enc.childNodes[i];
break;
}
}
enc = enc.innerHTML;
debug('Trying to decrypt ' + enc + ' using ' + hash);
var dec = decryptText(hash, enc);
if (dec === '')
{
debug('The text to decrypt wasn\'t good enough');
return;
}
theresencryptedtext = true;
debug('Here\'s the decrypted text: ' + dec);
// Update the paste update area
document.getElementById('content').value = dec;
// Update the paste view area
// Remove all LI tag currently displayed in the paste output
while ( code_content.childNodes.length > 0 )
code_content.removeChild(code_content.childNodes[0]);
// TODO geshi coloration of dec
var text = dec.split('\n');
for ( var i = 0; i < text.length; i++ )
{
var added_text = text[i];
if (added_text == '')
added_text = '\u00A0';
var liTag = document.createElement('li');
liTag.setAttribute('class', 'li1');
var divTag = document.createElement('div');
var textTag = document.createTextNode(added_text);
divTag.appendChild(textTag);
liTag.appendChild(divTag);
code_content.appendChild(liTag);
}
}
function init()
{
debug('Called');
try
{
// Add a registered key to the URL, if present
addKeyToURL();
// Decrypt a previously encrypted paste
decryptPaste();
// Put buttons to permit paste encryption
enhanceForm();
}
catch (err)
{
error('Exception: "' + err.message + '" on line ' + err.lineNumber);
}
} // init
//Exit before you execute the other routines
return;
//--- AES routines --------------------------------------------------
// convert a 8-bit value to a string
function cvt_hex8( val )
{
var vh = (val >>> 4) & 0x0f;
return vh.toString(16) + (val & 0x0f).toString(16);
}
// convert a 32-bit value to a 8-char hex string
function cvt_hex32( val )
{
var str = "";
var i;
var v;
for( i = 7; i >= 0; i-- )
{
v = (val >>> (i * 4)) & 0x0f;
str += v.toString(16);
}
return str;
}
// convert a two-digit hex value to a number
function cvt_byte( str )
{
// get the first hex digit
var val1 = str.charCodeAt(0);
// do some error checking
if ( val1 >= 48 && val1 <= 57 )
// have a valid digit 0-9
val1 -= 48;
else if ( val1 >= 65 && val1 <= 70 )
// have a valid digit A-F
val1 -= 55;
else if ( val1 >= 97 && val1 <= 102 )
// have a valid digit a-f
val1 -= 87;
else
{
// not 0-9 or A-F, complain
error( str.charAt(1) + " is not a valid hex digit" );
return -1;
}
// get the second hex digit
var val2 = str.charCodeAt(1);
// do some error checking
if ( val2 >= 48 && val2 <= 57 )
// have a valid digit 0-9
val2 -= 48;
else if ( val2 >= 65 && val2 <= 70 )
// have a valid digit A-F
val2 -= 55;
else if ( val2 >= 97 && val2 <= 102 )
// have a valid digit A-F
val2 -= 87;
else
{
// not 0-9 or A-F, complain
error( str.charAt(2) + " is not a valid hex digit" );
return -1;
}
// all is ok, return the value
return val1 * 16 + val2;
}
// conversion function for non-constant subscripts
// assume subscript range 0..3
function I(x, y)
{
return (x * 4) + y;
}
// get the message to encrypt/decrypt or the key
// return as a 16-byte array
function ascTo16(str)
{
var dbyte = new Array(16);
var i;
for( i = 0; i < 16; i++ )
{
dbyte[i] = str.charCodeAt(i);
}
return dbyte;
}
function hexTo16(str)
{
var dbyte = new Array(16);
var i;
for( i=0; i<16; i++ )
{
// isolate and convert this substring
dbyte[i] = cvt_byte( str.substr(i * 2, 2) );
if( dbyte[i] < 0 )
{
// have an error
dbyte[0] = -1;
return dbyte;
}
} // for i
return dbyte;
}
//do the AES GF(2**8) multiplication
// do this by the shift-and-"add" approach
function aes_mul( a, b )
{
var res = 0;
while( a > 0 )
{
if ( a&1 )
res = res ^ b; // "add" to the result
a >>>= 1; // shift a to get next higher-order bit
b <<= 1; // shift multiplier also
}
// now reduce it modulo x**8 + x**4 + x**3 + x + 1
var hbit = 0x10000; // bit to test if we need to take action
var modulus = 0x11b00; // modulus - XOR by this to change value
while( hbit >= 0x100 )
{
if ( res & hbit ) // if the high-order bit is set
res ^= modulus; // XOR with the modulus
// prepare for the next loop
hbit >>= 1;
modulus >>= 1;
}
return res;
}
// apply the S-box substitution to the key expansion
function SubWord( word_ary )
{
var i;
for( i=0; i<16; i++ )
word_ary[i] = S_enc[ word_ary[i] ];
return word_ary;
}
// rotate the bytes in a word
function RotWord( word_ary )
{
return new Array( word_ary[1], word_ary[2], word_ary[3], word_ary[0] );
}
// calculate the first item Rcon[i] = { x^(i-1), 0, 0, 0 }
// note we only return the first item
function Rcon( exp )
{
var val = 2;
var result = 1;
// remember to calculate x^(exp-1)
exp--;
// process the exponent using normal shift and multiply
while ( exp > 0 )
{
if ( exp & 1 )
result = aes_mul( result, val );
// square the value
val = aes_mul( val, val );
// move to the next bit
exp >>= 1;
}
return result;
}
// round key generation
// return a byte array with the expanded key information
function key_expand( key )
{
var temp = new Array(4);
var i, j;
var w = new Array( 4 * 11 );
// copy initial key stuff
for ( i = 0; i < 16; i++ )
{
w[i] = key[i];
}
// generate rest of key schedule using 32-bit words
i = 4;
while ( i < 44 ) // blocksize * ( rounds + 1 )
{
// copy word W[i-1] to temp
for ( j = 0; j < 4; j++ )
temp[j] = w[(i-1) * 4 + j];
if (i % 4 == 0)
{
// temp = SubWord(RotWord(temp)) ^ Rcon[i/4];
temp = RotWord( temp );
temp = SubWord( temp );
temp[0] ^= Rcon( i >>> 2 );
}
// word = word ^ temp
for ( j = 0; j < 4; j++ )
w[i*4 + j] = w[(i-4) * 4 + j] ^ temp[j];
i++;
}
return w;
}
// do S-Box substitution
function SubBytes(state, Sbox)
{
var i;
for ( i = 0; i < 16; i++ )
state[i] = Sbox[ state[i] ];
return state;
}
// shift each row as appropriate
function ShiftRows(state)
{
var t0, t1, t2, t3;
// top row (row 0) isn't shifted
// next row (row 1) rotated left 1 place
t0 = state[I10];
t1 = state[I11];
t2 = state[I12];
t3 = state[I13];
state[I10] = t1;
state[I11] = t2;
state[I12] = t3;
state[I13] = t0;
// next row (row 2) rotated left 2 places
t0 = state[I20];
t1 = state[I21];
t2 = state[I22];
t3 = state[I23];
state[I20] = t2;
state[I21] = t3;
state[I22] = t0;
state[I23] = t1;
// bottom row (row 3) rotated left 3 places
t0 = state[I30];
t1 = state[I31];
t2 = state[I32];
t3 = state[I33];
state[I30] = t3;
state[I31] = t0;
state[I32] = t1;
state[I33] = t2;
return state;
}
// inverset shift each row as appropriate
function InvShiftRows(state)
{
var t0, t1, t2, t3;
// top row (row 0) isn't shifted
// next row (row 1) rotated left 1 place
t0 = state[I10];
t1 = state[I11];
t2 = state[I12];
t3 = state[I13];
state[I10] = t3;
state[I11] = t0;
state[I12] = t1;
state[I13] = t2;
// next row (row 2) rotated left 2 places
t0 = state[I20];
t1 = state[I21];
t2 = state[I22];
t3 = state[I23];
state[I20] = t2;
state[I21] = t3;
state[I22] = t0;
state[I23] = t1;
// bottom row (row 3) rotated left 3 places
t0 = state[I30];
t1 = state[I31];
t2 = state[I32];
t3 = state[I33];
state[I30] = t1;
state[I31] = t2;
state[I32] = t3;
state[I33] = t0;
return state;
}
// process column info
function MixColumns(state)
{
var col;
var c0, c1, c2, c3;
for( col=0; col<4; col++ )
{
c0 = state[I(0,col)];
c1 = state[I(1,col)];
c2 = state[I(2,col)];
c3 = state[I(3,col)];
// do mixing, and put back into array
state[I(0,col)] = aes_mul(2,c0) ^ aes_mul(3,c1) ^ c2 ^ c3;
state[I(1,col)] = c0 ^ aes_mul(2,c1) ^ aes_mul(3,c2) ^ c3;
state[I(2,col)] = c0 ^ c1 ^ aes_mul(2,c2) ^ aes_mul(3,c3);
state[I(3,col)] = aes_mul(3,c0) ^ c1 ^ c2 ^ aes_mul(2,c3);
}
return state;
}
// inverse process column info
function InvMixColumns(state)
{
var col;
var c0, c1, c2, c3;
for( col=0; col<4; col++ )
{
c0 = state[I(0,col)];
c1 = state[I(1,col)];
c2 = state[I(2,col)];
c3 = state[I(3,col)];
// do inverse mixing, and put back into array
state[I(0,col)] = aes_mul(0x0e,c0) ^ aes_mul(0x0b,c1)
^ aes_mul(0x0d,c2) ^ aes_mul(0x09,c3);
state[I(1,col)] = aes_mul(0x09,c0) ^ aes_mul(0x0e,c1)
^ aes_mul(0x0b,c2) ^ aes_mul(0x0d,c3);
state[I(2,col)] = aes_mul(0x0d,c0) ^ aes_mul(0x09,c1)
^ aes_mul(0x0e,c2) ^ aes_mul(0x0b,c3);
state[I(3,col)] = aes_mul(0x0b,c0) ^ aes_mul(0x0d,c1)
^ aes_mul(0x09,c2) ^ aes_mul(0x0e,c3);
}
return state;
}
// insert subkey information
function AddRoundKey( state, w, base )
{
var col;
for( col=0; col<4; col++ )
{
state[I(0,col)] ^= w[base+col*4];
state[I(1,col)] ^= w[base+col*4+1];
state[I(2,col)] ^= w[base+col*4+2];
state[I(3,col)] ^= w[base+col*4+3];
}
return state;
}
// return a transposed array
function transpose( msg )
{
var row, col;
var state = new Array( 16 );
for( row=0; row<4; row++ )
for( col=0; col<4; col++ )
state[I(row,col)] = msg[I(col,row)];
return state;
}
// final AES state
var AES_output = new Array(16);
// format AES output
function format_AES_output(what, how)
{
var i;
var bits;
var str="";
// what type of data do we have to work with?
if ( how == "asc")
{
// convert each set of bits back to ASCII
for( i=0; i<16; i++ )
str += String.fromCharCode( what[i] );
}
else
{
// output hexdecimal data
str = cvt_hex8( AES_output[0] );
for( i=1; i<16; i++ )
{
str += cvt_hex8( what[i] );
}
}
return str;
}
// Encrypt one bloc (16 chars) of message using AES
function aes_encrypt_one_bloc(ctx, msg)
{
var state = new Array( 16 ); // working state
msg = ascTo16(msg);
// problems??
if ( msg[0] < 0 )
{
alert("There is a problem with the message");
return;
}
// initial state = message in columns (transposed from what we input)
state = transpose( msg );
state = AddRoundKey(state, ctx, 0);
for (var round = 1; round < 10; round++ )
{
state = SubBytes(state, S_enc);
state = ShiftRows(state);
state = MixColumns(state);
// note here the spec uses 32-bit words, we are using bytes, so an extra *4
state = AddRoundKey(state, ctx, round * 4 * 4);
}
SubBytes(state, S_enc);
ShiftRows(state);
AddRoundKey(state, ctx, 10 * 4 * 4);
// process output
AES_output = transpose( state );
return format_AES_output(AES_output, "hex");
} // aes_encrypt_one_bloc
// Decrypt one bloc (16 chars) of message using AES
function aes_decrypt_one_bloc(ctx, msg)
{
var state = new Array( 16 ); // working state
msg = hexTo16(msg);
// problems??
if ( msg[0] < 0 )
{
alert("There is a problem with the message")
return;
}
// initial state = message
state = transpose( msg );
state = AddRoundKey(state, ctx, 10 * 4 * 4);
for (var round = 9; round >= 1; round--)
{
state = InvShiftRows(state);
state = SubBytes(state, S_dec);
// note here the spec uses 32-bit words, we are using bytes, so an extra *4
state = AddRoundKey(state, ctx, round * 4 * 4);
state = InvMixColumns(state);
}
InvShiftRows(state);
SubBytes(state, S_dec);
AddRoundKey(state, ctx, 0);
// process output
AES_output = transpose( state );
return format_AES_output(AES_output, "asc");
} // aes_decrypt_one_bloc
// do AES encrytion -- FIXME mode ecb :'(
function aes_encrypt(key, plainmsg)
{
var ctx = new Array( 44 ); // subkey information
var final = [];
var msg = "";
var padding_size = 0;
//check the key
if ( key[0] < 0 )
{
alert("There is a problem with the key");
return;
}
// expand the key
key = b64tob(key);
ctx = key_expand( key );
while (plainmsg.length >= 16)
{
msg = plainmsg.slice(0, 16);
plainmsg = plainmsg.slice(16);
final.push(aes_encrypt_one_bloc(ctx, msg));
}
// Use padding, like defined in PKCS#7
padding_size = 16 - plainmsg.length;
plainmsg += Array.apply(null, Array(padding_size)).map(
String.prototype.valueOf,
padding_size.toString(17)
).join('');
final.push(aes_encrypt_one_bloc(ctx, plainmsg));
return final.join('$');
} // aes_encrypt
// do AES decryption
function aes_decrypt(key, cryptmsg)
{
var ctx = new Array( 44 ); // subkey information
var final = [];
// check the key
if ( key[0] < 0 )
{
alert("There is a problem with the key");
return;
}
// expand the key
key = b64tob(key);
ctx = key_expand( key );
var multmsg = cryptmsg.split('$');
for (var i = 0; i < multmsg.length; i++)
{
var tmpstr = aes_decrypt_one_bloc(ctx, multmsg[i]);
final.push(tmpstr);
}
// Remove padding added in aes_encrypt
var tmp = final[final.length - 1];
final[final.length - 1] = tmp.substring(
0,
tmp.length - parseInt(tmp[tmp.length - 1], 17)
);
return final.join('');