https://pubhtml5.com/js/utils/md5.js

1/*
2 * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message
3 * Digest Algorithm, as defined in RFC 1321.
4 * Version 2.1 Copyright (C) Paul Johnston 1999 - 2002.
5 * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
6 * Distributed under the BSD License
7 * See http://pajhome.org.uk/crypt/md5 for more info.
8 */
9
10/*
11 * Configurable variables. You may need to tweak these to be compatible with
12 * the server-side, but the defaults work in most cases.
13 */
14var hexcase = 0;
15/* hex output format. 0 - lowercase; 1 - uppercase        */
16var b64pad = "";
17/* base-64 pad character. "=" for strict RFC compliance   */
18var chrsz = 8;
19/* bits per input character. 8 - ASCII; 16 - Unicode      */
20
21/*
22 * These are the functions you'll usually want to call
23 * They take string arguments and return either hex or base-64 encoded strings
24 */
25function hex_md5(s) {
26  return binl2hex(core_md5(str2binl(s), s.length * chrsz));
27}
28function b64_md5(s) {
29  return binl2b64(core_md5(str2binl(s), s.length * chrsz));
30}
31function str_md5(s) {
32  return binl2str(core_md5(str2binl(s), s.length * chrsz));
33}
34function hex_hmac_md5(key, data) {
35  return binl2hex(core_hmac_md5(key, data));
36}
37function b64_hmac_md5(key, data) {
38  return binl2b64(core_hmac_md5(key, data));
39}
40function str_hmac_md5(key, data) {
41  return binl2str(core_hmac_md5(key, data));
42}
43
44/*
45 * Perform a simple self-test to see if the VM is working
46 */
47function md5_vm_test() {
48  return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72";
49}
50
51/*
52 * Calculate the MD5 of an array of little-endian words, and a bit length
53 */
54function core_md5(x, len) {
55  /* append padding */
56  x[len >> 5] |= 0x80 << ((len) % 32);
57  x[(((len + 64) >>> 9) << 4) + 14] = len;
58
59  var a = 1732584193;
60  var b = -271733879;

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

244+/";
245  var str = "";
246  for (var i = 0; i < binarray.length * 4; i += 3) {
247    var triplet = (((binarray[i >> 2] >> 8 * ( i % 4)) & 0xFF) << 16)
248      | (((binarray[i + 1 >> 2] >> 8 * ((i + 1) % 4)) & 0xFF) << 8 )
249      | ((binarray[i + 2 >> 2] >> 8 * ((i + 2) % 4)) & 0xFF);
250    for (var j = 0; j < 4; j++) {
251      if (i * 8 + j * 6 > binarray.length * 32) {
252        str += b64pad;
253      }
254      else {
255        str += tab.charAt((triplet >> 6 * (3 - j)) & 0x3F);
256      }
257    }
258  }
259  return str;
260}