summaryrefslogtreecommitdiff
path: root/js/dojo-1.7.2/dojox/encoding
diff options
context:
space:
mode:
Diffstat (limited to 'js/dojo-1.7.2/dojox/encoding')
-rw-r--r--js/dojo-1.7.2/dojox/encoding/LICENSE14
-rw-r--r--js/dojo-1.7.2/dojox/encoding/README35
-rw-r--r--js/dojo-1.7.2/dojox/encoding/_base.js4
-rw-r--r--js/dojo-1.7.2/dojox/encoding/ascii85.js66
-rw-r--r--js/dojo-1.7.2/dojox/encoding/base64.js68
-rw-r--r--js/dojo-1.7.2/dojox/encoding/bits.js75
-rw-r--r--js/dojo-1.7.2/dojox/encoding/compression/lzw.js96
-rw-r--r--js/dojo-1.7.2/dojox/encoding/compression/splay.js71
-rw-r--r--js/dojo-1.7.2/dojox/encoding/crypto/Blowfish.js487
-rw-r--r--js/dojo-1.7.2/dojox/encoding/crypto/RSAKey-ext.js123
-rw-r--r--js/dojo-1.7.2/dojox/encoding/crypto/RSAKey.js75
-rw-r--r--js/dojo-1.7.2/dojox/encoding/crypto/SimpleAES.js339
-rw-r--r--js/dojo-1.7.2/dojox/encoding/crypto/_base.js21
-rw-r--r--js/dojo-1.7.2/dojox/encoding/digests/MD5.js177
-rw-r--r--js/dojo-1.7.2/dojox/encoding/digests/SHA1.js155
-rw-r--r--js/dojo-1.7.2/dojox/encoding/digests/_base.js79
-rw-r--r--js/dojo-1.7.2/dojox/encoding/easy64.js52
17 files changed, 1937 insertions, 0 deletions
diff --git a/js/dojo-1.7.2/dojox/encoding/LICENSE b/js/dojo-1.7.2/dojox/encoding/LICENSE
new file mode 100644
index 0000000..f0a4be5
--- /dev/null
+++ b/js/dojo-1.7.2/dojox/encoding/LICENSE
@@ -0,0 +1,14 @@
+License Disclaimer:
+
+All contents of this directory are Copyright (c) the Dojo Foundation, with the
+following exceptions:
+-------------------------------------------------------------------------------
+
+MD5.js, SHA1.js:
+ * Copyright 1998-2005, Paul Johnstone
+ Distributed under the terms of the BSD License
+
+SimpleAES.js
+ * Original version by Chris Veness (CLA signed with permission
+ given under the terms of the BSD license)
+ http://www.movable-type.co.uk/scripts/aes.html
diff --git a/js/dojo-1.7.2/dojox/encoding/README b/js/dojo-1.7.2/dojox/encoding/README
new file mode 100644
index 0000000..b1b80d5
--- /dev/null
+++ b/js/dojo-1.7.2/dojox/encoding/README
@@ -0,0 +1,35 @@
+-------------------------------------------------------------------------------
+DojoX Encoding
+-------------------------------------------------------------------------------
+Version 0.1.0
+Release date: 7/30/2007
+-------------------------------------------------------------------------------
+Project state:
+experimental
+-------------------------------------------------------------------------------
+Credits
+ Eugene Lazutkin
+ Tom Trenka
+-------------------------------------------------------------------------------
+Project description
+
+DojoX Encoding provides a set of routines for common encoding algorithms.
+-------------------------------------------------------------------------------
+Dependencies:
+
+Encoding only depends on the Dojo Core.
+-------------------------------------------------------------------------------
+Documentation
+
+See the API documentation for details.
+-------------------------------------------------------------------------------
+Installation instructions
+
+Grab the following from the Dojo SVN Repository:
+http://svn.dojotoolkit.org/src/dojox/trunk/encoding/*
+
+Install into the following directory structure:
+/dojox/encoding/
+
+...which should be at the same level as your Dojo checkout.
+-------------------------------------------------------------------------------
diff --git a/js/dojo-1.7.2/dojox/encoding/_base.js b/js/dojo-1.7.2/dojox/encoding/_base.js
new file mode 100644
index 0000000..35f92f9
--- /dev/null
+++ b/js/dojo-1.7.2/dojox/encoding/_base.js
@@ -0,0 +1,4 @@
+//>>built
+define("dojox/encoding/_base", ['dojo/_base/lang'], function(lang){
+ return lang.getObject("dojox.encoding._base", true);
+});
diff --git a/js/dojo-1.7.2/dojox/encoding/ascii85.js b/js/dojo-1.7.2/dojox/encoding/ascii85.js
new file mode 100644
index 0000000..32968e0
--- /dev/null
+++ b/js/dojo-1.7.2/dojox/encoding/ascii85.js
@@ -0,0 +1,66 @@
+//>>built
+define("dojox/encoding/ascii85", ["dojo/_base/lang"], function(lang) {
+
+ var ascii85 = lang.getObject("dojox.encoding.ascii85", true);
+ /*=====
+ ascii85 = dojox.encoding.ascii85;
+ =====*/
+
+ var c = function(input, length, result){
+ var i, j, n, b = [0, 0, 0, 0, 0];
+ for(i = 0; i < length; i += 4){
+ n = ((input[i] * 256 + input[i+1]) * 256 + input[i+2]) * 256 + input[i+3];
+ if(!n){
+ result.push("z");
+ }else{
+ for(j = 0; j < 5; b[j++] = n % 85 + 33, n = Math.floor(n / 85));
+ }
+ result.push(String.fromCharCode(b[4], b[3], b[2], b[1], b[0]));
+ }
+ };
+
+ ascii85.encode = function(input){
+ // summary: encodes input data in ascii85 string
+ // input: Array: an array of numbers (0-255) to encode
+ var result = [], reminder = input.length % 4, length = input.length - reminder;
+ c(input, length, result);
+ if(reminder){
+ var t = input.slice(length);
+ while(t.length < 4){ t.push(0); }
+ c(t, 4, result);
+ var x = result.pop();
+ if(x == "z"){ x = "!!!!!"; }
+ result.push(x.substr(0, reminder + 1));
+ }
+ return result.join(""); // String
+ };
+
+ ascii85.decode = function(input){
+ // summary: decodes the input string back to array of numbers
+ // input: String: the input string to decode
+ var n = input.length, r = [], b = [0, 0, 0, 0, 0], i, j, t, x, y, d;
+ for(i = 0; i < n; ++i){
+ if(input.charAt(i) == "z"){
+ r.push(0, 0, 0, 0);
+ continue;
+ }
+ for(j = 0; j < 5; ++j){ b[j] = input.charCodeAt(i + j) - 33; }
+ d = n - i;
+ if(d < 5){
+ for(j = d; j < 4; b[++j] = 0);
+ b[d] = 85;
+ }
+ t = (((b[0] * 85 + b[1]) * 85 + b[2]) * 85 + b[3]) * 85 + b[4];
+ x = t & 255;
+ t >>>= 8;
+ y = t & 255;
+ t >>>= 8;
+ r.push(t >>> 8, t & 255, y, x);
+ for(j = d; j < 5; ++j, r.pop());
+ i += 4;
+ }
+ return r;
+ };
+
+ return ascii85;
+});
diff --git a/js/dojo-1.7.2/dojox/encoding/base64.js b/js/dojo-1.7.2/dojox/encoding/base64.js
new file mode 100644
index 0000000..8ef9bc3
--- /dev/null
+++ b/js/dojo-1.7.2/dojox/encoding/base64.js
@@ -0,0 +1,68 @@
+//>>built
+define("dojox/encoding/base64", ["dojo/_base/lang"], function(lang) {
+
+ var base64 = lang.getObject("dojox.encoding.base64", true);
+ /*=====
+ base64 = dojox.encoding.base64;
+ =====*/
+
+ var p="=";
+ var tab="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+
+ base64.encode=function(/* byte[] */ba){
+ // summary
+ // Encode an array of bytes as a base64-encoded string
+ var s=[], l=ba.length;
+ var rm=l%3;
+ var x=l-rm;
+ for (var i=0; i<x;){
+ var t=ba[i++]<<16|ba[i++]<<8|ba[i++];
+ s.push(tab.charAt((t>>>18)&0x3f));
+ s.push(tab.charAt((t>>>12)&0x3f));
+ s.push(tab.charAt((t>>>6)&0x3f));
+ s.push(tab.charAt(t&0x3f));
+ }
+ // deal with trailers, based on patch from Peter Wood.
+ switch(rm){
+ case 2:{
+ var t=ba[i++]<<16|ba[i++]<<8;
+ s.push(tab.charAt((t>>>18)&0x3f));
+ s.push(tab.charAt((t>>>12)&0x3f));
+ s.push(tab.charAt((t>>>6)&0x3f));
+ s.push(p);
+ break;
+ }
+ case 1:{
+ var t=ba[i++]<<16;
+ s.push(tab.charAt((t>>>18)&0x3f));
+ s.push(tab.charAt((t>>>12)&0x3f));
+ s.push(p);
+ s.push(p);
+ break;
+ }
+ }
+ return s.join(""); // string
+ };
+
+ base64.decode=function(/* string */str){
+ // summary
+ // Convert a base64-encoded string to an array of bytes
+ var s=str.split(""), out=[];
+ var l=s.length;
+ while(s[--l]==p){ } // strip off trailing padding
+ for (var i=0; i<l;){
+ var t=tab.indexOf(s[i++])<<18;
+ if(i<=l){ t|=tab.indexOf(s[i++])<<12 };
+ if(i<=l){ t|=tab.indexOf(s[i++])<<6 };
+ if(i<=l){ t|=tab.indexOf(s[i++]) };
+ out.push((t>>>16)&0xff);
+ out.push((t>>>8)&0xff);
+ out.push(t&0xff);
+ }
+ // strip off any null bytes
+ while(out[out.length-1]==0){ out.pop(); }
+ return out; // byte[]
+ };
+
+ return base64;
+});
diff --git a/js/dojo-1.7.2/dojox/encoding/bits.js b/js/dojo-1.7.2/dojox/encoding/bits.js
new file mode 100644
index 0000000..359c5e8
--- /dev/null
+++ b/js/dojo-1.7.2/dojox/encoding/bits.js
@@ -0,0 +1,75 @@
+//>>built
+define("dojox/encoding/bits", [
+ "dojo/_base/lang" // dojo.extend
+], function(lang) {
+ var bits = lang.getObject("dojox.encoding.bits", true);
+ /*=====
+ bits = dojox.encoding.bits;
+ =====*/
+
+ bits.OutputStream = function(){
+ this.reset();
+ };
+
+ lang.extend(bits.OutputStream, {
+ reset: function(){
+ this.buffer = [];
+ this.accumulator = 0;
+ this.available = 8;
+ },
+ putBits: function(value, width){
+ while(width){
+ var w = Math.min(width, this.available);
+ var v = (w <= width ? value >>> (width - w) : value) << (this.available - w);
+ this.accumulator |= v & (255 >>> (8 - this.available));
+ this.available -= w;
+ if(!this.available){
+ this.buffer.push(this.accumulator);
+ this.accumulator = 0;
+ this.available = 8;
+ }
+ width -= w;
+ }
+ },
+ getWidth: function(){
+ return this.buffer.length * 8 + (8 - this.available);
+ },
+ getBuffer: function(){
+ var b = this.buffer;
+ if(this.available < 8){ b.push(this.accumulator & (255 << this.available)); }
+ this.reset();
+ return b;
+ }
+ });
+
+ bits.InputStream = function(buffer, width){
+ this.buffer = buffer;
+ this.width = width;
+ this.bbyte = this.bit = 0;
+ };
+
+ lang.extend(bits.InputStream, {
+ getBits: function(width){
+ var r = 0;
+ while(width){
+ var w = Math.min(width, 8 - this.bit);
+ var v = this.buffer[this.bbyte] >>> (8 - this.bit - w);
+ r <<= w;
+ r |= v & ~(~0 << w);
+ this.bit += w;
+ if(this.bit == 8){
+ ++this.bbyte;
+ this.bit = 0;
+ }
+ width -= w;
+ }
+ return r;
+ },
+ getWidth: function(){
+ return this.width - this.bbyte * 8 - this.bit;
+ }
+ });
+
+
+ return bits;
+});
diff --git a/js/dojo-1.7.2/dojox/encoding/compression/lzw.js b/js/dojo-1.7.2/dojox/encoding/compression/lzw.js
new file mode 100644
index 0000000..ee771d4
--- /dev/null
+++ b/js/dojo-1.7.2/dojox/encoding/compression/lzw.js
@@ -0,0 +1,96 @@
+//>>built
+define("dojox/encoding/compression/lzw", [
+ "dojo/_base/lang", // dojo.extend
+ "../bits"
+], function(lang, bits) {
+
+ var lzw = lang.getObject("dojox.encoding.compression.lzw", true);
+ /*=====
+ lzw = dojox.encoding.compression.lzw;
+ =====*/
+
+ var _bits = function(x){
+ var w = 1;
+ for(var v = 2; x >= v; v <<= 1, ++w);
+ return w;
+ };
+
+ lzw.Encoder = function(n){
+ this.size = n;
+ this.init();
+ };
+
+ lang.extend(lzw.Encoder, {
+ init: function(){
+ this.dict = {};
+ for(var i = 0; i < this.size; ++i){
+ this.dict[String.fromCharCode(i)] = i;
+ }
+ this.width = _bits(this.code = this.size);
+ this.p = "";
+ },
+ encode: function(value, stream){
+ var c = String.fromCharCode(value), p = this.p + c, r = 0;
+ // if already in the dictionary
+ if(p in this.dict){
+ this.p = p;
+ return r;
+ }
+ stream.putBits(this.dict[this.p], this.width);
+ // if we need to increase the code length
+ if((this.code & (this.code + 1)) == 0){
+ stream.putBits(this.code++, r = this.width++);
+ }
+ // add new string
+ this.dict[p] = this.code++;
+ this.p = c;
+ return r + this.width;
+ },
+ flush: function(stream){
+ if(this.p.length == 0){
+ return 0;
+ }
+ stream.putBits(this.dict[this.p], this.width);
+ this.p = "";
+ return this.width;
+ }
+ });
+
+ lzw.Decoder = function(n){
+ this.size = n;
+ this.init();
+ };
+
+ lang.extend(lzw.Decoder, {
+ init: function(){
+ this.codes = new Array(this.size);
+ for(var i = 0; i < this.size; ++i){
+ this.codes[i] = String.fromCharCode(i);
+ }
+ this.width = _bits(this.size);
+ this.p = -1;
+ },
+ decode: function(stream){
+ var c = stream.getBits(this.width), v;
+ if(c < this.codes.length){
+ v = this.codes[c];
+ if(this.p >= 0){
+ this.codes.push(this.codes[this.p] + v.substr(0, 1));
+ }
+ }else{
+ if((c & (c + 1)) == 0){
+ this.codes.push("");
+ ++this.width;
+ return "";
+ }
+ var x = this.codes[this.p];
+ v = x + x.substr(0, 1);
+ this.codes.push(v);
+ }
+ this.p = c;
+ return v;
+ }
+ });
+
+ return lzw;
+});
diff --git a/js/dojo-1.7.2/dojox/encoding/compression/splay.js b/js/dojo-1.7.2/dojox/encoding/compression/splay.js
new file mode 100644
index 0000000..45ebe6d
--- /dev/null
+++ b/js/dojo-1.7.2/dojox/encoding/compression/splay.js
@@ -0,0 +1,71 @@
+//>>built
+define("dojox/encoding/compression/splay", [
+ "dojo/_base/lang", // dojo.extend
+ "../bits"
+], function(lang, bits) {
+ var compression = lang.getObject("dojox.encoding.compression", true);
+ /*=====
+ compression = dojox.encoding.compression;
+ =====*/
+
+ compression.Splay = function(n){
+ this.up = new Array(2 * n + 1);
+ this.left = new Array(n);
+ this.right = new Array(n);
+ this.reset();
+ };
+
+ lang.extend(compression.Splay, {
+ reset: function(){
+ for(var i = 1; i < this.up.length; this.up[i] = Math.floor((i - 1) / 2), ++i);
+ for(var i = 0; i < this.left.length; this.left[i] = 2 * i + 1, this.right[i] = 2 * i + 2, ++i);
+ },
+ splay: function(i){
+ var a = i + this.left.length;
+ do{
+ var c = this.up[a];
+ if(c){ // root
+ // rotated pair
+ var d = this.up[c];
+ // swap descendants
+ var b = this.left[d];
+ if(c == b){
+ b = this.right[d];
+ this.right[d] = a;
+ } else {
+ this.left[d] = a;
+ }
+ this[a == this.left[c] ? "left" : "right"][c] = b;
+ this.up[a] = d;
+ this.up[b] = c;
+ a = d;
+ }else{
+ a = c;
+ }
+ }while(a); // root
+ },
+ encode: function(value, stream){
+ var s = [], a = value + this.left.length;
+ do{
+ s.push(this.right[this.up[a]] == a);
+ a = this.up[a];
+ }while(a); // root
+ this.splay(value);
+ var l = s.length;
+ while(s.length){ stream.putBits(s.pop() ? 1 : 0, 1); }
+ return l;
+ },
+ decode: function(stream){
+ var a = 0; // root;
+ do{
+ a = this[stream.getBits(1) ? "right" : "left"][a];
+ }while(a < this.left.length);
+ a -= this.left.length;
+ this.splay(a);
+ return a;
+ }
+ });
+
+
+ return compression.Splay;
+});
diff --git a/js/dojo-1.7.2/dojox/encoding/crypto/Blowfish.js b/js/dojo-1.7.2/dojox/encoding/crypto/Blowfish.js
new file mode 100644
index 0000000..1baa2b5
--- /dev/null
+++ b/js/dojo-1.7.2/dojox/encoding/crypto/Blowfish.js
@@ -0,0 +1,487 @@
+//>>built
+define("dojox/encoding/crypto/Blowfish", [
+ "dojo/_base/lang", // dojo.isString
+ "dojo/_base/array", // dojo.map
+ "../base64",
+ "./_base"
+], function(lang, arrayUtil, base64, crypto){
+ /*=====
+ crypto = dojox.encoding.crypto;
+ =====*/
+
+/* Blowfish
+ * Created based on the C# implementation by Marcus Hahn (http://www.hotpixel.net/)
+ * Unsigned math based on Paul Johnstone and Peter Wood patches.
+ * 2005-12-08
+ */
+crypto.Blowfish = new function(){
+ // summary
+ // Object for doing Blowfish encryption/decryption.
+ var POW2=Math.pow(2,2);
+ var POW3=Math.pow(2,3);
+ var POW4=Math.pow(2,4);
+ var POW8=Math.pow(2,8);
+ var POW16=Math.pow(2,16);
+ var POW24=Math.pow(2,24);
+ var iv=null; // CBC mode initialization vector
+ var boxes={
+ p:[
+ 0x243f6a88, 0x85a308d3, 0x13198a2e, 0x03707344, 0xa4093822, 0x299f31d0, 0x082efa98, 0xec4e6c89,
+ 0x452821e6, 0x38d01377, 0xbe5466cf, 0x34e90c6c, 0xc0ac29b7, 0xc97c50dd, 0x3f84d5b5, 0xb5470917,
+ 0x9216d5d9, 0x8979fb1b
+ ],
+ s0:[
+ 0xd1310ba6, 0x98dfb5ac, 0x2ffd72db, 0xd01adfb7, 0xb8e1afed, 0x6a267e96, 0xba7c9045, 0xf12c7f99,
+ 0x24a19947, 0xb3916cf7, 0x0801f2e2, 0x858efc16, 0x636920d8, 0x71574e69, 0xa458fea3, 0xf4933d7e,
+ 0x0d95748f, 0x728eb658, 0x718bcd58, 0x82154aee, 0x7b54a41d, 0xc25a59b5, 0x9c30d539, 0x2af26013,
+ 0xc5d1b023, 0x286085f0, 0xca417918, 0xb8db38ef, 0x8e79dcb0, 0x603a180e, 0x6c9e0e8b, 0xb01e8a3e,
+ 0xd71577c1, 0xbd314b27, 0x78af2fda, 0x55605c60, 0xe65525f3, 0xaa55ab94, 0x57489862, 0x63e81440,
+ 0x55ca396a, 0x2aab10b6, 0xb4cc5c34, 0x1141e8ce, 0xa15486af, 0x7c72e993, 0xb3ee1411, 0x636fbc2a,
+ 0x2ba9c55d, 0x741831f6, 0xce5c3e16, 0x9b87931e, 0xafd6ba33, 0x6c24cf5c, 0x7a325381, 0x28958677,
+ 0x3b8f4898, 0x6b4bb9af, 0xc4bfe81b, 0x66282193, 0x61d809cc, 0xfb21a991, 0x487cac60, 0x5dec8032,
+ 0xef845d5d, 0xe98575b1, 0xdc262302, 0xeb651b88, 0x23893e81, 0xd396acc5, 0x0f6d6ff3, 0x83f44239,
+ 0x2e0b4482, 0xa4842004, 0x69c8f04a, 0x9e1f9b5e, 0x21c66842, 0xf6e96c9a, 0x670c9c61, 0xabd388f0,
+ 0x6a51a0d2, 0xd8542f68, 0x960fa728, 0xab5133a3, 0x6eef0b6c, 0x137a3be4, 0xba3bf050, 0x7efb2a98,
+ 0xa1f1651d, 0x39af0176, 0x66ca593e, 0x82430e88, 0x8cee8619, 0x456f9fb4, 0x7d84a5c3, 0x3b8b5ebe,
+ 0xe06f75d8, 0x85c12073, 0x401a449f, 0x56c16aa6, 0x4ed3aa62, 0x363f7706, 0x1bfedf72, 0x429b023d,
+ 0x37d0d724, 0xd00a1248, 0xdb0fead3, 0x49f1c09b, 0x075372c9, 0x80991b7b, 0x25d479d8, 0xf6e8def7,
+ 0xe3fe501a, 0xb6794c3b, 0x976ce0bd, 0x04c006ba, 0xc1a94fb6, 0x409f60c4, 0x5e5c9ec2, 0x196a2463,
+ 0x68fb6faf, 0x3e6c53b5, 0x1339b2eb, 0x3b52ec6f, 0x6dfc511f, 0x9b30952c, 0xcc814544, 0xaf5ebd09,
+ 0xbee3d004, 0xde334afd, 0x660f2807, 0x192e4bb3, 0xc0cba857, 0x45c8740f, 0xd20b5f39, 0xb9d3fbdb,
+ 0x5579c0bd, 0x1a60320a, 0xd6a100c6, 0x402c7279, 0x679f25fe, 0xfb1fa3cc, 0x8ea5e9f8, 0xdb3222f8,
+ 0x3c7516df, 0xfd616b15, 0x2f501ec8, 0xad0552ab, 0x323db5fa, 0xfd238760, 0x53317b48, 0x3e00df82,
+ 0x9e5c57bb, 0xca6f8ca0, 0x1a87562e, 0xdf1769db, 0xd542a8f6, 0x287effc3, 0xac6732c6, 0x8c4f5573,
+ 0x695b27b0, 0xbbca58c8, 0xe1ffa35d, 0xb8f011a0, 0x10fa3d98, 0xfd2183b8, 0x4afcb56c, 0x2dd1d35b,
+ 0x9a53e479, 0xb6f84565, 0xd28e49bc, 0x4bfb9790, 0xe1ddf2da, 0xa4cb7e33, 0x62fb1341, 0xcee4c6e8,
+ 0xef20cada, 0x36774c01, 0xd07e9efe, 0x2bf11fb4, 0x95dbda4d, 0xae909198, 0xeaad8e71, 0x6b93d5a0,
+ 0xd08ed1d0, 0xafc725e0, 0x8e3c5b2f, 0x8e7594b7, 0x8ff6e2fb, 0xf2122b64, 0x8888b812, 0x900df01c,
+ 0x4fad5ea0, 0x688fc31c, 0xd1cff191, 0xb3a8c1ad, 0x2f2f2218, 0xbe0e1777, 0xea752dfe, 0x8b021fa1,
+ 0xe5a0cc0f, 0xb56f74e8, 0x18acf3d6, 0xce89e299, 0xb4a84fe0, 0xfd13e0b7, 0x7cc43b81, 0xd2ada8d9,
+ 0x165fa266, 0x80957705, 0x93cc7314, 0x211a1477, 0xe6ad2065, 0x77b5fa86, 0xc75442f5, 0xfb9d35cf,
+ 0xebcdaf0c, 0x7b3e89a0, 0xd6411bd3, 0xae1e7e49, 0x00250e2d, 0x2071b35e, 0x226800bb, 0x57b8e0af,
+ 0x2464369b, 0xf009b91e, 0x5563911d, 0x59dfa6aa, 0x78c14389, 0xd95a537f, 0x207d5ba2, 0x02e5b9c5,
+ 0x83260376, 0x6295cfa9, 0x11c81968, 0x4e734a41, 0xb3472dca, 0x7b14a94a, 0x1b510052, 0x9a532915,
+ 0xd60f573f, 0xbc9bc6e4, 0x2b60a476, 0x81e67400, 0x08ba6fb5, 0x571be91f, 0xf296ec6b, 0x2a0dd915,
+ 0xb6636521, 0xe7b9f9b6, 0xff34052e, 0xc5855664, 0x53b02d5d, 0xa99f8fa1, 0x08ba4799, 0x6e85076a
+ ],
+ s1:[
+ 0x4b7a70e9, 0xb5b32944, 0xdb75092e, 0xc4192623, 0xad6ea6b0, 0x49a7df7d, 0x9cee60b8, 0x8fedb266,
+ 0xecaa8c71, 0x699a17ff, 0x5664526c, 0xc2b19ee1, 0x193602a5, 0x75094c29, 0xa0591340, 0xe4183a3e,
+ 0x3f54989a, 0x5b429d65, 0x6b8fe4d6, 0x99f73fd6, 0xa1d29c07, 0xefe830f5, 0x4d2d38e6, 0xf0255dc1,
+ 0x4cdd2086, 0x8470eb26, 0x6382e9c6, 0x021ecc5e, 0x09686b3f, 0x3ebaefc9, 0x3c971814, 0x6b6a70a1,
+ 0x687f3584, 0x52a0e286, 0xb79c5305, 0xaa500737, 0x3e07841c, 0x7fdeae5c, 0x8e7d44ec, 0x5716f2b8,
+ 0xb03ada37, 0xf0500c0d, 0xf01c1f04, 0x0200b3ff, 0xae0cf51a, 0x3cb574b2, 0x25837a58, 0xdc0921bd,
+ 0xd19113f9, 0x7ca92ff6, 0x94324773, 0x22f54701, 0x3ae5e581, 0x37c2dadc, 0xc8b57634, 0x9af3dda7,
+ 0xa9446146, 0x0fd0030e, 0xecc8c73e, 0xa4751e41, 0xe238cd99, 0x3bea0e2f, 0x3280bba1, 0x183eb331,
+ 0x4e548b38, 0x4f6db908, 0x6f420d03, 0xf60a04bf, 0x2cb81290, 0x24977c79, 0x5679b072, 0xbcaf89af,
+ 0xde9a771f, 0xd9930810, 0xb38bae12, 0xdccf3f2e, 0x5512721f, 0x2e6b7124, 0x501adde6, 0x9f84cd87,
+ 0x7a584718, 0x7408da17, 0xbc9f9abc, 0xe94b7d8c, 0xec7aec3a, 0xdb851dfa, 0x63094366, 0xc464c3d2,
+ 0xef1c1847, 0x3215d908, 0xdd433b37, 0x24c2ba16, 0x12a14d43, 0x2a65c451, 0x50940002, 0x133ae4dd,
+ 0x71dff89e, 0x10314e55, 0x81ac77d6, 0x5f11199b, 0x043556f1, 0xd7a3c76b, 0x3c11183b, 0x5924a509,
+ 0xf28fe6ed, 0x97f1fbfa, 0x9ebabf2c, 0x1e153c6e, 0x86e34570, 0xeae96fb1, 0x860e5e0a, 0x5a3e2ab3,
+ 0x771fe71c, 0x4e3d06fa, 0x2965dcb9, 0x99e71d0f, 0x803e89d6, 0x5266c825, 0x2e4cc978, 0x9c10b36a,
+ 0xc6150eba, 0x94e2ea78, 0xa5fc3c53, 0x1e0a2df4, 0xf2f74ea7, 0x361d2b3d, 0x1939260f, 0x19c27960,
+ 0x5223a708, 0xf71312b6, 0xebadfe6e, 0xeac31f66, 0xe3bc4595, 0xa67bc883, 0xb17f37d1, 0x018cff28,
+ 0xc332ddef, 0xbe6c5aa5, 0x65582185, 0x68ab9802, 0xeecea50f, 0xdb2f953b, 0x2aef7dad, 0x5b6e2f84,
+ 0x1521b628, 0x29076170, 0xecdd4775, 0x619f1510, 0x13cca830, 0xeb61bd96, 0x0334fe1e, 0xaa0363cf,
+ 0xb5735c90, 0x4c70a239, 0xd59e9e0b, 0xcbaade14, 0xeecc86bc, 0x60622ca7, 0x9cab5cab, 0xb2f3846e,
+ 0x648b1eaf, 0x19bdf0ca, 0xa02369b9, 0x655abb50, 0x40685a32, 0x3c2ab4b3, 0x319ee9d5, 0xc021b8f7,
+ 0x9b540b19, 0x875fa099, 0x95f7997e, 0x623d7da8, 0xf837889a, 0x97e32d77, 0x11ed935f, 0x16681281,
+ 0x0e358829, 0xc7e61fd6, 0x96dedfa1, 0x7858ba99, 0x57f584a5, 0x1b227263, 0x9b83c3ff, 0x1ac24696,
+ 0xcdb30aeb, 0x532e3054, 0x8fd948e4, 0x6dbc3128, 0x58ebf2ef, 0x34c6ffea, 0xfe28ed61, 0xee7c3c73,
+ 0x5d4a14d9, 0xe864b7e3, 0x42105d14, 0x203e13e0, 0x45eee2b6, 0xa3aaabea, 0xdb6c4f15, 0xfacb4fd0,
+ 0xc742f442, 0xef6abbb5, 0x654f3b1d, 0x41cd2105, 0xd81e799e, 0x86854dc7, 0xe44b476a, 0x3d816250,
+ 0xcf62a1f2, 0x5b8d2646, 0xfc8883a0, 0xc1c7b6a3, 0x7f1524c3, 0x69cb7492, 0x47848a0b, 0x5692b285,
+ 0x095bbf00, 0xad19489d, 0x1462b174, 0x23820e00, 0x58428d2a, 0x0c55f5ea, 0x1dadf43e, 0x233f7061,
+ 0x3372f092, 0x8d937e41, 0xd65fecf1, 0x6c223bdb, 0x7cde3759, 0xcbee7460, 0x4085f2a7, 0xce77326e,
+ 0xa6078084, 0x19f8509e, 0xe8efd855, 0x61d99735, 0xa969a7aa, 0xc50c06c2, 0x5a04abfc, 0x800bcadc,
+ 0x9e447a2e, 0xc3453484, 0xfdd56705, 0x0e1e9ec9, 0xdb73dbd3, 0x105588cd, 0x675fda79, 0xe3674340,
+ 0xc5c43465, 0x713e38d8, 0x3d28f89e, 0xf16dff20, 0x153e21e7, 0x8fb03d4a, 0xe6e39f2b, 0xdb83adf7
+ ],
+ s2:[
+ 0xe93d5a68, 0x948140f7, 0xf64c261c, 0x94692934, 0x411520f7, 0x7602d4f7, 0xbcf46b2e, 0xd4a20068,
+ 0xd4082471, 0x3320f46a, 0x43b7d4b7, 0x500061af, 0x1e39f62e, 0x97244546, 0x14214f74, 0xbf8b8840,
+ 0x4d95fc1d, 0x96b591af, 0x70f4ddd3, 0x66a02f45, 0xbfbc09ec, 0x03bd9785, 0x7fac6dd0, 0x31cb8504,
+ 0x96eb27b3, 0x55fd3941, 0xda2547e6, 0xabca0a9a, 0x28507825, 0x530429f4, 0x0a2c86da, 0xe9b66dfb,
+ 0x68dc1462, 0xd7486900, 0x680ec0a4, 0x27a18dee, 0x4f3ffea2, 0xe887ad8c, 0xb58ce006, 0x7af4d6b6,
+ 0xaace1e7c, 0xd3375fec, 0xce78a399, 0x406b2a42, 0x20fe9e35, 0xd9f385b9, 0xee39d7ab, 0x3b124e8b,
+ 0x1dc9faf7, 0x4b6d1856, 0x26a36631, 0xeae397b2, 0x3a6efa74, 0xdd5b4332, 0x6841e7f7, 0xca7820fb,
+ 0xfb0af54e, 0xd8feb397, 0x454056ac, 0xba489527, 0x55533a3a, 0x20838d87, 0xfe6ba9b7, 0xd096954b,
+ 0x55a867bc, 0xa1159a58, 0xcca92963, 0x99e1db33, 0xa62a4a56, 0x3f3125f9, 0x5ef47e1c, 0x9029317c,
+ 0xfdf8e802, 0x04272f70, 0x80bb155c, 0x05282ce3, 0x95c11548, 0xe4c66d22, 0x48c1133f, 0xc70f86dc,
+ 0x07f9c9ee, 0x41041f0f, 0x404779a4, 0x5d886e17, 0x325f51eb, 0xd59bc0d1, 0xf2bcc18f, 0x41113564,
+ 0x257b7834, 0x602a9c60, 0xdff8e8a3, 0x1f636c1b, 0x0e12b4c2, 0x02e1329e, 0xaf664fd1, 0xcad18115,
+ 0x6b2395e0, 0x333e92e1, 0x3b240b62, 0xeebeb922, 0x85b2a20e, 0xe6ba0d99, 0xde720c8c, 0x2da2f728,
+ 0xd0127845, 0x95b794fd, 0x647d0862, 0xe7ccf5f0, 0x5449a36f, 0x877d48fa, 0xc39dfd27, 0xf33e8d1e,
+ 0x0a476341, 0x992eff74, 0x3a6f6eab, 0xf4f8fd37, 0xa812dc60, 0xa1ebddf8, 0x991be14c, 0xdb6e6b0d,
+ 0xc67b5510, 0x6d672c37, 0x2765d43b, 0xdcd0e804, 0xf1290dc7, 0xcc00ffa3, 0xb5390f92, 0x690fed0b,
+ 0x667b9ffb, 0xcedb7d9c, 0xa091cf0b, 0xd9155ea3, 0xbb132f88, 0x515bad24, 0x7b9479bf, 0x763bd6eb,
+ 0x37392eb3, 0xcc115979, 0x8026e297, 0xf42e312d, 0x6842ada7, 0xc66a2b3b, 0x12754ccc, 0x782ef11c,
+ 0x6a124237, 0xb79251e7, 0x06a1bbe6, 0x4bfb6350, 0x1a6b1018, 0x11caedfa, 0x3d25bdd8, 0xe2e1c3c9,
+ 0x44421659, 0x0a121386, 0xd90cec6e, 0xd5abea2a, 0x64af674e, 0xda86a85f, 0xbebfe988, 0x64e4c3fe,
+ 0x9dbc8057, 0xf0f7c086, 0x60787bf8, 0x6003604d, 0xd1fd8346, 0xf6381fb0, 0x7745ae04, 0xd736fccc,
+ 0x83426b33, 0xf01eab71, 0xb0804187, 0x3c005e5f, 0x77a057be, 0xbde8ae24, 0x55464299, 0xbf582e61,
+ 0x4e58f48f, 0xf2ddfda2, 0xf474ef38, 0x8789bdc2, 0x5366f9c3, 0xc8b38e74, 0xb475f255, 0x46fcd9b9,
+ 0x7aeb2661, 0x8b1ddf84, 0x846a0e79, 0x915f95e2, 0x466e598e, 0x20b45770, 0x8cd55591, 0xc902de4c,
+ 0xb90bace1, 0xbb8205d0, 0x11a86248, 0x7574a99e, 0xb77f19b6, 0xe0a9dc09, 0x662d09a1, 0xc4324633,
+ 0xe85a1f02, 0x09f0be8c, 0x4a99a025, 0x1d6efe10, 0x1ab93d1d, 0x0ba5a4df, 0xa186f20f, 0x2868f169,
+ 0xdcb7da83, 0x573906fe, 0xa1e2ce9b, 0x4fcd7f52, 0x50115e01, 0xa70683fa, 0xa002b5c4, 0x0de6d027,
+ 0x9af88c27, 0x773f8641, 0xc3604c06, 0x61a806b5, 0xf0177a28, 0xc0f586e0, 0x006058aa, 0x30dc7d62,
+ 0x11e69ed7, 0x2338ea63, 0x53c2dd94, 0xc2c21634, 0xbbcbee56, 0x90bcb6de, 0xebfc7da1, 0xce591d76,
+ 0x6f05e409, 0x4b7c0188, 0x39720a3d, 0x7c927c24, 0x86e3725f, 0x724d9db9, 0x1ac15bb4, 0xd39eb8fc,
+ 0xed545578, 0x08fca5b5, 0xd83d7cd3, 0x4dad0fc4, 0x1e50ef5e, 0xb161e6f8, 0xa28514d9, 0x6c51133c,
+ 0x6fd5c7e7, 0x56e14ec4, 0x362abfce, 0xddc6c837, 0xd79a3234, 0x92638212, 0x670efa8e, 0x406000e0
+ ],
+ s3:[
+ 0x3a39ce37, 0xd3faf5cf, 0xabc27737, 0x5ac52d1b, 0x5cb0679e, 0x4fa33742, 0xd3822740, 0x99bc9bbe,
+ 0xd5118e9d, 0xbf0f7315, 0xd62d1c7e, 0xc700c47b, 0xb78c1b6b, 0x21a19045, 0xb26eb1be, 0x6a366eb4,
+ 0x5748ab2f, 0xbc946e79, 0xc6a376d2, 0x6549c2c8, 0x530ff8ee, 0x468dde7d, 0xd5730a1d, 0x4cd04dc6,
+ 0x2939bbdb, 0xa9ba4650, 0xac9526e8, 0xbe5ee304, 0xa1fad5f0, 0x6a2d519a, 0x63ef8ce2, 0x9a86ee22,
+ 0xc089c2b8, 0x43242ef6, 0xa51e03aa, 0x9cf2d0a4, 0x83c061ba, 0x9be96a4d, 0x8fe51550, 0xba645bd6,
+ 0x2826a2f9, 0xa73a3ae1, 0x4ba99586, 0xef5562e9, 0xc72fefd3, 0xf752f7da, 0x3f046f69, 0x77fa0a59,
+ 0x80e4a915, 0x87b08601, 0x9b09e6ad, 0x3b3ee593, 0xe990fd5a, 0x9e34d797, 0x2cf0b7d9, 0x022b8b51,
+ 0x96d5ac3a, 0x017da67d, 0xd1cf3ed6, 0x7c7d2d28, 0x1f9f25cf, 0xadf2b89b, 0x5ad6b472, 0x5a88f54c,
+ 0xe029ac71, 0xe019a5e6, 0x47b0acfd, 0xed93fa9b, 0xe8d3c48d, 0x283b57cc, 0xf8d56629, 0x79132e28,
+ 0x785f0191, 0xed756055, 0xf7960e44, 0xe3d35e8c, 0x15056dd4, 0x88f46dba, 0x03a16125, 0x0564f0bd,
+ 0xc3eb9e15, 0x3c9057a2, 0x97271aec, 0xa93a072a, 0x1b3f6d9b, 0x1e6321f5, 0xf59c66fb, 0x26dcf319,
+ 0x7533d928, 0xb155fdf5, 0x03563482, 0x8aba3cbb, 0x28517711, 0xc20ad9f8, 0xabcc5167, 0xccad925f,
+ 0x4de81751, 0x3830dc8e, 0x379d5862, 0x9320f991, 0xea7a90c2, 0xfb3e7bce, 0x5121ce64, 0x774fbe32,
+ 0xa8b6e37e, 0xc3293d46, 0x48de5369, 0x6413e680, 0xa2ae0810, 0xdd6db224, 0x69852dfd, 0x09072166,
+ 0xb39a460a, 0x6445c0dd, 0x586cdecf, 0x1c20c8ae, 0x5bbef7dd, 0x1b588d40, 0xccd2017f, 0x6bb4e3bb,
+ 0xdda26a7e, 0x3a59ff45, 0x3e350a44, 0xbcb4cdd5, 0x72eacea8, 0xfa6484bb, 0x8d6612ae, 0xbf3c6f47,
+ 0xd29be463, 0x542f5d9e, 0xaec2771b, 0xf64e6370, 0x740e0d8d, 0xe75b1357, 0xf8721671, 0xaf537d5d,
+ 0x4040cb08, 0x4eb4e2cc, 0x34d2466a, 0x0115af84, 0xe1b00428, 0x95983a1d, 0x06b89fb4, 0xce6ea048,
+ 0x6f3f3b82, 0x3520ab82, 0x011a1d4b, 0x277227f8, 0x611560b1, 0xe7933fdc, 0xbb3a792b, 0x344525bd,
+ 0xa08839e1, 0x51ce794b, 0x2f32c9b7, 0xa01fbac9, 0xe01cc87e, 0xbcc7d1f6, 0xcf0111c3, 0xa1e8aac7,
+ 0x1a908749, 0xd44fbd9a, 0xd0dadecb, 0xd50ada38, 0x0339c32a, 0xc6913667, 0x8df9317c, 0xe0b12b4f,
+ 0xf79e59b7, 0x43f5bb3a, 0xf2d519ff, 0x27d9459c, 0xbf97222c, 0x15e6fc2a, 0x0f91fc71, 0x9b941525,
+ 0xfae59361, 0xceb69ceb, 0xc2a86459, 0x12baa8d1, 0xb6c1075e, 0xe3056a0c, 0x10d25065, 0xcb03a442,
+ 0xe0ec6e0e, 0x1698db3b, 0x4c98a0be, 0x3278e964, 0x9f1f9532, 0xe0d392df, 0xd3a0342b, 0x8971f21e,
+ 0x1b0a7441, 0x4ba3348c, 0xc5be7120, 0xc37632d8, 0xdf359f8d, 0x9b992f2e, 0xe60b6f47, 0x0fe3f11d,
+ 0xe54cda54, 0x1edad891, 0xce6279cf, 0xcd3e7e6f, 0x1618b166, 0xfd2c1d05, 0x848fd2c5, 0xf6fb2299,
+ 0xf523f357, 0xa6327623, 0x93a83531, 0x56cccd02, 0xacf08162, 0x5a75ebb5, 0x6e163697, 0x88d273cc,
+ 0xde966292, 0x81b949d0, 0x4c50901b, 0x71c65614, 0xe6c6c7bd, 0x327a140a, 0x45e1d006, 0xc3f27b9a,
+ 0xc9aa53fd, 0x62a80f00, 0xbb25bfe2, 0x35bdd2f6, 0x71126905, 0xb2040222, 0xb6cbcf7c, 0xcd769c2b,
+ 0x53113ec0, 0x1640e3d3, 0x38abbd60, 0x2547adf0, 0xba38209c, 0xf746ce76, 0x77afa1c5, 0x20756060,
+ 0x85cbfe4e, 0x8ae88dd8, 0x7aaaf9b0, 0x4cf9aa7e, 0x1948c25c, 0x02fb8a8c, 0x01c36ae4, 0xd6ebe1f9,
+ 0x90d4f869, 0xa65cdea0, 0x3f09252d, 0xc208e69f, 0xb74e6132, 0xce77e25b, 0x578fdfe3, 0x3ac372e6
+ ]
+ }
+////////////////////////////////////////////////////////////////////////////
+// fixes based on patch submitted by Peter Wood (#5791)
+ function add(x,y){
+ return (((x>>0x10)+(y>>0x10)+(((x&0xffff)+(y&0xffff))>>0x10))<<0x10)|(((x&0xffff)+(y&0xffff))&0xffff);
+ }
+ function xor(x,y){
+ return (((x>>0x10)^(y>>0x10))<<0x10)|(((x&0xffff)^(y&0xffff))&0xffff);
+ }
+
+ function $(v, box){
+ var d=box.s3[v&0xff]; v>>=8;
+ var c=box.s2[v&0xff]; v>>=8;
+ var b=box.s1[v&0xff]; v>>=8;
+ var a=box.s0[v&0xff];
+
+ var r = (((a>>0x10)+(b>>0x10)+(((a&0xffff)+(b&0xffff))>>0x10))<<0x10)|(((a&0xffff)+(b&0xffff))&0xffff);
+ r = (((r>>0x10)^(c>>0x10))<<0x10)|(((r&0xffff)^(c&0xffff))&0xffff);
+ return (((r>>0x10)+(d>>0x10)+(((r&0xffff)+(d&0xffff))>>0x10))<<0x10)|(((r&0xffff)+(d&0xffff))&0xffff);
+ }
+////////////////////////////////////////////////////////////////////////////
+ function eb(o, box){
+ // TODO: see if this can't be made more efficient
+ var l=o.left;
+ var r=o.right;
+ l=xor(l,box.p[0]);
+ r=xor(r,xor($(l,box),box.p[1]));
+ l=xor(l,xor($(r,box),box.p[2]));
+ r=xor(r,xor($(l,box),box.p[3]));
+ l=xor(l,xor($(r,box),box.p[4]));
+ r=xor(r,xor($(l,box),box.p[5]));
+ l=xor(l,xor($(r,box),box.p[6]));
+ r=xor(r,xor($(l,box),box.p[7]));
+ l=xor(l,xor($(r,box),box.p[8]));
+ r=xor(r,xor($(l,box),box.p[9]));
+ l=xor(l,xor($(r,box),box.p[10]));
+ r=xor(r,xor($(l,box),box.p[11]));
+ l=xor(l,xor($(r,box),box.p[12]));
+ r=xor(r,xor($(l,box),box.p[13]));
+ l=xor(l,xor($(r,box),box.p[14]));
+ r=xor(r,xor($(l,box),box.p[15]));
+ l=xor(l,xor($(r,box),box.p[16]));
+ o.right=l;
+ o.left=xor(r,box.p[17]);
+ }
+
+ function db(o, box){
+ var l=o.left;
+ var r=o.right;
+ l=xor(l,box.p[17]);
+ r=xor(r,xor($(l,box),box.p[16]));
+ l=xor(l,xor($(r,box),box.p[15]));
+ r=xor(r,xor($(l,box),box.p[14]));
+ l=xor(l,xor($(r,box),box.p[13]));
+ r=xor(r,xor($(l,box),box.p[12]));
+ l=xor(l,xor($(r,box),box.p[11]));
+ r=xor(r,xor($(l,box),box.p[10]));
+ l=xor(l,xor($(r,box),box.p[9]));
+ r=xor(r,xor($(l,box),box.p[8]));
+ l=xor(l,xor($(r,box),box.p[7]));
+ r=xor(r,xor($(l,box),box.p[6]));
+ l=xor(l,xor($(r,box),box.p[5]));
+ r=xor(r,xor($(l,box),box.p[4]));
+ l=xor(l,xor($(r,box),box.p[3]));
+ r=xor(r,xor($(l,box),box.p[2]));
+ l=xor(l,xor($(r,box),box.p[1]));
+ o.right=l;
+ o.left=xor(r,box.p[0]);
+ }
+
+ // Note that we aren't caching contexts here; it might take a little longer
+ // but we should be more secure this way.
+ function init(key){
+ var k=key;
+ if(lang.isString(k)){
+ k = arrayUtil.map(k.split(""), function(item){
+ return item.charCodeAt(0) & 0xff;
+ });
+ }
+
+ // init the boxes
+ var pos=0, data=0, res={ left:0, right:0 }, i, j, l;
+ var box = {
+ p: arrayUtil.map(boxes.p.slice(0), function(item){
+ var l=k.length, j;
+ for(j=0; j<4; j++){ data=(data*POW8)|k[pos++ % l]; }
+ return (((item>>0x10)^(data>>0x10))<<0x10)|(((item&0xffff)^(data&0xffff))&0xffff);
+ }),
+ s0:boxes.s0.slice(0),
+ s1:boxes.s1.slice(0),
+ s2:boxes.s2.slice(0),
+ s3:boxes.s3.slice(0)
+ };
+
+ // encrypt p and the s boxes
+ for(i=0, l=box.p.length; i<l;){
+ eb(res, box);
+ box.p[i++]=res.left, box.p[i++]=res.right;
+ }
+ for(i=0; i<4; i++){
+ for(j=0, l=box["s"+i].length; j<l;){
+ eb(res, box);
+ box["s"+i][j++]=res.left, box["s"+i][j++]=res.right;
+ }
+ }
+ return box;
+ }
+
+////////////////////////////////////////////////////////////////////////////
+// PUBLIC FUNCTIONS
+////////////////////////////////////////////////////////////////////////////
+ this.getIV=function(/* dojox.encoding.crypto.outputTypes? */ outputType){
+ // summary
+ // returns the initialization vector in the output format specified by outputType
+ var out=outputType||crypto.outputTypes.Base64;
+ switch(out){
+ case crypto.outputTypes.Hex:{
+ return arrayUtil.map(iv, function(item){
+ return (item<=0xf?'0':'')+item.toString(16);
+ }).join(""); // string
+ }
+ case crypto.outputTypes.String:{
+ return iv.join(""); // string
+ }
+ case crypto.outputTypes.Raw:{
+ return iv; // array
+ }
+ default:{
+ return base64.encode(iv); // string
+ }
+ }
+ };
+
+ this.setIV=function(/* string */data, /* dojox.encoding.crypto.outputTypes? */inputType){
+ // summary
+ // sets the initialization vector to data (as interpreted as inputType)
+ var ip=inputType||crypto.outputTypes.Base64;
+ var ba=null;
+ switch(ip){
+ case crypto.outputTypes.String:{
+ ba = arrayUtil.map(data.split(""), function(item){
+ return item.charCodeAt(0);
+ });
+ break;
+ }
+ case crypto.outputTypes.Hex:{
+ ba=[];
+ for(var i=0, l=data.length-1; i<l; i+=2){
+ ba.push(parseInt(data.substr(i,2), 16));
+ }
+ break;
+ }
+ case crypto.outputTypes.Raw:{
+ ba=data;
+ break;
+ }
+ default:{
+ ba=base64.decode(data);
+ break;
+ }
+ }
+ // make it a pair of words now
+ iv={};
+ iv.left=ba[0]*POW24|ba[1]*POW16|ba[2]*POW8|ba[3];
+ iv.right=ba[4]*POW24|ba[5]*POW16|ba[6]*POW8|ba[7];
+ };
+
+ this.encrypt = function(/* string */plaintext, /* string */key, /* object? */ao){
+ // summary
+ // encrypts plaintext using key; allows user to specify output type and cipher mode via keyword object "ao"
+ var out=crypto.outputTypes.Base64;
+ var mode=crypto.cipherModes.ECB;
+ if (ao){
+ if (ao.outputType) out=ao.outputType;
+ if (ao.cipherMode) mode=ao.cipherMode;
+ }
+
+ var bx = init(key), padding = 8-(plaintext.length&7);
+ for (var i=0; i<padding; i++){ plaintext+=String.fromCharCode(padding); }
+
+ var cipher=[], count=plaintext.length >> 3, pos=0, o={}, isCBC=(mode==crypto.cipherModes.CBC);
+ var vector={left:iv.left||null, right:iv.right||null};
+ for(var i=0; i<count; i++){
+ o.left=plaintext.charCodeAt(pos)*POW24
+ |plaintext.charCodeAt(pos+1)*POW16
+ |plaintext.charCodeAt(pos+2)*POW8
+ |plaintext.charCodeAt(pos+3);
+ o.right=plaintext.charCodeAt(pos+4)*POW24
+ |plaintext.charCodeAt(pos+5)*POW16
+ |plaintext.charCodeAt(pos+6)*POW8
+ |plaintext.charCodeAt(pos+7);
+
+ if(isCBC){
+ o.left=(((o.left>>0x10)^(vector.left>>0x10))<<0x10)|(((o.left&0xffff)^(vector.left&0xffff))&0xffff);
+ o.right=(((o.right>>0x10)^(vector.right>>0x10))<<0x10)|(((o.right&0xffff)^(vector.right&0xffff))&0xffff);
+ }
+
+ eb(o, bx); // encrypt the block
+
+ if(isCBC){
+ vector.left=o.left;
+ vector.right=o.right;
+ }
+
+ cipher.push((o.left>>24)&0xff);
+ cipher.push((o.left>>16)&0xff);
+ cipher.push((o.left>>8)&0xff);
+ cipher.push(o.left&0xff);
+ cipher.push((o.right>>24)&0xff);
+ cipher.push((o.right>>16)&0xff);
+ cipher.push((o.right>>8)&0xff);
+ cipher.push(o.right&0xff);
+ pos+=8;
+ }
+
+ switch(out){
+ case crypto.outputTypes.Hex:{
+ return arrayUtil.map(cipher, function(item){
+ return (item<=0xf?'0':'')+item.toString(16);
+ }).join(""); // string
+ }
+ case crypto.outputTypes.String:{
+ return cipher.join(""); // string
+ }
+ case crypto.outputTypes.Raw:{
+ return cipher; // array
+ }
+ default:{
+ return base64.encode(cipher); // string
+ }
+ }
+ };
+
+ this.decrypt = function(/* string */ciphertext, /* string */key, /* object? */ao){
+ // summary
+ // decrypts ciphertext using key; allows specification of how ciphertext is encoded via ao.
+ var ip=crypto.outputTypes.Base64;
+ var mode=crypto.cipherModes.ECB;
+ if (ao){
+ if (ao.outputType) ip=ao.outputType;
+ if (ao.cipherMode) mode=ao.cipherMode;
+ }
+ var bx = init(key);
+ var pt=[];
+
+ var c=null;
+ switch(ip){
+ case crypto.outputTypes.Hex:{
+ c = [];
+ for(var i=0, l=ciphertext.length-1; i<l; i+=2){
+ c.push(parseInt(ciphertext.substr(i,2), 16));
+ }
+ break;
+ }
+ case crypto.outputTypes.String:{
+ c = arrayUtil.map(ciphertext.split(""), function(item){
+ return item.charCodeAt(0);
+ });
+ break;
+ }
+ case crypto.outputTypes.Raw:{
+ c=ciphertext; // should be a byte array
+ break;
+ }
+ default:{
+ c=base64.decode(ciphertext);
+ break;
+ }
+ }
+
+ var count=c.length >> 3, pos=0, o={}, isCBC=(mode==crypto.cipherModes.CBC);
+ var vector={left:iv.left||null, right:iv.right||null};
+ for(var i=0; i<count; i++){
+ o.left=c[pos]*POW24|c[pos+1]*POW16|c[pos+2]*POW8|c[pos+3];
+ o.right=c[pos+4]*POW24|c[pos+5]*POW16|c[pos+6]*POW8|c[pos+7];
+
+ if(isCBC){
+ var left=o.left;
+ var right=o.right;
+ }
+
+ db(o, bx); // decrypt the block
+
+ if(isCBC){
+ o.left=(((o.left>>0x10)^(vector.left>>0x10))<<0x10)|(((o.left&0xffff)^(vector.left&0xffff))&0xffff);
+ o.right=(((o.right>>0x10)^(vector.right>>0x10))<<0x10)|(((o.right&0xffff)^(vector.right&0xffff))&0xffff);
+ vector.left=left;
+ vector.right=right;
+ }
+
+ pt.push((o.left>>24)&0xff);
+ pt.push((o.left>>16)&0xff);
+ pt.push((o.left>>8)&0xff);
+ pt.push(o.left&0xff);
+ pt.push((o.right>>24)&0xff);
+ pt.push((o.right>>16)&0xff);
+ pt.push((o.right>>8)&0xff);
+ pt.push(o.right&0xff);
+ pos+=8;
+ }
+
+ // check for padding, and remove.
+ if(pt[pt.length-1]==pt[pt.length-2]||pt[pt.length-1]==0x01){
+ var n=pt[pt.length-1];
+ pt.splice(pt.length-n, n);
+ }
+
+ // convert to string
+ return arrayUtil.map(pt, function(item){
+ return String.fromCharCode(item);
+ }).join(""); // string
+ };
+
+ this.setIV("0000000000000000", crypto.outputTypes.Hex);
+}();
+
+
+return crypto.Blowfish;
+});
diff --git a/js/dojo-1.7.2/dojox/encoding/crypto/RSAKey-ext.js b/js/dojo-1.7.2/dojox/encoding/crypto/RSAKey-ext.js
new file mode 100644
index 0000000..6ffe9f5
--- /dev/null
+++ b/js/dojo-1.7.2/dojox/encoding/crypto/RSAKey-ext.js
@@ -0,0 +1,123 @@
+//>>built
+define("dojox/encoding/crypto/RSAKey-ext", [
+ "dojo/_base/kernel", // dojo.experimental
+ "dojo/_base/lang", // dojo.extend
+ "./RSAKey",
+ "../../math/BigInteger-ext"
+], function(kernel, lang, RSAKey, BigInteger) {
+
+ kernel.experimental("dojox.encoding.crypto.RSAKey-ext");
+
+ // Undo PKCS#1 (type 2, random) padding and, if valid, return the plaintext
+ function pkcs1unpad2(d, n){
+ var b = d.toByteArray();
+ for(var i = 0, len = b.length; i < len && !b[i]; ++i);
+ if(b.length - i !== n - 1 || b[i] !== 2){
+ return null;
+ }
+ for(++i; b[i];){
+ if(++i >= len){
+ return null;
+ }
+ }
+ var ret = "";
+ while(++i < len){
+ ret += String.fromCharCode(b[i]);
+ }
+ return ret;
+ }
+
+ lang.extend(RSAKey, {
+ setPrivate: function(N, E, D){
+ // summary:
+ // Set the private key fields N, e, d and CRT params from hex strings
+ if(N && E && N.length && E.length){
+ this.n = new BigInteger(N, 16);
+ this.e = parseInt(E, 16);
+ this.d = new BigInteger(D, 16);
+ }else{
+ throw new Error("Invalid RSA private key");
+ }
+ },
+ setPrivateEx: function(N, E, D, P, Q, DP, DQ, C) {
+ // summary:
+ // Set the private key fields N, e, d and CRT params from hex strings
+ if(N && E && N.length && E.length){
+ this.n = new BigInteger(N, 16);
+ this.e = parseInt(E, 16);
+ this.d = new BigInteger(D, 16);
+ this.p = new BigInteger(P, 16);
+ this.q = new BigInteger(Q, 16);
+ this.dmp1 = new BigInteger(DP, 16);
+ this.dmq1 = new BigInteger(DQ, 16);
+ this.coeff = new BigInteger(C, 16);
+ }else{
+ throw new Error("Invalid RSA private key");
+ }
+ },
+ generate: function(B, E){
+ // summary:
+ // Generate a new random private key B bits long, using public expt E
+ var rng = this.rngf(), qs = B >> 1;
+ this.e = parseInt(E, 16);
+ var ee = new BigInteger(E, 16);
+ for(;;) {
+ for(;;) {
+ this.p = new BigInteger(B - qs, 1, rng);
+ if(!this.p.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) && this.p.isProbablePrime(10)){
+ break;
+ }
+ }
+ for(;;) {
+ this.q = new BigInteger(qs, 1, rng);
+ if(!this.q.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) && this.q.isProbablePrime(10)){
+ break;
+ }
+ }
+ if(this.p.compareTo(this.q) <= 0) {
+ var t = this.p;
+ this.p = this.q;
+ this.q = t;
+ }
+ var p1 = this.p.subtract(BigInteger.ONE);
+ var q1 = this.q.subtract(BigInteger.ONE);
+ var phi = p1.multiply(q1);
+ if(!phi.gcd(ee).compareTo(BigInteger.ONE)) {
+ this.n = this.p.multiply(this.q);
+ this.d = ee.modInverse(phi);
+ this.dmp1 = this.d.mod(p1);
+ this.dmq1 = this.d.mod(q1);
+ this.coeff = this.q.modInverse(this.p);
+ break;
+ }
+ }
+ rng.destroy();
+ },
+
+ decrypt: function(ctext){
+ // summary:
+ // Return the PKCS#1 RSA decryption of "ctext".
+ // ctext: String:
+ // an even-length hex string
+ // returns: a plain string.
+ var c = new BigInteger(ctext, 16), m;
+ if(!this.p || !this.q){
+ m = c.modPow(this.d, this.n);
+ }else{
+ // TODO: re-calculate any missing CRT params
+ var cp = c.mod(this.p).modPow(this.dmp1, this.p),
+ cq = c.mod(this.q).modPow(this.dmq1, this.q);
+ while(cp.compareTo(cq) < 0){
+ cp = cp.add(this.p);
+ }
+ m = cp.subtract(cq).multiply(this.coeff).mod(this.p).multiply(this.q).add(cq);
+ }
+ if(!m){
+ return null;
+ }
+ return pkcs1unpad2(m, (this.n.bitLength() + 7) >> 3);
+ }
+ });
+
+ return RSAKey;
+});
diff --git a/js/dojo-1.7.2/dojox/encoding/crypto/RSAKey.js b/js/dojo-1.7.2/dojox/encoding/crypto/RSAKey.js
new file mode 100644
index 0000000..be1707c
--- /dev/null
+++ b/js/dojo-1.7.2/dojox/encoding/crypto/RSAKey.js
@@ -0,0 +1,75 @@
+//>>built
+define("dojox/encoding/crypto/RSAKey", [
+ "dojo/_base/kernel",
+ "dojo/_base/declare",
+ "../../math/BigInteger",
+ "../../math/random/Simple"
+], function(kernel, declare, BigInteger, Simple) {
+
+ kernel.experimental("dojox.encoding.crypto.RSAKey");
+
+// Copyright (c) 2005 Tom Wu
+// All Rights Reserved.
+// See "LICENSE-BigInteger" in dojox.math for details.
+
+ var defaultRngf = function(){ return new Simple(); };
+
+ // PKCS#1 (type 2, random) pad input string s to n bytes, and return a bigint
+ function pkcs1pad2(s, n, rngf) {
+ if(n < s.length + 11) {
+ throw new Error("Message too long for RSA");
+ }
+ var ba = new Array(n);
+ var i = s.length;
+ while(i && n) ba[--n] = s.charCodeAt(--i);
+ ba[--n] = 0;
+ var rng = rngf();
+ var x = [0];
+ while(n > 2) { // random non-zero pad
+ x[0] = 0;
+ while(x[0] == 0) rng.nextBytes(x);
+ ba[--n] = x[0];
+ }
+ ba[--n] = 2;
+ ba[--n] = 0;
+ rng.destroy();
+ return new BigInteger(ba);
+ }
+
+ return declare("dojox.encoding.crypto.RSAKey", null, {
+ constructor: function(rngf){
+ // summary:
+ // "empty" RSA key constructor
+ // rndf: Function?:
+ // function that returns an instance of a random number generator
+ // (see dojox.math.random for details)
+ this.rngf = rngf || defaultRngf;
+ this.e = 0;
+ this.n = this.d = this.p = this.q = this.dmp1 = this.dmq1 = this.coeff = null;
+ },
+
+ setPublic: function(N, E){
+ // summary:
+ // Set the public key fields N and e from hex strings
+ if(N && E && N.length && E.length) {
+ this.n = new BigInteger(N, 16);
+ this.e = parseInt(E, 16);
+ }else{
+ throw new Error("Invalid RSA public key");
+ }
+ },
+
+ encrypt: function(text){
+ var m = pkcs1pad2(text, (this.n.bitLength() + 7) >> 3, this.rngf);
+ if(!m){
+ return null;
+ }
+ var c = m.modPowInt(this.e, this.n);
+ if(!c){
+ return null;
+ }
+ var h = c.toString(16);
+ return h.length % 2 ? "0" + h : h;
+ }
+ });
+});
diff --git a/js/dojo-1.7.2/dojox/encoding/crypto/SimpleAES.js b/js/dojo-1.7.2/dojox/encoding/crypto/SimpleAES.js
new file mode 100644
index 0000000..951b8a5
--- /dev/null
+++ b/js/dojo-1.7.2/dojox/encoding/crypto/SimpleAES.js
@@ -0,0 +1,339 @@
+//>>built
+define("dojox/encoding/crypto/SimpleAES", ["../base64", "./_base"],
+ function(base64, crypto){
+
+ /*=====
+ crypto = dojox.encoding.crypto;
+ =====*/
+
+ // Sbox is pre-computed multiplicative inverse in GF(2^8) used in SubBytes and KeyExpansion [��5.1.1]
+ var 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]
+ var 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] ];
+
+ /*
+ * AES Cipher function: encrypt 'input' with Rijndael algorithm
+ *
+ * takes byte-array 'input' (16 bytes)
+ * 2D byte-array key schedule 'w' (Nr+1 x Nb bytes)
+ *
+ * applies Nr rounds (10/12/14) using key schedule w for 'add round key' stage
+ *
+ * returns byte-array encrypted value (16 bytes)
+ */
+ function Cipher(input, w) { // main Cipher function [��5.1]
+ var Nb = 4; // block size (in words): no of columns in state (fixed at 4 for AES)
+ var Nr = w.length/Nb - 1; // no of rounds: 10/12/14 for 128/192/256-bit keys
+
+ var state = [[],[],[],[]]; // initialise 4xNb byte-array 'state' with input [��3.4]
+ for (var i=0; i<4*Nb; i++) state[i%4][Math.floor(i/4)] = input[i];
+
+ state = AddRoundKey(state, w, 0, Nb);
+
+ for (var round=1; round<Nr; round++) {
+ state = SubBytes(state, Nb);
+ state = ShiftRows(state, Nb);
+ state = MixColumns(state, Nb);
+ state = AddRoundKey(state, w, round, Nb);
+ }
+
+ state = SubBytes(state, Nb);
+ state = ShiftRows(state, Nb);
+ state = AddRoundKey(state, w, Nr, Nb);
+
+ var output = new Array(4*Nb); // convert state to 1-d array before returning [��3.4]
+ for (var i=0; i<4*Nb; i++) output[i] = state[i%4][Math.floor(i/4)];
+ return output;
+ }
+
+
+ function SubBytes(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] = Sbox[s[r][c]];
+ }
+ return s;
+ }
+
+
+ function ShiftRows(s, Nb) { // shift row r of state S left by r bytes [��5.1.2]
+ var t = new Array(4);
+ for (var r=1; r<4; r++) {
+ for (var c=0; c<4; c++) t[c] = s[r][(c+r)%Nb]; // shift into temp copy
+ for (var c=0; c<4; c++) s[r][c] = t[c]; // and copy back
+ } // note that this will work for Nb=4,5,6, but not 7,8 (always 4 for AES):
+ return s; // see fp.gladman.plus.com/cryptography_technology/rijndael/aes.spec.311.pdf
+ }
+
+
+ function MixColumns(s, Nb) { // combine bytes of each col of state S [��5.1.3]
+ for (var c=0; c<4; c++) {
+ var a = new Array(4); // 'a' is a copy of the current column from 's'
+ var b = new Array(4); // 'b' is a�ށ{02} in GF(2^8)
+ 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;
+ }
+ // a[n] ^ b[n] is a�ށ{03} in GF(2^8)
+ s[0][c] = b[0] ^ a[1] ^ b[1] ^ a[2] ^ a[3]; // 2*a0 + 3*a1 + a2 + a3
+ s[1][c] = a[0] ^ b[1] ^ a[2] ^ b[2] ^ a[3]; // a0 * 2*a1 + 3*a2 + a3
+ s[2][c] = a[0] ^ a[1] ^ b[2] ^ a[3] ^ b[3]; // a0 + a1 + 2*a2 + 3*a3
+ s[3][c] = a[0] ^ b[0] ^ a[1] ^ a[2] ^ b[3]; // 3*a0 + a1 + a2 + 2*a3
+ }
+ return s;
+ }
+
+
+ function AddRoundKey(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];
+ }
+ return state;
+ }
+
+
+ function KeyExpansion(key) { // generate Key Schedule (byte-array Nr+1 x Nb) from Key [��5.2]
+ var Nb = 4; // block size (in words): no of columns in state (fixed at 4 for AES)
+ var Nk = key.length/4 // key length (in words): 4/6/8 for 128/192/256-bit keys
+ var Nr = Nk + 6; // no of rounds: 10/12/14 for 128/192/256-bit keys
+
+ var w = new Array(Nb*(Nr+1));
+ 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 (var i=Nk; i<(Nb*(Nr+1)); i++) {
+ w[i] = new Array(4);
+ for (var t=0; t<4; t++) temp[t] = w[i-1][t];
+ if (i % Nk == 0) {
+ temp = SubWord(RotWord(temp));
+ for (var t=0; t<4; t++) temp[t] ^= Rcon[i/Nk][t];
+ } else if (Nk > 6 && i%Nk == 4) {
+ temp = SubWord(temp);
+ }
+ for (var t=0; t<4; t++) w[i][t] = w[i-Nk][t] ^ temp[t];
+ }
+
+ return w;
+ }
+
+ function SubWord(w) { // apply SBox to 4-byte word w
+ for (var i=0; i<4; i++) w[i] = Sbox[w[i]];
+ return w;
+ }
+
+ function RotWord(w) { // rotate 4-byte word w left by one byte
+ w[4] = w[0];
+ for (var i=0; i<4; i++) w[i] = w[i+1];
+ return w;
+ }
+
+ /* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
+
+ /*
+ * Use AES to encrypt 'plaintext' with 'password' using 'nBits' key, in 'Counter' mode of operation
+ * - see http://csrc.nist.gov/publications/nistpubs/800-38a/sp800-38a.pdf
+ * for each block
+ * - outputblock = cipher(counter, key)
+ * - cipherblock = plaintext xor outputblock
+ */
+ function AESEncryptCtr(plaintext, password, nBits) {
+ if (!(nBits==128 || nBits==192 || nBits==256)) return ''; // standard allows 128/192/256 bit keys
+
+ // for this example script, generate the key by applying Cipher to 1st 16/24/32 chars of password;
+ // for real-world applications, a more secure approach would be to hash the password e.g. with SHA-1
+ var nBytes = nBits/8; // no bytes in key
+ var pwBytes = new Array(nBytes);
+ for (var i=0; i<nBytes; i++) pwBytes[i] = password.charCodeAt(i) & 0xff;
+
+ var key = Cipher(pwBytes, KeyExpansion(pwBytes));
+
+ key = key.concat(key.slice(0, nBytes-16)); // key is now 16/24/32 bytes long
+
+ // initialise counter block (NIST SP800-38A ��B.2): millisecond time-stamp for nonce in 1st 8 bytes,
+ // block counter in 2nd 8 bytes
+ var blockSize = 16; // block size fixed at 16 bytes / 128 bits (Nb=4) for AES
+ var counterBlock = new Array(blockSize); // block size fixed at 16 bytes / 128 bits (Nb=4) for AES
+ var nonce = (new Date()).getTime(); // milliseconds since 1-Jan-1970
+
+ // encode nonce in two stages to cater for JavaScript 32-bit limit on bitwise ops
+ for (var i=0; i<4; i++) counterBlock[i] = (nonce >>> i*8) & 0xff;
+ for (var i=0; i<4; i++) counterBlock[i+4] = (nonce/0x100000000 >>> i*8) & 0xff;
+
+ // generate key schedule - an expansion of the key into distinct Key Rounds for each round
+ var keySchedule = KeyExpansion(key);
+
+ var blockCount = Math.ceil(plaintext.length/blockSize);
+ var ciphertext = new Array(blockCount); // ciphertext as array of strings
+
+ for (var b=0; b<blockCount; b++) {
+ // set counter (block #) in last 8 bytes of counter block (leaving nonce in 1st 8 bytes)
+ // again done in two stages for 32-bit ops
+ for (var c=0; c<4; c++) counterBlock[15-c] = (b >>> c*8) & 0xff;
+ for (var c=0; c<4; c++) counterBlock[15-c-4] = (b/0x100000000 >>> c*8)
+
+ var cipherCntr = Cipher(counterBlock, keySchedule); // -- encrypt counter block --
+
+ // calculate length of final block:
+ var blockLength = b<blockCount-1 ? blockSize : (plaintext.length-1)%blockSize+1;
+
+ var ct = '';
+ for (var i=0; i<blockLength; i++) { // -- xor plaintext with ciphered counter byte-by-byte --
+ var plaintextByte = plaintext.charCodeAt(b*blockSize+i);
+ var cipherByte = plaintextByte ^ cipherCntr[i];
+ //ct += String.fromCharCode(cipherByte);
+ ct += ((cipherByte < 16) ? "0" : "") + cipherByte.toString(16);
+ }
+ // ct is now ciphertext for this block
+
+ ciphertext[b] = ct; // escCtrlChars(ct); // escape troublesome characters in ciphertext
+ }
+
+ // convert the nonce to a string to go on the front of the ciphertext
+ var ctrTxt = '';
+ for (var i=0; i<8; i++) ctrTxt += ((counterBlock[i] < 16) ? "0" : "") + counterBlock[i].toString(16); //String.fromCharCode(counterBlock[i]);
+ //ctrTxt = escCtrlChars(ctrTxt);
+
+ // use '-' to separate blocks, use Array.join to concatenate arrays of strings for efficiency
+ return ctrTxt + ' ' + ciphertext.join(' ');
+ }
+
+ function stringToHex(s){
+ var ret = [];
+ s.replace(/(..)/g, function(str){
+ ret.push(parseInt(str, 16));
+ });
+ return ret;
+ }
+
+ /*
+ * Use AES to decrypt 'ciphertext' with 'password' using 'nBits' key, in Counter mode of operation
+ *
+ * for each block
+ * - outputblock = cipher(counter, key)
+ * - cipherblock = plaintext xor outputblock
+ */
+ function AESDecryptCtr(ciphertext, password, nBits) {
+ if (!(nBits==128 || nBits==192 || nBits==256)) return ''; // standard allows 128/192/256 bit keys
+
+ var nBytes = nBits/8; // no bytes in key
+ var pwBytes = new Array(nBytes);
+ for (var i=0; i<nBytes; i++) pwBytes[i] = password.charCodeAt(i) & 0xff;
+ var pwKeySchedule = KeyExpansion(pwBytes);
+ var key = Cipher(pwBytes, pwKeySchedule);
+ key = key.concat(key.slice(0, nBytes-16)); // key is now 16/24/32 bytes long
+
+ var keySchedule = KeyExpansion(key);
+
+ ciphertext = ciphertext.split(' '); // split ciphertext into array of block-length strings
+
+ // recover nonce from 1st element of ciphertext
+ var blockSize = 16; // block size fixed at 16 bytes / 128 bits (Nb=4) for AES
+ var counterBlock = new Array(blockSize);
+ var ctrTxt = ciphertext[0]; //unescCtrlChars(ciphertext[0]);
+ counterBlock = stringToHex(ctrTxt);
+
+ var plaintext = new Array(ciphertext.length-1);
+
+ for (var b=1; b<ciphertext.length; 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-1) >>> c*8) & 0xff;
+ for (var c=0; c<4; c++) counterBlock[15-c-4] = ((b/0x100000000-1) >>> c*8) & 0xff;
+
+ var cipherCntr = Cipher(counterBlock, keySchedule); // encrypt counter block
+
+ //ciphertext[b] = ciphertext[b]; //unescCtrlChars(ciphertext[b]);
+
+ var pt = '';
+ var tmp = stringToHex(ciphertext[b]);
+ for (var i=0; i<tmp.length; i++) {
+ // -- xor plaintext with ciphered counter byte-by-byte --
+ var ciphertextByte = ciphertext[b].charCodeAt(i);
+ var plaintextByte = tmp[i] ^ cipherCntr[i];
+ pt += String.fromCharCode(plaintextByte);
+ }
+ // pt is now plaintext for this block
+
+ plaintext[b-1] = pt; // b-1 'cos no initial nonce block in plaintext
+ }
+
+ return plaintext.join('');
+ }
+
+ /* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
+
+ function escCtrlChars(str) { // escape control chars which might cause problems handling ciphertext
+ return str.replace(/[\0\t\n\v\f\r\xa0!-]/g, function(c) { return '!' + c.charCodeAt(0) + '!'; });
+ } // \xa0 to cater for bug in Firefox; include '-' to leave it free for use as a block marker
+
+ function unescCtrlChars(str) { // unescape potentially problematic control characters
+ return str.replace(/!\d\d?\d?!/g, function(c) { return String.fromCharCode(c.slice(1,-1)); });
+ }
+
+ /* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
+
+ crypto.SimpleAES = new (function(){
+ // summary:
+ // SimpleAES, ported from dojox.sql, and done without the need for
+ // a Google Gears worker pool.
+ // description:
+ // Taken from http://www.movable-type.co.uk/scripts/aes.html by
+ // Chris Veness (CLA signed); adapted for Dojo by Brad Neuberg
+ // (bkn3 AT columbia.edu) and moved to DojoX crypto by Tom Trenka
+ // (ttrenka AT gmail.com).
+ //
+ // A few notes:
+ // 1) This algorithm uses a customized version of CBC mode by creating
+ // a nonce, using it as an initialization vector, and storing the
+ // IV as the first portion of the encrypted text. Because of this, it
+ // is HIGHLY PROBABLE that it will NOT be usable by other AES implementations.
+ // 2) All encoding is done in hex format; other encoding formats (such
+ // as base 64) are not supported.
+ // 3) The bit depth of the key is hardcoded at 256, despite the ability
+ // of the code to handle all three recommended bit depths.
+ // 4) The passed key will be padded (as opposed to enforcing a strict
+ // length) with null bytes.
+ this.encrypt = function(/* String */plaintext, /* String */key){
+ // summary:
+ // Encrypt the passed plaintext using the key, with a
+ // hardcoded bit depth of 256.
+ return AESEncryptCtr(plaintext, key, 256); // String
+ };
+ this.decrypt = function(/* String */ciphertext, /* String */key){
+ // summary:
+ // Decrypt the passed ciphertext using the key at a fixed
+ // bit depth of 256.
+ return AESDecryptCtr(ciphertext, key, 256); // String
+ };
+ })();
+
+ return crypto.SimpleAES;
+});
diff --git a/js/dojo-1.7.2/dojox/encoding/crypto/_base.js b/js/dojo-1.7.2/dojox/encoding/crypto/_base.js
new file mode 100644
index 0000000..04de1ea
--- /dev/null
+++ b/js/dojo-1.7.2/dojox/encoding/crypto/_base.js
@@ -0,0 +1,21 @@
+//>>built
+define("dojox/encoding/crypto/_base", ["dojo/_base/lang"], function(lang) {
+
+ var c = lang.getObject("dojox.encoding.crypto", true);
+ /*=====
+ c = dojox.encoding.crypto;
+ =====*/
+
+ c.cipherModes = {
+ // summary:
+ // Enumeration for various cipher modes.
+ ECB:0, CBC:1, PCBC:2, CFB:3, OFB:4, CTR:5
+ };
+ c.outputTypes = {
+ // summary:
+ // Enumeration for input and output encodings.
+ Base64:0, Hex:1, String:2, Raw:3
+ };
+
+ return c;
+});
diff --git a/js/dojo-1.7.2/dojox/encoding/digests/MD5.js b/js/dojo-1.7.2/dojox/encoding/digests/MD5.js
new file mode 100644
index 0000000..feaf095
--- /dev/null
+++ b/js/dojo-1.7.2/dojox/encoding/digests/MD5.js
@@ -0,0 +1,177 @@
+//>>built
+define("dojox/encoding/digests/MD5", ["./_base"], function(dxd) {
+
+ /*=====
+ dxd = dojox.encoding.digests;
+ =====*/
+
+/* A port of Paul Johnstone's MD5 implementation
+ * http://pajhome.org.uk/crypt/md5/index.html
+ *
+ * Copyright (C) Paul Johnston 1999 - 2002.
+ * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
+ * Distributed under the BSD License
+ *
+ * Dojo port by Tom Trenka
+ */
+
+ var chrsz=8;
+
+ // MD5 rounds functions
+ function R(n,c){ return (n<<c)|(n>>>(32-c)); }
+ function C(q,a,b,x,s,t){ return dxd.addWords(R(dxd.addWords(dxd.addWords(a, q), dxd.addWords(x, t)), s), b); }
+ function FF(a,b,c,d,x,s,t){ return C((b&c)|((~b)&d),a,b,x,s,t); }
+ function GG(a,b,c,d,x,s,t){ return C((b&d)|(c&(~d)),a,b,x,s,t); }
+ function HH(a,b,c,d,x,s,t){ return C(b^c^d,a,b,x,s,t); }
+ function II(a,b,c,d,x,s,t){ return C(c^(b|(~d)),a,b,x,s,t); }
+
+ // the core MD5 rounds method
+ function core(x,len){
+ x[len>>5]|=0x80<<((len)%32);
+ x[(((len+64)>>>9)<<4)+14]=len;
+ var a= 1732584193;
+ var b=-271733879;
+ var c=-1732584194;
+ var d= 271733878;
+ for(var i=0; i<x.length; i+=16){
+ var olda=a;
+ var oldb=b;
+ var oldc=c;
+ var oldd=d;
+
+ a=FF(a,b,c,d,x[i+ 0],7 ,-680876936);
+ d=FF(d,a,b,c,x[i+ 1],12,-389564586);
+ c=FF(c,d,a,b,x[i+ 2],17, 606105819);
+ b=FF(b,c,d,a,x[i+ 3],22,-1044525330);
+ a=FF(a,b,c,d,x[i+ 4],7 ,-176418897);
+ d=FF(d,a,b,c,x[i+ 5],12, 1200080426);
+ c=FF(c,d,a,b,x[i+ 6],17,-1473231341);
+ b=FF(b,c,d,a,x[i+ 7],22,-45705983);
+ a=FF(a,b,c,d,x[i+ 8],7 , 1770035416);
+ d=FF(d,a,b,c,x[i+ 9],12,-1958414417);
+ c=FF(c,d,a,b,x[i+10],17,-42063);
+ b=FF(b,c,d,a,x[i+11],22,-1990404162);
+ a=FF(a,b,c,d,x[i+12],7 , 1804603682);
+ d=FF(d,a,b,c,x[i+13],12,-40341101);
+ c=FF(c,d,a,b,x[i+14],17,-1502002290);
+ b=FF(b,c,d,a,x[i+15],22, 1236535329);
+
+ a=GG(a,b,c,d,x[i+ 1],5 ,-165796510);
+ d=GG(d,a,b,c,x[i+ 6],9 ,-1069501632);
+ c=GG(c,d,a,b,x[i+11],14, 643717713);
+ b=GG(b,c,d,a,x[i+ 0],20,-373897302);
+ a=GG(a,b,c,d,x[i+ 5],5 ,-701558691);
+ d=GG(d,a,b,c,x[i+10],9 , 38016083);
+ c=GG(c,d,a,b,x[i+15],14,-660478335);
+ b=GG(b,c,d,a,x[i+ 4],20,-405537848);
+ a=GG(a,b,c,d,x[i+ 9],5 , 568446438);
+ d=GG(d,a,b,c,x[i+14],9 ,-1019803690);
+ c=GG(c,d,a,b,x[i+ 3],14,-187363961);
+ b=GG(b,c,d,a,x[i+ 8],20, 1163531501);
+ a=GG(a,b,c,d,x[i+13],5 ,-1444681467);
+ d=GG(d,a,b,c,x[i+ 2],9 ,-51403784);
+ c=GG(c,d,a,b,x[i+ 7],14, 1735328473);
+ b=GG(b,c,d,a,x[i+12],20,-1926607734);
+
+ a=HH(a,b,c,d,x[i+ 5],4 ,-378558);
+ d=HH(d,a,b,c,x[i+ 8],11,-2022574463);
+ c=HH(c,d,a,b,x[i+11],16, 1839030562);
+ b=HH(b,c,d,a,x[i+14],23,-35309556);
+ a=HH(a,b,c,d,x[i+ 1],4 ,-1530992060);
+ d=HH(d,a,b,c,x[i+ 4],11, 1272893353);
+ c=HH(c,d,a,b,x[i+ 7],16,-155497632);
+ b=HH(b,c,d,a,x[i+10],23,-1094730640);
+ a=HH(a,b,c,d,x[i+13],4 , 681279174);
+ d=HH(d,a,b,c,x[i+ 0],11,-358537222);
+ c=HH(c,d,a,b,x[i+ 3],16,-722521979);
+ b=HH(b,c,d,a,x[i+ 6],23, 76029189);
+ a=HH(a,b,c,d,x[i+ 9],4 ,-640364487);
+ d=HH(d,a,b,c,x[i+12],11,-421815835);
+ c=HH(c,d,a,b,x[i+15],16, 530742520);
+ b=HH(b,c,d,a,x[i+ 2],23,-995338651);
+
+ a=II(a,b,c,d,x[i+ 0],6 ,-198630844);
+ d=II(d,a,b,c,x[i+ 7],10, 1126891415);
+ c=II(c,d,a,b,x[i+14],15,-1416354905);
+ b=II(b,c,d,a,x[i+ 5],21,-57434055);
+ a=II(a,b,c,d,x[i+12],6 , 1700485571);
+ d=II(d,a,b,c,x[i+ 3],10,-1894986606);
+ c=II(c,d,a,b,x[i+10],15,-1051523);
+ b=II(b,c,d,a,x[i+ 1],21,-2054922799);
+ a=II(a,b,c,d,x[i+ 8],6 , 1873313359);
+ d=II(d,a,b,c,x[i+15],10,-30611744);
+ c=II(c,d,a,b,x[i+ 6],15,-1560198380);
+ b=II(b,c,d,a,x[i+13],21, 1309151649);
+ a=II(a,b,c,d,x[i+ 4],6 ,-145523070);
+ d=II(d,a,b,c,x[i+11],10,-1120210379);
+ c=II(c,d,a,b,x[i+ 2],15, 718787259);
+ b=II(b,c,d,a,x[i+ 9],21,-343485551);
+
+ a=dxd.addWords(a, olda);
+ b=dxd.addWords(b, oldb);
+ c=dxd.addWords(c, oldc);
+ d=dxd.addWords(d, oldd);
+ }
+ return [a,b,c,d];
+ }
+
+ function hmac(data, key){
+ var wa=dxd.stringToWord(key);
+ if(wa.length>16){
+ wa=core(wa, key.length*chrsz);
+ }
+ var l=[], r=[];
+ for(var i=0; i<16; i++){
+ l[i]=wa[i]^0x36363636;
+ r[i]=wa[i]^0x5c5c5c5c;
+ }
+ var h=core(l.concat(dxd.stringToWord(data)), 512+data.length*chrsz);
+ return core(r.concat(h), 640);
+ }
+
+ // public function
+ dxd.MD5=function(/* string */data, /* dojox.encoding.digests.outputTypes? */outputType){
+ // summary
+ // computes the digest of data, and returns the result according to type outputType
+ var out=outputType || dxd.outputTypes.Base64;
+ var wa=core(dxd.stringToWord(data), data.length*chrsz);
+ switch(out){
+ case dxd.outputTypes.Raw:{
+ return wa; // word[]
+ }
+ case dxd.outputTypes.Hex:{
+ return dxd.wordToHex(wa); // string
+ }
+ case dxd.outputTypes.String:{
+ return dxd.wordToString(wa); // string
+ }
+ default:{
+ return dxd.wordToBase64(wa); // string
+ }
+ }
+ };
+
+ // make this private, for later use with a generic HMAC calculator.
+ dxd.MD5._hmac=function(/* string */data, /* string */key, /* dojox.encoding.digests.outputTypes? */outputType){
+ // summary
+ // computes the digest of data, and returns the result according to type outputType
+ var out=outputType || dxd.outputTypes.Base64;
+ var wa=hmac(data, key);
+ switch(out){
+ case dxd.outputTypes.Raw:{
+ return wa; // word[]
+ }
+ case dxd.outputTypes.Hex:{
+ return dxd.wordToHex(wa); // string
+ }
+ case dxd.outputTypes.String:{
+ return dxd.wordToString(wa); // string
+ }
+ default:{
+ return dxd.wordToBase64(wa); // string
+ }
+ }
+ };
+
+ return dxd.MD5;
+});
diff --git a/js/dojo-1.7.2/dojox/encoding/digests/SHA1.js b/js/dojo-1.7.2/dojox/encoding/digests/SHA1.js
new file mode 100644
index 0000000..760f471
--- /dev/null
+++ b/js/dojo-1.7.2/dojox/encoding/digests/SHA1.js
@@ -0,0 +1,155 @@
+//>>built
+define("dojox/encoding/digests/SHA1", ["./_base"], function(dxd) {
+
+ /*=====
+ dxd = dojox.encoding.digests;
+ =====*/
+
+/*
+ * A port of Paul Johnstone's SHA1 implementation
+ *
+ * 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.
+ *
+ * Dojo port by Tom Trenka
+ */
+
+ var chrsz=8, // change to 16 for unicode.
+ mask=(1<<chrsz)-1;
+
+ function R(n,c){ return (n<<c)|(n>>>(32-c)); }
+ function 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;
+ }
+ function KT(t){ return (t<20)?1518500249:(t<40)?1859775393:(t<60)?-1894007588:-899497514; }
+
+ function core(x,len){
+ x[len>>5]|=0x80<<(24-len%32);
+ x[((len+64>>9)<<4)+15]=len;
+
+ var w=new Array(80), a=1732584193, b=-271733879, c=-1732584194, d=271733878, e=-1009589776;
+ for(var i=0; i<x.length; i+=16){
+ var olda=a, oldb=b, oldc=c, oldd=d, olde=e;
+ for(var j=0;j<80;j++){
+ if(j<16){ w[j]=x[i+j]; }
+ else { w[j]=R(w[j-3]^w[j-8]^w[j-14]^w[j-16],1); }
+ var t = dxd.addWords(dxd.addWords(R(a,5),FT(j,b,c,d)),dxd.addWords(dxd.addWords(e,w[j]),KT(j)));
+ e=d; d=c; c=R(b,30); b=a; a=t;
+ }
+ a=dxd.addWords(a,olda);
+ b=dxd.addWords(b,oldb);
+ c=dxd.addWords(c,oldc);
+ d=dxd.addWords(d,oldd);
+ e=dxd.addWords(e,olde);
+ }
+ return [a, b, c, d, e];
+ }
+
+ function hmac(data, key){
+ var wa=toWord(key);
+ if(wa.length>16){ wa=core(wa, key.length*chrsz); }
+
+ var ipad=new Array(16), opad=new Array(16);
+ for(var i=0;i<16;i++){
+ ipad[i]=wa[i]^0x36363636;
+ opad[i]=wa[i]^0x5c5c5c5c;
+ }
+
+ var hash=core(ipad.concat(toWord(data)),512+data.length*chrsz);
+ return core(opad.concat(hash), 512+160);
+ }
+
+ function toWord(s){
+ var wa=[];
+ for(var i=0, l=s.length*chrsz; i<l; i+=chrsz){
+ wa[i>>5]|=(s.charCodeAt(i/chrsz)&mask)<<(32-chrsz-i%32);
+ }
+ return wa; // word[]
+ }
+
+ function toHex(wa){
+ // slightly different than the common one.
+ var h="0123456789abcdef", s=[];
+ for(var i=0, l=wa.length*4; i<l; i++){
+ s.push(h.charAt((wa[i>>2]>>((3-i%4)*8+4))&0xF), h.charAt((wa[i>>2]>>((3-i%4)*8))&0xF));
+ }
+ return s.join(""); // string
+ }
+
+ function _toString(wa){
+ var s=[];
+ for(var i=0, l=wa.length*32; i<l; i+=chrsz){
+ s.push(String.fromCharCode((wa[i>>5]>>>(32-chrsz-i%32))&mask));
+ }
+ return s.join(""); // string
+ }
+
+ function toBase64(/* word[] */wa){
+ // summary:
+ // convert an array of words to base64 encoding, should be more efficient
+ // than using dojox.encoding.base64
+ var p="=", tab="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", s=[];
+ for(var i=0, l=wa.length*4; i<l; i+=3){
+ var t=(((wa[i>>2]>>8*(3-i%4))&0xFF)<<16)|(((wa[i+1>>2]>>8*(3-(i+1)%4))&0xFF)<<8)|((wa[i+2>>2]>>8*(3-(i+2)%4))&0xFF);
+ for(var j=0; j<4; j++){
+ if(i*8+j*6>wa.length*32){
+ s.push(p);
+ } else {
+ s.push(tab.charAt((t>>6*(3-j))&0x3F));
+ }
+ }
+ }
+ return s.join(""); // string
+ };
+
+ // public function
+ dxd.SHA1=function(/* String */data, /* dojox.encoding.digests.outputTypes? */outputType){
+ // summary:
+ // Computes the SHA1 digest of the data, and returns the result according to output type.
+ var out=outputType||dxd.outputTypes.Base64;
+ var wa=core(toWord(data), data.length*chrsz);
+ switch(out){
+ case dxd.outputTypes.Raw:{
+ return wa; // word[]
+ }
+ case dxd.outputTypes.Hex:{
+ return toHex(wa); // string
+ }
+ case dxd.outputTypes.String:{
+ return _toString(wa); // string
+ }
+ default:{
+ return toBase64(wa); // string
+ }
+ }
+ }
+
+ // make this private, for later use with a generic HMAC calculator.
+ dxd.SHA1._hmac=function(/* string */data, /* string */key, /* dojox.encoding.digests.outputTypes? */outputType){
+ // summary:
+ // computes the digest of data, and returns the result according to type outputType
+ var out=outputType || dxd.outputTypes.Base64;
+ var wa=hmac(data, key);
+ switch(out){
+ case dxd.outputTypes.Raw:{
+ return wa; // word[]
+ }
+ case dxd.outputTypes.Hex:{
+ return toHex(wa); // string
+ }
+ case dxd.outputTypes.String:{
+ return _toString(wa); // string
+ }
+ default:{
+ return toBase64(wa); // string
+ }
+ }
+ };
+
+ return dxd.SHA1;
+});
diff --git a/js/dojo-1.7.2/dojox/encoding/digests/_base.js b/js/dojo-1.7.2/dojox/encoding/digests/_base.js
new file mode 100644
index 0000000..7ab46a9
--- /dev/null
+++ b/js/dojo-1.7.2/dojox/encoding/digests/_base.js
@@ -0,0 +1,79 @@
+//>>built
+define("dojox/encoding/digests/_base", ["dojo/_base/lang"], function(lang){
+ var d = lang.getObject("dojox.encoding.digests", true);
+ /*=====
+ d = dojox.encoding.digests;
+ =====*/
+
+ //TODO: see if it makes sense to meld this into one with the
+ // crypto base enums
+ d.outputTypes={
+ // summary:
+ // Enumeration for input and output encodings.
+ Base64:0, Hex:1, String:2, Raw:3
+ };
+
+ // word-based addition
+ d.addWords=function(/* word */a, /* word */b){
+ // summary:
+ // add a pair of words together with rollover
+ var l=(a&0xFFFF)+(b&0xFFFF);
+ var m=(a>>16)+(b>>16)+(l>>16);
+ return (m<<16)|(l&0xFFFF); // word
+ };
+
+ // word-based conversion method, for efficiency sake;
+ // most digests operate on words, and this should be faster
+ // than the encoding version (which works on bytes).
+ var chrsz=8; // 16 for Unicode
+ var mask=(1<<chrsz)-1;
+
+ d.stringToWord=function(/* string */s){
+ // summary:
+ // convert a string to a word array
+ var wa=[];
+ for(var i=0, l=s.length*chrsz; i<l; i+=chrsz){
+ wa[i>>5]|=(s.charCodeAt(i/chrsz)&mask)<<(i%32);
+ }
+ return wa; // word[]
+ };
+
+ d.wordToString=function(/* word[] */wa){
+ // summary:
+ // convert an array of words to a string
+ var s=[];
+ for(var i=0, l=wa.length*32; i<l; i+=chrsz){
+ s.push(String.fromCharCode((wa[i>>5]>>>(i%32))&mask));
+ }
+ return s.join(""); // string
+ }
+
+ d.wordToHex=function(/* word[] */wa){
+ // summary:
+ // convert an array of words to a hex tab
+ var h="0123456789abcdef", s=[];
+ for(var i=0, l=wa.length*4; i<l; i++){
+ s.push(h.charAt((wa[i>>2]>>((i%4)*8+4))&0xF)+h.charAt((wa[i>>2]>>((i%4)*8))&0xF));
+ }
+ return s.join(""); // string
+ }
+ d.wordToBase64=function(/* word[] */wa){
+ // summary:
+ // convert an array of words to base64 encoding, should be more efficient
+ // than using dojox.encoding.base64
+ var p="=", tab="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", s=[];
+ for(var i=0, l=wa.length*4; i<l; i+=3){
+ var t=(((wa[i>>2]>>8*(i%4))&0xFF)<<16)|(((wa[i+1>>2]>>8*((i+1)%4))&0xFF)<<8)|((wa[i+2>>2]>>8*((i+2)%4))&0xFF);
+ for(var j=0; j<4; j++){
+ if(i*8+j*6>wa.length*32){
+ s.push(p);
+ } else {
+ s.push(tab.charAt((t>>6*(3-j))&0x3F));
+ }
+ }
+ }
+ return s.join(""); // string
+ };
+
+ return d;
+});
diff --git a/js/dojo-1.7.2/dojox/encoding/easy64.js b/js/dojo-1.7.2/dojox/encoding/easy64.js
new file mode 100644
index 0000000..147b942
--- /dev/null
+++ b/js/dojo-1.7.2/dojox/encoding/easy64.js
@@ -0,0 +1,52 @@
+//>>built
+define("dojox/encoding/easy64", ["dojo/_base/lang"], function(lang) {
+ var easy64 = lang.getObject("dojox.encoding.easy64", true);
+ /*=====
+ easy64 = dojox.encoding.easy64;
+ =====*/
+
+ var c = function(input, length, result){
+ for(var i = 0; i < length; i += 3){
+ result.push(
+ String.fromCharCode((input[i] >>> 2) + 33),
+ String.fromCharCode(((input[i] & 3) << 4) + (input[i + 1] >>> 4) + 33),
+ String.fromCharCode(((input[i + 1] & 15) << 2) + (input[i + 2] >>> 6) + 33),
+ String.fromCharCode((input[i + 2] & 63) + 33)
+ );
+ }
+ };
+
+ easy64.encode = function(input){
+ // summary: encodes input data in easy64 string
+ // input: Array: an array of numbers (0-255) to encode
+ var result = [], reminder = input.length % 3, length = input.length - reminder;
+ c(input, length, result);
+ if(reminder){
+ var t = input.slice(length);
+ while(t.length < 3){ t.push(0); }
+ c(t, 3, result);
+ for(var i = 3; i > reminder; result.pop(), --i);
+ }
+ return result.join(""); // String
+ };
+
+ easy64.decode = function(input){
+ // summary: decodes the input string back to array of numbers
+ // input: String: the input string to decode
+ var n = input.length, r = [], b = [0, 0, 0, 0], i, j, d;
+ for(i = 0; i < n; i += 4){
+ for(j = 0; j < 4; ++j){ b[j] = input.charCodeAt(i + j) - 33; }
+ d = n - i;
+ for(j = d; j < 4; b[++j] = 0);
+ r.push(
+ (b[0] << 2) + (b[1] >>> 4),
+ ((b[1] & 15) << 4) + (b[2] >>> 2),
+ ((b[2] & 3) << 6) + b[3]
+ );
+ for(j = d; j < 4; ++j, r.pop());
+ }
+ return r;
+ };
+
+ return easy64;
+});
generated by cgit v1.0-28-g1787 at 2026-01-10 09:45:24 +0000