]>
Dogcows Code - chaz/p5-CGI-Ex/blob - lib/CGI/Ex/md5.js
2 * Code taken directly from source listed below via the BSD license with one
3 * function added at bottom - Paul Seamons - March 2004
8 * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message
9 * Digest Algorithm, as defined in RFC 1321.
10 * Version 2.1 Copyright (C) Paul Johnston 1999 - 2002.
11 * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
12 * Distributed under the BSD License
13 * See http://pajhome.org.uk/crypt/md5 for more info.
17 * Configurable variables. You may need to tweak these to be compatible with
18 * the server-side, but the defaults work in most cases.
20 var hexcase
= 0; /* hex output format. 0 - lowercase; 1 - uppercase */
21 var b64pad
= ""; /* base-64 pad character. "=" for strict RFC compliance */
22 var chrsz
= 8; /* bits per input character. 8 - ASCII; 16 - Unicode */
25 * These are the functions you'll usually want to call
26 * They take string arguments and return either hex or base-64 encoded strings
28 function hex_md5(s
){ return binl2hex(core_md5(str2binl(s
), s
.length
* chrsz
));}
29 function b64_md5(s
){ return binl2b64(core_md5(str2binl(s
), s
.length
* chrsz
));}
30 function str_md5(s
){ return binl2str(core_md5(str2binl(s
), s
.length
* chrsz
));}
31 function hex_hmac_md5(key
, data
) { return binl2hex(core_hmac_md5(key
, data
)); }
32 function b64_hmac_md5(key
, data
) { return binl2b64(core_hmac_md5(key
, data
)); }
33 function str_hmac_md5(key
, data
) { return binl2str(core_hmac_md5(key
, data
)); }
36 * Perform a simple self-test to see if the VM is working
38 function md5_vm_test()
40 return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72";
44 * Calculate the MD5 of an array of little-endian words, and a bit length
46 function core_md5(x
, len
)
49 x
[len
>> 5] |= 0x80 << ((len
) % 32);
50 x
[(((len
+ 64) >>> 9) << 4) + 14] = len
;
57 for(var i
= 0; i
< x
.length
; i
+= 16)
64 a
= md5_ff(a
, b
, c
, d
, x
[i
+ 0], 7 , -680876936);
65 d
= md5_ff(d
, a
, b
, c
, x
[i
+ 1], 12, -389564586);
66 c
= md5_ff(c
, d
, a
, b
, x
[i
+ 2], 17, 606105819);
67 b
= md5_ff(b
, c
, d
, a
, x
[i
+ 3], 22, -1044525330);
68 a
= md5_ff(a
, b
, c
, d
, x
[i
+ 4], 7 , -176418897);
69 d
= md5_ff(d
, a
, b
, c
, x
[i
+ 5], 12, 1200080426);
70 c
= md5_ff(c
, d
, a
, b
, x
[i
+ 6], 17, -1473231341);
71 b
= md5_ff(b
, c
, d
, a
, x
[i
+ 7], 22, -45705983);
72 a
= md5_ff(a
, b
, c
, d
, x
[i
+ 8], 7 , 1770035416);
73 d
= md5_ff(d
, a
, b
, c
, x
[i
+ 9], 12, -1958414417);
74 c
= md5_ff(c
, d
, a
, b
, x
[i
+10], 17, -42063);
75 b
= md5_ff(b
, c
, d
, a
, x
[i
+11], 22, -1990404162);
76 a
= md5_ff(a
, b
, c
, d
, x
[i
+12], 7 , 1804603682);
77 d
= md5_ff(d
, a
, b
, c
, x
[i
+13], 12, -40341101);
78 c
= md5_ff(c
, d
, a
, b
, x
[i
+14], 17, -1502002290);
79 b
= md5_ff(b
, c
, d
, a
, x
[i
+15], 22, 1236535329);
81 a
= md5_gg(a
, b
, c
, d
, x
[i
+ 1], 5 , -165796510);
82 d
= md5_gg(d
, a
, b
, c
, x
[i
+ 6], 9 , -1069501632);
83 c
= md5_gg(c
, d
, a
, b
, x
[i
+11], 14, 643717713);
84 b
= md5_gg(b
, c
, d
, a
, x
[i
+ 0], 20, -373897302);
85 a
= md5_gg(a
, b
, c
, d
, x
[i
+ 5], 5 , -701558691);
86 d
= md5_gg(d
, a
, b
, c
, x
[i
+10], 9 , 38016083);
87 c
= md5_gg(c
, d
, a
, b
, x
[i
+15], 14, -660478335);
88 b
= md5_gg(b
, c
, d
, a
, x
[i
+ 4], 20, -405537848);
89 a
= md5_gg(a
, b
, c
, d
, x
[i
+ 9], 5 , 568446438);
90 d
= md5_gg(d
, a
, b
, c
, x
[i
+14], 9 , -1019803690);
91 c
= md5_gg(c
, d
, a
, b
, x
[i
+ 3], 14, -187363961);
92 b
= md5_gg(b
, c
, d
, a
, x
[i
+ 8], 20, 1163531501);
93 a
= md5_gg(a
, b
, c
, d
, x
[i
+13], 5 , -1444681467);
94 d
= md5_gg(d
, a
, b
, c
, x
[i
+ 2], 9 , -51403784);
95 c
= md5_gg(c
, d
, a
, b
, x
[i
+ 7], 14, 1735328473);
96 b
= md5_gg(b
, c
, d
, a
, x
[i
+12], 20, -1926607734);
98 a
= md5_hh(a
, b
, c
, d
, x
[i
+ 5], 4 , -378558);
99 d
= md5_hh(d
, a
, b
, c
, x
[i
+ 8], 11, -2022574463);
100 c
= md5_hh(c
, d
, a
, b
, x
[i
+11], 16, 1839030562);
101 b
= md5_hh(b
, c
, d
, a
, x
[i
+14], 23, -35309556);
102 a
= md5_hh(a
, b
, c
, d
, x
[i
+ 1], 4 , -1530992060);
103 d
= md5_hh(d
, a
, b
, c
, x
[i
+ 4], 11, 1272893353);
104 c
= md5_hh(c
, d
, a
, b
, x
[i
+ 7], 16, -155497632);
105 b
= md5_hh(b
, c
, d
, a
, x
[i
+10], 23, -1094730640);
106 a
= md5_hh(a
, b
, c
, d
, x
[i
+13], 4 , 681279174);
107 d
= md5_hh(d
, a
, b
, c
, x
[i
+ 0], 11, -358537222);
108 c
= md5_hh(c
, d
, a
, b
, x
[i
+ 3], 16, -722521979);
109 b
= md5_hh(b
, c
, d
, a
, x
[i
+ 6], 23, 76029189);
110 a
= md5_hh(a
, b
, c
, d
, x
[i
+ 9], 4 , -640364487);
111 d
= md5_hh(d
, a
, b
, c
, x
[i
+12], 11, -421815835);
112 c
= md5_hh(c
, d
, a
, b
, x
[i
+15], 16, 530742520);
113 b
= md5_hh(b
, c
, d
, a
, x
[i
+ 2], 23, -995338651);
115 a
= md5_ii(a
, b
, c
, d
, x
[i
+ 0], 6 , -198630844);
116 d
= md5_ii(d
, a
, b
, c
, x
[i
+ 7], 10, 1126891415);
117 c
= md5_ii(c
, d
, a
, b
, x
[i
+14], 15, -1416354905);
118 b
= md5_ii(b
, c
, d
, a
, x
[i
+ 5], 21, -57434055);
119 a
= md5_ii(a
, b
, c
, d
, x
[i
+12], 6 , 1700485571);
120 d
= md5_ii(d
, a
, b
, c
, x
[i
+ 3], 10, -1894986606);
121 c
= md5_ii(c
, d
, a
, b
, x
[i
+10], 15, -1051523);
122 b
= md5_ii(b
, c
, d
, a
, x
[i
+ 1], 21, -2054922799);
123 a
= md5_ii(a
, b
, c
, d
, x
[i
+ 8], 6 , 1873313359);
124 d
= md5_ii(d
, a
, b
, c
, x
[i
+15], 10, -30611744);
125 c
= md5_ii(c
, d
, a
, b
, x
[i
+ 6], 15, -1560198380);
126 b
= md5_ii(b
, c
, d
, a
, x
[i
+13], 21, 1309151649);
127 a
= md5_ii(a
, b
, c
, d
, x
[i
+ 4], 6 , -145523070);
128 d
= md5_ii(d
, a
, b
, c
, x
[i
+11], 10, -1120210379);
129 c
= md5_ii(c
, d
, a
, b
, x
[i
+ 2], 15, 718787259);
130 b
= md5_ii(b
, c
, d
, a
, x
[i
+ 9], 21, -343485551);
132 a
= safe_add(a
, olda
);
133 b
= safe_add(b
, oldb
);
134 c
= safe_add(c
, oldc
);
135 d
= safe_add(d
, oldd
);
137 return Array(a
, b
, c
, d
);
142 * These functions implement the four basic operations the algorithm uses.
144 function md5_cmn(q
, a
, b
, x
, s
, t
)
146 return safe_add(bit_rol(safe_add(safe_add(a
, q
), safe_add(x
, t
)), s
),b
);
148 function md5_ff(a
, b
, c
, d
, x
, s
, t
)
150 return md5_cmn((b
& c
) | ((~b
) & d
), a
, b
, x
, s
, t
);
152 function md5_gg(a
, b
, c
, d
, x
, s
, t
)
154 return md5_cmn((b
& d
) | (c
& (~d
)), a
, b
, x
, s
, t
);
156 function md5_hh(a
, b
, c
, d
, x
, s
, t
)
158 return md5_cmn(b
^ c
^ d
, a
, b
, x
, s
, t
);
160 function md5_ii(a
, b
, c
, d
, x
, s
, t
)
162 return md5_cmn(c
^ (b
| (~d
)), a
, b
, x
, s
, t
);
166 * Calculate the HMAC-MD5, of a key and some data
168 function core_hmac_md5(key
, data
)
170 var bkey
= str2binl(key
);
171 if(bkey
.length
> 16) bkey
= core_md5(bkey
, key
.length
* chrsz
);
173 var ipad
= Array(16), opad
= Array(16);
174 for(var i
= 0; i
< 16; i
++)
176 ipad
[i
] = bkey
[i
] ^ 0x36363636;
177 opad
[i
] = bkey
[i
] ^ 0x5C5C5C5C;
180 var hash
= core_md5(ipad
.concat(str2binl(data
)), 512 + data
.length
* chrsz
);
181 return core_md5(opad
.concat(hash
), 512 + 128);
185 * Add integers, wrapping at 2^32. This uses 16-bit operations internally
186 * to work around bugs in some JS interpreters.
188 function safe_add(x
, y
)
190 var lsw
= (x
& 0xFFFF) + (y
& 0xFFFF);
191 var msw
= (x
>> 16) + (y
>> 16) + (lsw
>> 16);
192 return (msw
<< 16) | (lsw
& 0xFFFF);
196 * Bitwise rotate a 32-bit number to the left.
198 function bit_rol(num
, cnt
)
200 return (num
<< cnt
) | (num
>>> (32 - cnt
));
204 * Convert a string to an array of little-endian words
205 * If chrsz is ASCII, characters >255 have their hi-byte silently ignored.
207 function str2binl(str
)
210 var mask
= (1 << chrsz
) - 1;
211 for(var i
= 0; i
< str
.length
* chrsz
; i
+= chrsz
)
212 bin
[i
>>5] |= (str
.charCodeAt(i
/ chrsz
) & mask
) << (i
%32);
217 * Convert an array of little-endian words to a string
219 function binl2str(bin
)
222 var mask
= (1 << chrsz
) - 1;
223 for(var i
= 0; i
< bin
.length
* 32; i
+= chrsz
)
224 str
+= String
.fromCharCode((bin
[i
>>5] >>> (i
% 32)) & mask
);
229 * Convert an array of little-endian words to a hex string.
231 function binl2hex(binarray
)
233 var hex_tab
= hexcase
? "0123456789ABCDEF" : "0123456789abcdef";
235 for(var i
= 0; i
< binarray
.length
* 4; i
++)
237 str
+= hex_tab
.charAt((binarray
[i
>>2] >> ((i
%4)*8+4)) & 0xF) +
238 hex_tab
.charAt((binarray
[i
>>2] >> ((i
%4)*8 )) & 0xF);
244 * Convert an array of little-endian words to a base-64 string
246 function binl2b64(binarray
)
248 var tab
= "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
250 for(var i
= 0; i
< binarray
.length
* 4; i
+= 3)
252 var triplet
= (((binarray
[i
>> 2] >> 8 * ( i
%4)) & 0xFF) << 16)
253 | (((binarray
[i
+1 >> 2] >> 8 * ((i
+1)%4)) & 0xFF) << 8 )
254 | ((binarray
[i
+2 >> 2] >> 8 * ((i
+2)%4)) & 0xFF);
255 for(var j
= 0; j
< 4; j
++)
257 if(i
* 8 + j
* 6 > binarray
.length
* 32) str
+= b64pad
;
258 else str
+= tab
.charAt((triplet
>> 6*(3-j
)) & 0x3F);
264 /* simple sub added so we can test for existance */
265 document
.md5_hex = function (s
) {
269 document
.md5_is_functional = function () {
270 return md5_vm_test();
This page took 0.059691 seconds and 4 git commands to generate.