md5.js 9.0 KB

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