1 package com.gsolo.encryption {
\r
4 * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message
\r
5 * Digest Algorithm, as defined in RFC 1321.
\r
6 * Version 2.2-alpha Copyright (C) Paul Johnston 1999 - 2005
\r
7 * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
\r
8 * Distributed under the BSD License
\r
9 * See http://pajhome.org.uk/crypt/md5 for more info.
\r
11 * Converted to AS3 By Geoffrey Williams
\r
15 * Configurable variables. You may need to tweak these to be compatible with
\r
16 * the server-side, but the defaults work in most cases.
\r
19 public static const HEX_FORMAT_LOWERCASE:uint = 0;
\r
20 public static const HEX_FORMAT_UPPERCASE:uint = 1;
\r
22 public static const BASE64_PAD_CHARACTER_DEFAULT_COMPLIANCE:String = "";
\r
23 public static const BASE64_PAD_CHARACTER_RFC_COMPLIANCE:String = "=";
\r
25 public static var hexcase:uint = 0; /* hex output format. 0 - lowercase; 1 - uppercase */
\r
26 public static var b64pad:String = ""; /* base-64 pad character. "=" for strict RFC compliance */
\r
28 public static function encrypt (string:String):String {
\r
29 return hex_md5 (string);
\r
33 * These are the functions you'll usually want to call
\r
34 * They take string arguments and return either hex or base-64 encoded strings
\r
36 public static function hex_md5 (string:String):String {
\r
37 return rstr2hex (rstr_md5 (str2rstr_utf8 (string)));
\r
40 public static function b64_md5 (string:String):String {
\r
41 return rstr2b64 (rstr_md5 (str2rstr_utf8 (string)));
\r
44 public static function any_md5 (string:String, encoding:String):String {
\r
45 return rstr2any (rstr_md5 (str2rstr_utf8 (string)), encoding);
\r
47 public static function hex_hmac_md5 (key:String, data:String):String {
\r
48 return rstr2hex (rstr_hmac_md5 (str2rstr_utf8 (key), str2rstr_utf8 (data)));
\r
50 public static function b64_hmac_md5 (key:String, data:String):String {
\r
51 return rstr2b64 (rstr_hmac_md5 (str2rstr_utf8 (key), str2rstr_utf8 (data)));
\r
53 public static function any_hmac_md5 (key:String, data:String, encoding:String):String {
\r
54 return rstr2any(rstr_hmac_md5(str2rstr_utf8(key), str2rstr_utf8(data)), encoding);
\r
58 * Perform a simple self-test to see if the VM is working
\r
60 public static function md5_vm_test ():Boolean {
\r
61 return hex_md5 ("abc") == "900150983cd24fb0d6963f7d28e17f72";
\r
65 * Calculate the MD5 of a raw string
\r
67 public static function rstr_md5 (string:String):String {
\r
68 return binl2rstr (binl_md5 (rstr2binl (string), string.length * 8));
\r
72 * Calculate the HMAC-MD5, of a key and some data (raw strings)
\r
74 public static function rstr_hmac_md5 (key:String, data:String):String {
\r
75 var bkey:Array = rstr2binl (key);
\r
76 if (bkey.length > 16) bkey = binl_md5 (bkey, key.length * 8);
\r
78 var ipad:Array = new Array(16), opad:Array = new Array(16);
\r
79 for(var i:Number = 0; i < 16; i++) {
\r
80 ipad[i] = bkey[i] ^ 0x36363636;
\r
81 opad[i] = bkey[i] ^ 0x5C5C5C5C;
\r
84 var hash:Array = binl_md5 (ipad.concat (rstr2binl (data)), 512 + data.length * 8);
\r
85 return binl2rstr (binl_md5 (opad.concat (hash), 512 + 128));
\r
89 * Convert a raw string to a hex string
\r
91 public static function rstr2hex (input:String):String {
\r
92 var hex_tab:String = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
\r
93 var output:String = "";
\r
95 for(var i:Number = 0; i < input.length; i++) {
\r
96 x = input.charCodeAt(i);
\r
97 output += hex_tab.charAt((x >>> 4) & 0x0F)
\r
98 + hex_tab.charAt( x & 0x0F);
\r
104 * Convert a raw string to a base-64 string
\r
106 public static function rstr2b64 (input:String):String {
\r
107 var tab:String = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
\r
108 var output:String = "";
\r
109 var len:Number = input.length;
\r
110 for(var i:Number = 0; i < len; i += 3) {
\r
111 var triplet:Number = (input.charCodeAt(i) << 16)
\r
112 | (i + 1 < len ? input.charCodeAt(i+1) << 8 : 0)
\r
113 | (i + 2 < len ? input.charCodeAt(i+2) : 0);
\r
114 for(var j:Number = 0; j < 4; j++) {
\r
115 if(i * 8 + j * 6 > input.length * 8) output += b64pad;
\r
116 else output += tab.charAt((triplet >>> 6*(3-j)) & 0x3F);
\r
123 * Convert a raw string to an arbitrary string encoding
\r
125 public static function rstr2any(input:String, encoding:String):String {
\r
126 var divisor:Number = encoding.length;
\r
127 var remainders:Array = [];
\r
128 var i:Number, q:Number, x:Number, quotient:Array;
\r
130 /* Convert to an array of 16-bit big-endian values, forming the dividend */
\r
131 var dividend:Array = new Array(input.length / 2);
\r
132 for(i = 0; i < dividend.length; i++) {
\r
133 dividend[i] = (input.charCodeAt(i * 2) << 8) | input.charCodeAt(i * 2 + 1);
\r
137 * Repeatedly perform a long division. The binary array forms the dividend,
\r
138 * the length of the encoding is the divisor. Once computed, the quotient
\r
139 * forms the dividend for the next step. We stop when the dividend is zero.
\r
140 * All remainders are stored for later use.
\r
142 while(dividend.length > 0) {
\r
145 for(i = 0; i < dividend.length; i++) {
\r
146 x = (x << 16) + dividend[i];
\r
147 q = Math.floor(x / divisor);
\r
149 if(quotient.length > 0 || q > 0)
\r
150 quotient[quotient.length] = q;
\r
152 remainders[remainders.length] = x;
\r
153 dividend = quotient;
\r
156 /* Convert the remainders to the output string */
\r
157 var output:String = "";
\r
158 for(i = remainders.length - 1; i >= 0; i--)
\r
159 output += encoding.charAt (remainders[i]);
\r
165 * Encode a string as utf-8.
\r
166 * For efficiency, this assumes the input is valid utf-16.
\r
168 public static function str2rstr_utf8 (input:String):String {
\r
169 var output:String = "";
\r
171 var x:Number, y:Number;
\r
173 while(++i < input.length) {
\r
174 /* Decode utf-16 surrogate pairs */
\r
175 x = input.charCodeAt(i);
\r
176 y = i + 1 < input.length ? input.charCodeAt(i + 1) : 0;
\r
177 if(0xD800 <= x && x <= 0xDBFF && 0xDC00 <= y && y <= 0xDFFF) {
\r
178 x = 0x10000 + ((x & 0x03FF) << 10) + (y & 0x03FF);
\r
182 /* Encode output as utf-8 */
\r
184 output += String.fromCharCode(x);
\r
185 else if(x <= 0x7FF)
\r
186 output += String.fromCharCode(0xC0 | ((x >>> 6 ) & 0x1F),
\r
187 0x80 | ( x & 0x3F));
\r
188 else if(x <= 0xFFFF)
\r
189 output += String.fromCharCode(0xE0 | ((x >>> 12) & 0x0F),
\r
190 0x80 | ((x >>> 6 ) & 0x3F),
\r
191 0x80 | ( x & 0x3F));
\r
192 else if(x <= 0x1FFFFF)
\r
193 output += String.fromCharCode(0xF0 | ((x >>> 18) & 0x07),
\r
194 0x80 | ((x >>> 12) & 0x3F),
\r
195 0x80 | ((x >>> 6 ) & 0x3F),
\r
196 0x80 | ( x & 0x3F));
\r
202 * Encode a string as utf-16
\r
204 public static function str2rstr_utf16le (input:String):String {
\r
205 var output:String = "";
\r
206 for(var i:Number = 0; i < input.length; i++)
\r
207 output += String.fromCharCode( input.charCodeAt(i) & 0xFF,
\r
208 (input.charCodeAt(i) >>> 8) & 0xFF);
\r
212 public static function str2rstr_utf16be (input:String):String {
\r
213 var output:String = "";
\r
214 for(var i:Number = 0; i < input.length; i++)
\r
215 output += String.fromCharCode((input.charCodeAt(i) >>> 8) & 0xFF,
\r
216 input.charCodeAt(i) & 0xFF);
\r
221 * Convert a raw string to an array of little-endian words
\r
222 * Characters >255 have their high-byte silently ignored.
\r
224 public static function rstr2binl (input:String):Array {
\r
225 var output:Array = new Array(input.length >> 2);
\r
226 for(var i:Number = 0; i < output.length; i++)
\r
228 for(i = 0; i < input.length * 8; i += 8)
\r
229 output[i>>5] |= (input.charCodeAt(i / 8) & 0xFF) << (i%32);
\r
234 * Convert an array of little-endian words to a string
\r
236 public static function binl2rstr (input:Array):String {
\r
237 var output:String = "";
\r
238 for(var i:Number = 0; i < input.length * 32; i += 8)
\r
239 output += String.fromCharCode((input[i>>5] >>> (i % 32)) & 0xFF);
\r
244 * Calculate the MD5 of an array of little-endian words, and a bit length.
\r
246 public static function binl_md5 (x:Array, len:Number):Array {
\r
247 /* append padding */
\r
248 x[len >> 5] |= 0x80 << ((len) % 32);
\r
249 x[(((len + 64) >>> 9) << 4) + 14] = len;
\r
251 var a:Number = 1732584193;
\r
252 var b:Number = -271733879;
\r
253 var c:Number = -1732584194;
\r
254 var d:Number = 271733878;
\r
256 for(var i:Number = 0; i < x.length; i += 16) {
\r
257 var olda:Number = a;
\r
258 var oldb:Number = b;
\r
259 var oldc:Number = c;
\r
260 var oldd:Number = d;
\r
262 a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);
\r
263 d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);
\r
264 c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);
\r
265 b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);
\r
266 a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);
\r
267 d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);
\r
268 c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);
\r
269 b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);
\r
270 a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);
\r
271 d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);
\r
272 c = md5_ff(c, d, a, b, x[i+10], 17, -42063);
\r
273 b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);
\r
274 a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);
\r
275 d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);
\r
276 c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);
\r
277 b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);
\r
279 a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);
\r
280 d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);
\r
281 c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);
\r
282 b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);
\r
283 a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);
\r
284 d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);
\r
285 c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);
\r
286 b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);
\r
287 a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);
\r
288 d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);
\r
289 c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);
\r
290 b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);
\r
291 a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);
\r
292 d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);
\r
293 c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);
\r
294 b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);
\r
296 a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);
\r
297 d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);
\r
298 c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);
\r
299 b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);
\r
300 a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);
\r
301 d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);
\r
302 c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);
\r
303 b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);
\r
304 a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);
\r
305 d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);
\r
306 c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);
\r
307 b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);
\r
308 a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);
\r
309 d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);
\r
310 c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);
\r
311 b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);
\r
313 a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);
\r
314 d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);
\r
315 c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);
\r
316 b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);
\r
317 a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);
\r
318 d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);
\r
319 c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);
\r
320 b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);
\r
321 a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);
\r
322 d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);
\r
323 c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);
\r
324 b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);
\r
325 a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);
\r
326 d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);
\r
327 c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);
\r
328 b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);
\r
330 a = safe_add(a, olda);
\r
331 b = safe_add(b, oldb);
\r
332 c = safe_add(c, oldc);
\r
333 d = safe_add(d, oldd);
\r
335 return [a, b, c, d];
\r
339 * These functions implement the four basic operations the algorithm uses.
\r
341 public static function md5_cmn (q:Number, a:Number, b:Number, x:Number, s:Number, t:Number):Number {
\r
342 return safe_add (bit_rol (safe_add (safe_add (a, q), safe_add(x, t)), s), b);
\r
344 public static function md5_ff (a:Number, b:Number, c:Number, d:Number, x:Number, s:Number, t:Number):Number {
\r
345 return md5_cmn ((b & c) | ((~b) & d), a, b, x, s, t);
\r
347 public static function md5_gg (a:Number, b:Number, c:Number, d:Number, x:Number, s:Number, t:Number):Number {
\r
348 return md5_cmn ((b & d) | (c & (~d)), a, b, x, s, t);
\r
350 public static function md5_hh (a:Number, b:Number, c:Number, d:Number, x:Number, s:Number, t:Number):Number {
\r
351 return md5_cmn (b ^ c ^ d, a, b, x, s, t);
\r
353 public static function md5_ii (a:Number, b:Number, c:Number, d:Number, x:Number, s:Number, t:Number):Number {
\r
354 return md5_cmn (c ^ (b | (~d)), a, b, x, s, t);
\r
358 * Add integers, wrapping at 2^32. This uses 16-bit operations internally
\r
359 * to work around bugs in some JS interpreters.
\r
361 public static function safe_add (x:Number, y:Number):Number {
\r
362 var lsw:Number = (x & 0xFFFF) + (y & 0xFFFF);
\r
363 var msw:Number = (x >> 16) + (y >> 16) + (lsw >> 16);
\r
364 return (msw << 16) | (lsw & 0xFFFF);
\r
368 * Bitwise rotate a 32-bit number to the left.
\r
370 public static function bit_rol (num:Number, cnt:Number):Number {
\r
371 return (num << cnt) | (num >>> (32 - cnt));
\r
Code Review / vnfsdk / refrepo.git / blob