-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathaes.js
More file actions
1082 lines (561 loc) · 38.4 KB
/
aes.js
File metadata and controls
1082 lines (561 loc) · 38.4 KB
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
var ctxt = Aes.Ctr.encrypt(str,password,256);
var txt = Aes.Ctr.decrypt(str,password,256);
/*
aesmod:d
06-08-22
*/
function aesmod(){
//aes:
/*
AES implementation in JavaScript (c) Chris Veness 2005-2012
- see http://csrc.nist.gov/publications/PubsFIPS.html#197
*/
// Aes namespace
var Aes = {};
/*
AES Cipher function: encrypt 'input' state with Rijndael algorithm
applies Nr rounds (10/12/14) using key schedule w for 'add round key' stage
@param {Number[]} input 16-byte (128-bit) input state array
@param {Number[][]} w Key schedule as 2D byte-array (Nr+1 x Nb bytes)
@returns {Number[]} Encrypted output state array
*/
Aes.cipher = function(input, w) {
// main Cipher function [§5.1]
// block size (in words): no of columns in state (fixed at 4 for AES)
var Nb = 4;
// no of rounds: 10/12/14 for 128/192/256-bit keys
var Nr = w.length/Nb - 1;
// initialise 4xNb byte-array 'state' with input [§3.4]
var state = [[],[],[],[]];
for (var i=0; i<4*Nb; i++){
var i1 = i%4;
var i2 = Math.floor(i/4);
state[i1][i2] = input[i];
}//for
state = Aes.addRoundKey(state, w, 0, Nb);
for (var round=1; round<Nr; round++) {
state = Aes.subBytes(state, Nb);
state = Aes.shiftRows(state, Nb);
state = Aes.mixColumns(state, Nb);
state = Aes.addRoundKey(state, w, round, Nb);
}//for
state = Aes.subBytes(state, Nb);
state = Aes.shiftRows(state, Nb);
state = Aes.addRoundKey(state, w, Nr, Nb);
// convert state to 1-d array before returning [§3.4]
var output = new Array(4*Nb);
for (var i=0; i<4*Nb; i++){
var i1 = i%4;
var i2 = Math.floor(i/4);
output[i] = state[i1][i2];
}//for
return output;
}//cipher
/*
Perform Key Expansion to generate a Key Schedule
@param {Number[]} key Key as 16/24/32-byte array
@returns {Number[][]} Expanded key schedule as 2D byte-array (Nr+1 x Nb bytes)
*/
Aes.keyExpansion=function(key) {
// generate Key Schedule (byte-array Nr+1 x Nb) from Key [§5.2]
// block size (in words): no of columns in state (fixed at 4 for AES)
var Nb = 4;
// key length (in words): 4/6/8 for 128/192/256-bit keys
var Nk = key.length/4;
// no of rounds: 10/12/14 for 128/192/256-bit keys
var Nr = Nk + 6;
var n = Nb*(Nr+1);
var w = new Array(n);
var temp = new Array(4);
for(var i=0;i<Nk;i++){
var r = [ key[4*i], key[4*i+1], key[4*i+2], key[4*i+3] ];
w[i] = r;
}//for
for(var i=Nk;i<n;i++){
w[i] = new Array(4);
for(var t=0;t<4;t++){
temp[t] = w[i-1][t];
}//for
if(i%Nk==0){
temp = Aes.subWord(Aes.rotWord(temp));
for(var t=0;t<4;t++){
temp[t] ^= Aes.rCon[i/Nk][t];
}//for
} else if(Nk>6 && i%Nk==4){
temp = Aes.subWord(temp);
}
for(var t=0;t<4;t++){
w[i][t] = w[i-Nk][t]^temp[t];
}//for
}//for
return w;
}//keyexpansion
/*
---- remaining routines are private, not called externally ----
*/
Aes.subBytes=function(s,Nb){
// apply SBox to state S [§5.1.1]
for(var r=0;r<4;r++){
for(var c=0;c<Nb;c++){
s[r][c] = Aes.sBox[s[r][c]];
}//fpr
}//for
return s;
}//subbytes
Aes.shiftRows=function(s,Nb){
// shift row r of state S left by r bytes [§5.1.2]
var t = new Array(4);
// note that this will work for Nb=4,5,6, but not 7,8 (always 4 for AES):
// see asmaes.sourceforge.net/rijndael/rijndaelImplementation.pdf
for(var r=1;r<4;r++){
for(var c=0;c<4;c++){
// shift into temp copy
t[c] = s[r][(c+r)%Nb];
}//for
for(var c=0;c<4;c++){
// and copy back
s[r][c] = t[c];
}//for
}//for
return s;
}//shiftrows
Aes.mixColumns=function(s,Nb){
// combine bytes of each col of state S [§5.1.3]
for(var c=0;c<4;c++){
// 'a' is a copy of the current column from 's'
var a = new Array(4);
// 'b' is a.{02} in GF(2^8)
var b = new Array(4);
for (var i=0; i<4; i++) {
a[i] = s[i][c];
b[i] = s[i][c]&0x80 ? s[i][c]<<1 ^ 0x011b : s[i][c]<<1;
}//for
// a[n] ^ b[n] is a{03} in GF(2^8)
// 2*a0 + 3*a1 + a2 + a3
s[0][c] = b[0] ^ a[1] ^ b[1] ^ a[2] ^ a[3];
// a0 * 2*a1 + 3*a2 + a3
s[1][c] = a[0] ^ b[1] ^ a[2] ^ b[2] ^ a[3];
// a0 + a1 + 2*a2 + 3*a3
s[2][c] = a[0] ^ a[1] ^ b[2] ^ a[3] ^ b[3];
// 3*a0 + a1 + a2 + 2*a3
s[3][c] = a[0] ^ b[0] ^ a[1] ^ a[2] ^ b[3];
}//for
return s;
}//mixcolumns
Aes.addRoundKey=function(state,w,rnd,Nb){
// xor Round Key into state S [§5.1.4]
for(var r=0;r<4;r++){
for(var c=0;c<Nb;c++){
state[r][c] ^= w[rnd*4+c][r];
}//for
}//for
return state;
}//addroundkey
Aes.subWord=function(w){
// apply SBox to 4-byte word w
for(var i=0;i<4;i++){
w[i] = Aes.sBox[w[i]];
}//for
return w;
}//subword
Aes.rotWord=function(w){
// rotate 4-byte word w left by one byte
var tmp = w[0];
for(var i=0;i<3;i++){
w[i] = w[i+1];
}//for
w[3] = tmp;
return w;
}//rotword
// sBox is pre-computed multiplicative inverse in GF(2^8)
// used in subBytes and keyExpansion [§5.1.1]
Aes.sBox = [
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
];
// rCon is Round Constant used for the Key Expansion
// [1st col is 2^(r-1) in GF(2^8)] [§5.2]
Aes.rCon = [
[0x00, 0x00, 0x00, 0x00],
[0x01, 0x00, 0x00, 0x00],
[0x02, 0x00, 0x00, 0x00],
[0x04, 0x00, 0x00, 0x00],
[0x08, 0x00, 0x00, 0x00],
[0x10, 0x00, 0x00, 0x00],
[0x20, 0x00, 0x00, 0x00],
[0x40, 0x00, 0x00, 0x00],
[0x80, 0x00, 0x00, 0x00],
[0x1b, 0x00, 0x00, 0x00],
[0x36, 0x00, 0x00, 0x00]
];
//ctr:
/*
AES Counter-mode implementation in JavaScript (c) Chris Veness 2005-2012
- see http://csrc.nist.gov/publications/nistpubs/800-38a/sp800-38a.pdf
*/
// Aes.Ctr namespace: a subclass or extension of Aes
Aes.Ctr = {};
/*
Encrypt a text using AES encryption in Counter mode of operation
Unicode multi-byte character safe
@param {String} plaintext Source text to be encrypted
@param {String} password The password to use to generate a key
@param {Number} nBits Number of bits to be used in the key (128, 192, or 256)
@returns {string} Encrypted text
*/
Aes.Ctr.encrypt=function(plaintext,password,nBits){
// standard allows 128/192/256 bit keys
if (!(nBits==128 || nBits==192 || nBits==256)){
return '';
}
// block size fixed at 16 bytes / 128 bits (Nb=4) for AES
var blockSize = 16;
plaintext = Utf8.encode(plaintext);
password = Utf8.encode(password);
// timer
//var t = new Date();
// use AES itself to encrypt password to get cipher key
// (using plain password as source for key
// expansion) - gives us well encrypted key
// (though hashed key might be preferred for prod'n use)
// no bytes in key (16/24/32)
var nBytes = nBits/8;
var pwBytes = new Array(nBytes);
// use 1st 16/24/32 chars of password for key
for (var i=0; i<nBytes; i++) {
pwBytes[i] = isNaN(password.charCodeAt(i)) ? 0 : password.charCodeAt(i);
}//for
// gives us 16-byte key
var key = Aes.cipher(pwBytes,Aes.keyExpansion(pwBytes));
// expand key to 16/24/32 bytes long
key = key.concat(key.slice(0, nBytes-16));
// initialise 1st 8 bytes of counter block with nonce
// (NIST SP800-38A §B.2): [0-1] = millisec,
// [2-3] = random, [4-7] = seconds, together giving
// full sub-millisec uniqueness up to Feb 2106
var counterBlock = new Array(blockSize);
// timestamp: milliseconds since 1-Jan-1970
var nonce = (new Date()).getTime();
var nonceMs = nonce%1000;
var nonceSec = Math.floor(nonce/1000);
var nonceRnd = Math.floor(Math.random()*0xffff);
for(var i=0;i<2;i++){
counterBlock[i] = (nonceMs >>> i*8) & 0xff;
}//for
for(var i=0;i<2;i++){
counterBlock[i+2] = (nonceRnd >>> i*8) & 0xff;
}//for
for(var i=0;i<4;i++){
counterBlock[i+4] = (nonceSec >>> i*8) & 0xff;
}//for
// and convert it to a string to go on the front of the ciphertext
var ctrTxt = '';
for(var i=0;i<8;i++){
ctrTxt += String.fromCharCode(counterBlock[i]);
}//for
// generate key schedule - an expansion of the key
// into distinct Key Rounds for each round
var keySchedule = Aes.keyExpansion(key);
var blockCount = Math.ceil(plaintext.length/blockSize);
// ciphertext as array of strings
var ciphertxt = new Array(blockCount);
for(var b=0;b<blockCount;b++){
// set counter (block #) in last 8 bytes of counter block
// (leaving nonce in 1st 8 bytes)
// done in two stages for 32-bit ops: using two words allows
// us to go past 2^32 blocks (68GB)
for(var c=0;c<4;c++){
counterBlock[15-c] = (b >>> c*8) & 0xff;
}//for
for(var c=0;c<4;c++){
counterBlock[15-c-4] = (b/0x100000000 >>> c*8)
}//for
// -- encrypt counter block --
var cipherCntr = Aes.cipher(counterBlock,keySchedule);
// block size is reduced on final block
var blockLength = b<blockCount-1 ? blockSize : (plaintext.length-1)%blockSize+1;
var cipherChar = new Array(blockLength);
for(var i=0;i<blockLength;i++){
// -- xor plaintext with ciphered counter char-by-char --
cipherChar[i] = cipherCntr[i] ^ plaintext.charCodeAt(b*blockSize+i);
cipherChar[i] = String.fromCharCode(cipherChar[i]);
}//for
ciphertxt[b] = cipherChar.join('');
}//for
var ciphertext = ctrTxt+ciphertxt.join('');
// encode in base64
ciphertext = Base64.encode(ciphertext);
//alert((new Date()) - t);
return ciphertext;
}//encrypt
/*
Decrypt a text encrypted by AES in counter mode of operation
@param {String} ciphertext Source text to be encrypted
@param {String} password The password to use to generate a key
@param {Number} nBits Number of bits to be used in the key (128, 192, or 256)
@returns {String} Decrypted text
*/
Aes.Ctr.decrypt=function(ciphertext,password,nBits){
// standard allows 128/192/256 bit keys
if(
!(nBits==128 || nBits==192 || nBits==256)
){
return '';
}
// block size fixed at 16 bytes / 128 bits (Nb=4) for AES
var blockSize = 16;
ciphertext = Base64.decode(ciphertext);
password = Utf8.encode(password);
// timer
//var t = new Date();
// use AES to encrypt password (mirroring encrypt routine)
// no bytes in key
var nBytes = nBits/8;
var pwBytes = new Array(nBytes);
for(var i=0;i<nBytes;i++){
pwBytes[i] = isNaN(password.charCodeAt(i)) ? 0 : password.charCodeAt(i);
}//for
var key = Aes.cipher(pwBytes,Aes.keyExpansion(pwBytes));
// expand key to 16/24/32 bytes long
key = key.concat(key.slice(0,nBytes-16));
// recover nonce from 1st 8 bytes of ciphertext
var counterBlock = new Array(8);
ctrTxt = ciphertext.slice(0,8);
for (var i=0; i<8; i++){
counterBlock[i] = ctrTxt.charCodeAt(i);
}//for
// generate key schedule
var keySchedule = Aes.keyExpansion(key);
// separate ciphertext into blocks (skipping past initial 8 bytes)
var nBlocks = Math.ceil((ciphertext.length-8)/blockSize);
var ct = new Array(nBlocks);
for(var b=0;b<nBlocks;b++){
var i1 = 8+b*blockSize;
var i2 = 8+b*blockSize+blockSize;
ct[b] = ciphertext.slice(i1,i2);
}//for
// ciphertext is now array of block-length strings
ciphertext = ct;
// plaintext will get generated block-by-block into
// array of block-length strings
var plaintxt = new Array(ciphertext.length);
for(var b=0;b<nBlocks;b++){
// set counter (block #) in last 8 bytes of counter block
// (leaving nonce in 1st 8 bytes)
for(var c=0;c<4;c++){
counterBlock[15-c] = ((b) >>> c*8) & 0xff;
}//for
for(var c=0;c<4;c++){
counterBlock[15-c-4] = (((b+1)/0x100000000-1) >>> c*8) & 0xff;
}//for
// encrypt counter block
var cipherCntr = Aes.cipher(counterBlock, keySchedule);
var plaintxtByte = new Array(ciphertext[b].length);
for(var i=0;i<ciphertext[b].length;i++){
// -- xor plaintxt with ciphered counter byte-by-byte --
plaintxtByte[i] = cipherCntr[i] ^ ciphertext[b].charCodeAt(i);
plaintxtByte[i] = String.fromCharCode(plaintxtByte[i]);
}//for
plaintxt[b] = plaintxtByte.join('');
}//for
// join array of blocks into single plaintext string
var plaintext = plaintxt.join('');
// decode from UTF8 back to Unicode multi-byte chars
plaintext = Utf8.decode(plaintext);
//alert((new Date()) - t);
return plaintext;
}//decrypt
//base64:
/*
Base64 class: Base 64 encoding / decoding (c) Chris Veness 2002-2012
note: depends on Utf8 class
*/
// Base64 namespace
var Base64 = {};
Base64.code = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
/*
Encode string into Base64, as defined by RFC 4648 [http://tools.ietf.org/html/rfc4648]
(instance method extending String object). As per RFC 4648, no newlines are added.
@param {String} str The string to be encoded as base-64
@param {Boolean} [utf8encode=false] Flag to indicate whether str is Unicode string to be encoded
to UTF8 before conversion to base64; otherwise string is assumed to be 8-bit characters
@returns {String} Base64-encoded string
*/
Base64.encode = function(str, utf8encode) {
// http://tools.ietf.org/html/rfc4648
utf8encode = (typeof utf8encode=='undefined') ? false : utf8encode;
var o1;
var o2;
var o3;
var bits;
var h1;
var h2;
var h3;
var h4;
var e = [];
var pad = '';
var c;
var plain;
var coded;
var b64 = Base64.code;
plain = utf8encode ? str.encodeUTF8() : str;
// pad string to length of multiple of 3
c = plain.length % 3;
if(c>0){
while(c++<3){
pad += '=';
plain += '\0';
}//while
}//if
// note: doing padding here saves us doing special-case
//packing for trailing 1 or 2 chars
for(c=0;c<plain.length;c+=3){
// pack three octets into four hexets
o1 = plain.charCodeAt(c);
o2 = plain.charCodeAt(c+1);
o3 = plain.charCodeAt(c+2);
bits = o1<<16 | o2<<8 | o3;
h1 = bits>>18 & 0x3f;
h2 = bits>>12 & 0x3f;
h3 = bits>>6 & 0x3f;
h4 = bits & 0x3f;
// use hextets to index into code string
e[c/3] = b64.charAt(h1) + b64.charAt(h2) + b64.charAt(h3) + b64.charAt(h4);
}//for
// join() is far faster than repeated string concatenation in IE
coded = e.join('');
// replace 'A's from padded nulls with '='s
coded = coded.slice(0, coded.length-pad.length) + pad;
return coded;
}//encode
/*
Decode string from Base64, as defined by RFC 4648 [http://tools.ietf.org/html/rfc4648]
(instance method extending String object). As per RFC 4648, newlines are not catered for.
@param {String} str The string to be decoded from base-64
@param {Boolean} [utf8decode=false] Flag to indicate whether str is Unicode string to be decoded
from UTF8 after conversion from base64
@returns {String} decoded string
*/
Base64.decode=function(str,utf8decode){
utf8decode = (typeof utf8decode=='undefined') ? false : utf8decode;
var o1;
var o2;
var o3;
var h1;
var h2;
var h3;
var h4;
var bits;
var d = [];
var plain;
var coded;
var b64 = Base64.code;
coded = utf8decode ? str.decodeUTF8() : str;
for(var c=0;c<coded.length;c+=4){
// unpack four hexets into three octets
h1 = b64.indexOf(coded.charAt(c));
h2 = b64.indexOf(coded.charAt(c+1));
h3 = b64.indexOf(coded.charAt(c+2));
h4 = b64.indexOf(coded.charAt(c+3));
bits = h1<<18 | h2<<12 | h3<<6 | h4;
o1 = bits>>>16 & 0xff;
o2 = bits>>>8 & 0xff;
o3 = bits & 0xff;
d[c/4] = String.fromCharCode(o1,o2,o3);
// check for padding
if(h4==0x40){
d[c/4] = String.fromCharCode(o1,o2);
}
if(h3==0x40){
d[c/4] = String.fromCharCode(o1);
}
}//for
// join() is far faster than repeated string concatenation in IE
plain = d.join('');
var r = utf8decode ? plain.decodeUTF8() : plain;
return r;
}//decode
//utf8:
/*
Utf8 class: encode / decode between multi-byte Unicode characters and UTF-8 multiple
single-byte character encoding (c) Chris Veness 2002-2012
*/
// Utf8 namespace
var Utf8 = {};
/*
Encode multi-byte Unicode string into utf-8 multiple single-byte characters
(BMP / basic multilingual plane only)
Chars in range U+0080 - U+07FF are encoded in 2 chars, U+0800 - U+FFFF in 3 chars
@param {String} strUni Unicode string to be encoded as UTF-8
@returns {String} encoded string
*/
Utf8.encode=function(strUni){
// use regular expressions & String.replace callback function for better efficiency
// than procedural approaches
var strUtf;
var regex;
// U+0080 - U+07FF => 2 bytes 110yyyyy, 10zzzzzz
regex = /[\u0080-\u07ff]/g;
strUtf = strUni.replace(regex,r1);
// U+0800 - U+FFFF => 3 bytes 1110xxxx, 10yyyyyy, 10zzzzzz
regex = /[\u0800-\uffff]/g;
strUtf = strUtf.replace(regex,r2);
return strUtf;
function r1(c){
var cc = c.charCodeAt(0);
var r = String.fromCharCode(0xc0 | cc>>6, 0x80 | cc&0x3f);
return r;
}//r1
function r2(c){
var cc = c.charCodeAt(0);
var r = String.fromCharCode(0xe0 | cc>>12, 0x80 | cc>>6&0x3F, 0x80 | cc&0x3f);
return r;
}//r2
}//encode