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