You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

216 lines
6.7 KiB

  1. /*
  2. * Browser-compatible JavaScript MD5
  3. *
  4. * Modification of JavaScript MD5
  5. * https://github.com/blueimp/JavaScript-MD5
  6. *
  7. * Copyright 2011, Sebastian Tschan
  8. * https://blueimp.net
  9. *
  10. * Licensed under the MIT license:
  11. * https://opensource.org/licenses/MIT
  12. *
  13. * Based on
  14. * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message
  15. * Digest Algorithm, as defined in RFC 1321.
  16. * Version 2.2 Copyright (C) Paul Johnston 1999 - 2009
  17. * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
  18. * Distributed under the BSD License
  19. * See http://pajhome.org.uk/crypt/md5 for more info.
  20. */
  21. 'use strict';
  22. function md5(bytes) {
  23. if (typeof(bytes) == 'string') {
  24. var msg = unescape(encodeURIComponent(bytes)); // UTF8 escape
  25. bytes = new Array(msg.length);
  26. for (var i = 0; i < msg.length; i++) bytes[i] = msg.charCodeAt(i);
  27. }
  28. return md5ToHexEncodedArray(
  29. wordsToMd5(
  30. bytesToWords(bytes)
  31. , bytes.length * 8)
  32. );
  33. }
  34. /*
  35. * Convert an array of little-endian words to an array of bytes
  36. */
  37. function md5ToHexEncodedArray(input) {
  38. var i;
  39. var x;
  40. var output = [];
  41. var length32 = input.length * 32;
  42. var hexTab = '0123456789abcdef';
  43. var hex;
  44. for (i = 0; i < length32; i += 8) {
  45. x = (input[i >> 5] >>> (i % 32)) & 0xFF;
  46. hex = parseInt(hexTab.charAt((x >>> 4) & 0x0F) + hexTab.charAt(x & 0x0F), 16);
  47. output.push(hex);
  48. }
  49. return output;
  50. }
  51. /*
  52. * Calculate the MD5 of an array of little-endian words, and a bit length.
  53. */
  54. function wordsToMd5(x, len) {
  55. /* append padding */
  56. x[len >> 5] |= 0x80 << (len % 32);
  57. x[(((len + 64) >>> 9) << 4) + 14] = len;
  58. var i;
  59. var olda;
  60. var oldb;
  61. var oldc;
  62. var oldd;
  63. var a = 1732584193;
  64. var b = -271733879;
  65. var c = -1732584194;
  66. var d = 271733878;
  67. for (i = 0; i < x.length; i += 16) {
  68. olda = a;
  69. oldb = b;
  70. oldc = c;
  71. oldd = d;
  72. a = md5ff(a, b, c, d, x[i], 7, -680876936);
  73. d = md5ff(d, a, b, c, x[i + 1], 12, -389564586);
  74. c = md5ff(c, d, a, b, x[i + 2], 17, 606105819);
  75. b = md5ff(b, c, d, a, x[i + 3], 22, -1044525330);
  76. a = md5ff(a, b, c, d, x[i + 4], 7, -176418897);
  77. d = md5ff(d, a, b, c, x[i + 5], 12, 1200080426);
  78. c = md5ff(c, d, a, b, x[i + 6], 17, -1473231341);
  79. b = md5ff(b, c, d, a, x[i + 7], 22, -45705983);
  80. a = md5ff(a, b, c, d, x[i + 8], 7, 1770035416);
  81. d = md5ff(d, a, b, c, x[i + 9], 12, -1958414417);
  82. c = md5ff(c, d, a, b, x[i + 10], 17, -42063);
  83. b = md5ff(b, c, d, a, x[i + 11], 22, -1990404162);
  84. a = md5ff(a, b, c, d, x[i + 12], 7, 1804603682);
  85. d = md5ff(d, a, b, c, x[i + 13], 12, -40341101);
  86. c = md5ff(c, d, a, b, x[i + 14], 17, -1502002290);
  87. b = md5ff(b, c, d, a, x[i + 15], 22, 1236535329);
  88. a = md5gg(a, b, c, d, x[i + 1], 5, -165796510);
  89. d = md5gg(d, a, b, c, x[i + 6], 9, -1069501632);
  90. c = md5gg(c, d, a, b, x[i + 11], 14, 643717713);
  91. b = md5gg(b, c, d, a, x[i], 20, -373897302);
  92. a = md5gg(a, b, c, d, x[i + 5], 5, -701558691);
  93. d = md5gg(d, a, b, c, x[i + 10], 9, 38016083);
  94. c = md5gg(c, d, a, b, x[i + 15], 14, -660478335);
  95. b = md5gg(b, c, d, a, x[i + 4], 20, -405537848);
  96. a = md5gg(a, b, c, d, x[i + 9], 5, 568446438);
  97. d = md5gg(d, a, b, c, x[i + 14], 9, -1019803690);
  98. c = md5gg(c, d, a, b, x[i + 3], 14, -187363961);
  99. b = md5gg(b, c, d, a, x[i + 8], 20, 1163531501);
  100. a = md5gg(a, b, c, d, x[i + 13], 5, -1444681467);
  101. d = md5gg(d, a, b, c, x[i + 2], 9, -51403784);
  102. c = md5gg(c, d, a, b, x[i + 7], 14, 1735328473);
  103. b = md5gg(b, c, d, a, x[i + 12], 20, -1926607734);
  104. a = md5hh(a, b, c, d, x[i + 5], 4, -378558);
  105. d = md5hh(d, a, b, c, x[i + 8], 11, -2022574463);
  106. c = md5hh(c, d, a, b, x[i + 11], 16, 1839030562);
  107. b = md5hh(b, c, d, a, x[i + 14], 23, -35309556);
  108. a = md5hh(a, b, c, d, x[i + 1], 4, -1530992060);
  109. d = md5hh(d, a, b, c, x[i + 4], 11, 1272893353);
  110. c = md5hh(c, d, a, b, x[i + 7], 16, -155497632);
  111. b = md5hh(b, c, d, a, x[i + 10], 23, -1094730640);
  112. a = md5hh(a, b, c, d, x[i + 13], 4, 681279174);
  113. d = md5hh(d, a, b, c, x[i], 11, -358537222);
  114. c = md5hh(c, d, a, b, x[i + 3], 16, -722521979);
  115. b = md5hh(b, c, d, a, x[i + 6], 23, 76029189);
  116. a = md5hh(a, b, c, d, x[i + 9], 4, -640364487);
  117. d = md5hh(d, a, b, c, x[i + 12], 11, -421815835);
  118. c = md5hh(c, d, a, b, x[i + 15], 16, 530742520);
  119. b = md5hh(b, c, d, a, x[i + 2], 23, -995338651);
  120. a = md5ii(a, b, c, d, x[i], 6, -198630844);
  121. d = md5ii(d, a, b, c, x[i + 7], 10, 1126891415);
  122. c = md5ii(c, d, a, b, x[i + 14], 15, -1416354905);
  123. b = md5ii(b, c, d, a, x[i + 5], 21, -57434055);
  124. a = md5ii(a, b, c, d, x[i + 12], 6, 1700485571);
  125. d = md5ii(d, a, b, c, x[i + 3], 10, -1894986606);
  126. c = md5ii(c, d, a, b, x[i + 10], 15, -1051523);
  127. b = md5ii(b, c, d, a, x[i + 1], 21, -2054922799);
  128. a = md5ii(a, b, c, d, x[i + 8], 6, 1873313359);
  129. d = md5ii(d, a, b, c, x[i + 15], 10, -30611744);
  130. c = md5ii(c, d, a, b, x[i + 6], 15, -1560198380);
  131. b = md5ii(b, c, d, a, x[i + 13], 21, 1309151649);
  132. a = md5ii(a, b, c, d, x[i + 4], 6, -145523070);
  133. d = md5ii(d, a, b, c, x[i + 11], 10, -1120210379);
  134. c = md5ii(c, d, a, b, x[i + 2], 15, 718787259);
  135. b = md5ii(b, c, d, a, x[i + 9], 21, -343485551);
  136. a = safeAdd(a, olda);
  137. b = safeAdd(b, oldb);
  138. c = safeAdd(c, oldc);
  139. d = safeAdd(d, oldd);
  140. }
  141. return [a, b, c, d];
  142. }
  143. /*
  144. * Convert an array bytes to an array of little-endian words
  145. * Characters >255 have their high-byte silently ignored.
  146. */
  147. function bytesToWords(input) {
  148. var i;
  149. var output = [];
  150. output[(input.length >> 2) - 1] = undefined;
  151. for (i = 0; i < output.length; i += 1) {
  152. output[i] = 0;
  153. }
  154. var length8 = input.length * 8;
  155. for (i = 0; i < length8; i += 8) {
  156. output[i >> 5] |= (input[(i / 8)] & 0xFF) << (i % 32);
  157. }
  158. return output;
  159. }
  160. /*
  161. * Add integers, wrapping at 2^32. This uses 16-bit operations internally
  162. * to work around bugs in some JS interpreters.
  163. */
  164. function safeAdd(x, y) {
  165. var lsw = (x & 0xFFFF) + (y & 0xFFFF);
  166. var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
  167. return (msw << 16) | (lsw & 0xFFFF);
  168. }
  169. /*
  170. * Bitwise rotate a 32-bit number to the left.
  171. */
  172. function bitRotateLeft(num, cnt) {
  173. return (num << cnt) | (num >>> (32 - cnt));
  174. }
  175. /*
  176. * These functions implement the four basic operations the algorithm uses.
  177. */
  178. function md5cmn(q, a, b, x, s, t) {
  179. return safeAdd(bitRotateLeft(safeAdd(safeAdd(a, q), safeAdd(x, t)), s), b);
  180. }
  181. function md5ff(a, b, c, d, x, s, t) {
  182. return md5cmn((b & c) | ((~b) & d), a, b, x, s, t);
  183. }
  184. function md5gg(a, b, c, d, x, s, t) {
  185. return md5cmn((b & d) | (c & (~d)), a, b, x, s, t);
  186. }
  187. function md5hh(a, b, c, d, x, s, t) {
  188. return md5cmn(b ^ c ^ d, a, b, x, s, t);
  189. }
  190. function md5ii(a, b, c, d, x, s, t) {
  191. return md5cmn(c ^ (b | (~d)), a, b, x, s, t);
  192. }
  193. module.exports = md5;