more plugin fixups
[diogenes.git] / htdocs / md5.js
... / ...
CommitLineData
1/*\r
2 * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message\r
3 * Digest Algorithm, as defined in RFC 1321.\r
4 * Version 2.1 Copyright (C) Paul Johnston 1999 - 2002.\r
5 * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\r
6 * Distributed under the BSD License\r
7 * See http://pajhome.org.uk/crypt/md5 for more info.\r
8 */\r
9\r
10/*\r
11 * Configurable variables. You may need to tweak these to be compatible with\r
12 * the server-side, but the defaults work in most cases.\r
13 */\r
14var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */\r
15var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */\r
16var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */\r
17\r
18/*\r
19 * These are the functions you'll usually want to call\r
20 * They take string arguments and return either hex or base-64 encoded strings\r
21 */\r
22function MD5(s){ return hex_md5(s); }\r
23function hex_md5(s){ return binl2hex(core_md5(str2binl(s), s.length * chrsz));}\r
24function b64_md5(s){ return binl2b64(core_md5(str2binl(s), s.length * chrsz));}\r
25function str_md5(s){ return binl2str(core_md5(str2binl(s), s.length * chrsz));}\r
26function hex_hmac_md5(key, data) { return binl2hex(core_hmac_md5(key, data)); }\r
27function b64_hmac_md5(key, data) { return binl2b64(core_hmac_md5(key, data)); }\r
28function str_hmac_md5(key, data) { return binl2str(core_hmac_md5(key, data)); }\r
29\r
30/*\r
31 * Perform a simple self-test to see if the VM is working\r
32 */\r
33function md5_vm_test()\r
34{\r
35 return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72";\r
36}\r
37\r
38/*\r
39 * Calculate the MD5 of an array of little-endian words, and a bit length\r
40 */\r
41function core_md5(x, len)\r
42{\r
43 /* append padding */\r
44 x[len >> 5] |= 0x80 << ((len) % 32);\r
45 x[(((len + 64) >>> 9) << 4) + 14] = len;\r
46\r
47 var a = 1732584193;\r
48 var b = -271733879;\r
49 var c = -1732584194;\r
50 var d = 271733878;\r
51\r
52 for(var i = 0; i < x.length; i += 16)\r
53 {\r
54 var olda = a;\r
55 var oldb = b;\r
56 var oldc = c;\r
57 var oldd = d;\r
58\r
59 a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\r
60 d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\r
61 c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\r
62 b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\r
63 a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\r
64 d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\r
65 c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\r
66 b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\r
67 a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\r
68 d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\r
69 c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\r
70 b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\r
71 a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\r
72 d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\r
73 c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\r
74 b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\r
75\r
76 a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\r
77 d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\r
78 c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\r
79 b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\r
80 a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\r
81 d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\r
82 c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\r
83 b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\r
84 a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\r
85 d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\r
86 c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\r
87 b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\r
88 a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\r
89 d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\r
90 c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\r
91 b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\r
92\r
93 a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\r
94 d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\r
95 c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\r
96 b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\r
97 a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\r
98 d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\r
99 c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\r
100 b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\r
101 a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\r
102 d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\r
103 c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\r
104 b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\r
105 a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\r
106 d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\r
107 c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\r
108 b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\r
109\r
110 a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\r
111 d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\r
112 c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\r
113 b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\r
114 a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\r
115 d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\r
116 c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\r
117 b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\r
118 a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\r
119 d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\r
120 c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\r
121 b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\r
122 a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\r
123 d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\r
124 c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\r
125 b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\r
126\r
127 a = safe_add(a, olda);\r
128 b = safe_add(b, oldb);\r
129 c = safe_add(c, oldc);\r
130 d = safe_add(d, oldd);\r
131 }\r
132 return Array(a, b, c, d);\r
133\r
134}\r
135\r
136/*\r
137 * These functions implement the four basic operations the algorithm uses.\r
138 */\r
139function md5_cmn(q, a, b, x, s, t)\r
140{\r
141 return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b);\r
142}\r
143function md5_ff(a, b, c, d, x, s, t)\r
144{\r
145 return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);\r
146}\r
147function md5_gg(a, b, c, d, x, s, t)\r
148{\r
149 return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);\r
150}\r
151function md5_hh(a, b, c, d, x, s, t)\r
152{\r
153 return md5_cmn(b ^ c ^ d, a, b, x, s, t);\r
154}\r
155function md5_ii(a, b, c, d, x, s, t)\r
156{\r
157 return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);\r
158}\r
159\r
160/*\r
161 * Calculate the HMAC-MD5, of a key and some data\r
162 */\r
163function core_hmac_md5(key, data)\r
164{\r
165 var bkey = str2binl(key);\r
166 if(bkey.length > 16) bkey = core_md5(bkey, key.length * chrsz);\r
167\r
168 var ipad = Array(16), opad = Array(16);\r
169 for(var i = 0; i < 16; i++)\r
170 {\r
171 ipad[i] = bkey[i] ^ 0x36363636;\r
172 opad[i] = bkey[i] ^ 0x5C5C5C5C;\r
173 }\r
174\r
175 var hash = core_md5(ipad.concat(str2binl(data)), 512 + data.length * chrsz);\r
176 return core_md5(opad.concat(hash), 512 + 128);\r
177}\r
178\r
179/*\r
180 * Add integers, wrapping at 2^32. This uses 16-bit operations internally\r
181 * to work around bugs in some JS interpreters.\r
182 */\r
183function safe_add(x, y)\r
184{\r
185 var lsw = (x & 0xFFFF) + (y & 0xFFFF);\r
186 var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\r
187 return (msw << 16) | (lsw & 0xFFFF);\r
188}\r
189\r
190/*\r
191 * Bitwise rotate a 32-bit number to the left.\r
192 */\r
193function bit_rol(num, cnt)\r
194{\r
195 return (num << cnt) | (num >>> (32 - cnt));\r
196}\r
197\r
198/*\r
199 * Convert a string to an array of little-endian words\r
200 * If chrsz is ASCII, characters >255 have their hi-byte silently ignored.\r
201 */\r
202function str2binl(str)\r
203{\r
204 var bin = Array();\r
205 var mask = (1 << chrsz) - 1;\r
206 for(var i = 0; i < str.length * chrsz; i += chrsz)\r
207 bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (i%32);\r
208 return bin;\r
209}\r
210\r
211/*\r
212 * Convert an array of little-endian words to a string\r
213 */\r
214function binl2str(bin)\r
215{\r
216 var str = "";\r
217 var mask = (1 << chrsz) - 1;\r
218 for(var i = 0; i < bin.length * 32; i += chrsz)\r
219 str += String.fromCharCode((bin[i>>5] >>> (i % 32)) & mask);\r
220 return str;\r
221}\r
222\r
223/*\r
224 * Convert an array of little-endian words to a hex string.\r
225 */\r
226function binl2hex(binarray)\r
227{\r
228 var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";\r
229 var str = "";\r
230 for(var i = 0; i < binarray.length * 4; i++)\r
231 {\r
232 str += hex_tab.charAt((binarray[i>>2] >> ((i%4)*8+4)) & 0xF) +\r
233 hex_tab.charAt((binarray[i>>2] >> ((i%4)*8 )) & 0xF);\r
234 }\r
235 return str;\r
236}\r
237\r
238/*\r
239 * Convert an array of little-endian words to a base-64 string\r
240 */\r
241function binl2b64(binarray)\r
242{\r
243 var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";\r
244 var str = "";\r
245 for(var i = 0; i < binarray.length * 4; i += 3)\r
246 {\r
247 var triplet = (((binarray[i >> 2] >> 8 * ( i %4)) & 0xFF) << 16)\r
248 | (((binarray[i+1 >> 2] >> 8 * ((i+1)%4)) & 0xFF) << 8 )\r
249 | ((binarray[i+2 >> 2] >> 8 * ((i+2)%4)) & 0xFF);\r
250 for(var j = 0; j < 4; j++)\r
251 {\r
252 if(i * 8 + j * 6 > binarray.length * 32) str += b64pad;\r
253 else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);\r
254 }\r
255 }\r
256 return str;\r
257}\r