libs/md5.js

  1. /**
  2.  * @license
  3.  * Joseph Myers does not specify a particular license for his work.
  4.  *
  5.  * Author: Joseph Myers
  6.  * Accessed from: http://www.myersdaily.org/joseph/javascript/md5.js
  7.  *
  8.  * Modified by: Owen Leong
  9.  */
  11. function md5cycle(x, k) {
  12.   var a = x[0],
  13.     b = x[1],
  14.     c = x[2],
  15.     d = x[3];
  17.   a = ff(a, b, c, d, k[0], 7, -680876936);
  18.   d = ff(d, a, b, c, k[1], 12, -389564586);
  19.   c = ff(c, d, a, b, k[2], 17, 606105819);
  20.   b = ff(b, c, d, a, k[3], 22, -1044525330);
  21.   a = ff(a, b, c, d, k[4], 7, -176418897);
  22.   d = ff(d, a, b, c, k[5], 12, 1200080426);
  23.   c = ff(c, d, a, b, k[6], 17, -1473231341);
  24.   b = ff(b, c, d, a, k[7], 22, -45705983);
  25.   a = ff(a, b, c, d, k[8], 7, 1770035416);
  26.   d = ff(d, a, b, c, k[9], 12, -1958414417);
  27.   c = ff(c, d, a, b, k[10], 17, -42063);
  28.   b = ff(b, c, d, a, k[11], 22, -1990404162);
  29.   a = ff(a, b, c, d, k[12], 7, 1804603682);
  30.   d = ff(d, a, b, c, k[13], 12, -40341101);
  31.   c = ff(c, d, a, b, k[14], 17, -1502002290);
  32.   b = ff(b, c, d, a, k[15], 22, 1236535329);
  34.   a = gg(a, b, c, d, k[1], 5, -165796510);
  35.   d = gg(d, a, b, c, k[6], 9, -1069501632);
  36.   c = gg(c, d, a, b, k[11], 14, 643717713);
  37.   b = gg(b, c, d, a, k[0], 20, -373897302);
  38.   a = gg(a, b, c, d, k[5], 5, -701558691);
  39.   d = gg(d, a, b, c, k[10], 9, 38016083);
  40.   c = gg(c, d, a, b, k[15], 14, -660478335);
  41.   b = gg(b, c, d, a, k[4], 20, -405537848);
  42.   a = gg(a, b, c, d, k[9], 5, 568446438);
  43.   d = gg(d, a, b, c, k[14], 9, -1019803690);
  44.   c = gg(c, d, a, b, k[3], 14, -187363961);
  45.   b = gg(b, c, d, a, k[8], 20, 1163531501);
  46.   a = gg(a, b, c, d, k[13], 5, -1444681467);
  47.   d = gg(d, a, b, c, k[2], 9, -51403784);
  48.   c = gg(c, d, a, b, k[7], 14, 1735328473);
  49.   b = gg(b, c, d, a, k[12], 20, -1926607734);
  51.   a = hh(a, b, c, d, k[5], 4, -378558);
  52.   d = hh(d, a, b, c, k[8], 11, -2022574463);
  53.   c = hh(c, d, a, b, k[11], 16, 1839030562);
  54.   b = hh(b, c, d, a, k[14], 23, -35309556);
  55.   a = hh(a, b, c, d, k[1], 4, -1530992060);
  56.   d = hh(d, a, b, c, k[4], 11, 1272893353);
  57.   c = hh(c, d, a, b, k[7], 16, -155497632);
  58.   b = hh(b, c, d, a, k[10], 23, -1094730640);
  59.   a = hh(a, b, c, d, k[13], 4, 681279174);
  60.   d = hh(d, a, b, c, k[0], 11, -358537222);
  61.   c = hh(c, d, a, b, k[3], 16, -722521979);
  62.   b = hh(b, c, d, a, k[6], 23, 76029189);
  63.   a = hh(a, b, c, d, k[9], 4, -640364487);
  64.   d = hh(d, a, b, c, k[12], 11, -421815835);
  65.   c = hh(c, d, a, b, k[15], 16, 530742520);
  66.   b = hh(b, c, d, a, k[2], 23, -995338651);
  68.   a = ii(a, b, c, d, k[0], 6, -198630844);
  69.   d = ii(d, a, b, c, k[7], 10, 1126891415);
  70.   c = ii(c, d, a, b, k[14], 15, -1416354905);
  71.   b = ii(b, c, d, a, k[5], 21, -57434055);
  72.   a = ii(a, b, c, d, k[12], 6, 1700485571);
  73.   d = ii(d, a, b, c, k[3], 10, -1894986606);
  74.   c = ii(c, d, a, b, k[10], 15, -1051523);
  75.   b = ii(b, c, d, a, k[1], 21, -2054922799);
  76.   a = ii(a, b, c, d, k[8], 6, 1873313359);
  77.   d = ii(d, a, b, c, k[15], 10, -30611744);
  78.   c = ii(c, d, a, b, k[6], 15, -1560198380);
  79.   b = ii(b, c, d, a, k[13], 21, 1309151649);
  80.   a = ii(a, b, c, d, k[4], 6, -145523070);
  81.   d = ii(d, a, b, c, k[11], 10, -1120210379);
  82.   c = ii(c, d, a, b, k[2], 15, 718787259);
  83.   b = ii(b, c, d, a, k[9], 21, -343485551);
  85.   x[0] = add32(a, x[0]);
  86.   x[1] = add32(b, x[1]);
  87.   x[2] = add32(c, x[2]);
  88.   x[3] = add32(d, x[3]);
  89. }
  91. function cmn(q, a, b, x, s, t) {
  92.   a = add32(add32(a, q), add32(x, t));
  93.   return add32((a << s) | (a >>> (32 - s)), b);
  94. }
  96. function ff(a, b, c, d, x, s, t) {
  97.   return cmn((b & c) | (~b & d), a, b, x, s, t);
  98. }
  100. function gg(a, b, c, d, x, s, t) {
  101.   return cmn((b & d) | (c & ~d), a, b, x, s, t);
  102. }
  104. function hh(a, b, c, d, x, s, t) {
  105.   return cmn(b ^ c ^ d, a, b, x, s, t);
  106. }
  108. function ii(a, b, c, d, x, s, t) {
  109.   return cmn(c ^ (b | ~d), a, b, x, s, t);
  110. }
  112. function md51(s) {
  113.   // txt = '';
  114.   var n = s.length,
  115.     state = [1732584193, -271733879, -1732584194, 271733878],
  116.     i;
  117.   for (i = 64; i <= s.length; i += 64) {
  118.     md5cycle(state, md5blk(s.substring(i - 64, i)));
  119.   }
  120.   s = s.substring(i - 64);
  121.   var tail = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];
  122.   for (i = 0; i < s.length; i++)
  123.     tail[i >> 2] |= s.charCodeAt(i) << (i % 4 << 3);
  124.   tail[i >> 2] |= 0x80 << (i % 4 << 3);
  125.   if (i > 55) {
  126.     md5cycle(state, tail);
  127.     for (i = 0; i < 16; i++) tail[i] = 0;
  128.   }
  129.   tail[14] = n * 8;
  130.   md5cycle(state, tail);
  131.   return state;
  132. }
  134. /* there needs to be support for Unicode here,
  135.  * unless we pretend that we can redefine the MD-5
  136.  * algorithm for multi-byte characters (perhaps
  137.  * by adding every four 16-bit characters and
  138.  * shortening the sum to 32 bits). Otherwise
  139.  * I suggest performing MD-5 as if every character
  140.  * was two bytes--e.g., 0040 0025 = @%--but then
  141.  * how will an ordinary MD-5 sum be matched?
  142.  * There is no way to standardize text to something
  143.  * like UTF-8 before transformation; speed cost is
  144.  * utterly prohibitive. The JavaScript standard
  145.  * itself needs to look at this: it should start
  146.  * providing access to strings as preformed UTF-8
  147.  * 8-bit unsigned value arrays.
  148.  */
  149. function md5blk(s) {
  150.   /* I figured global was faster.   */
  151.   var md5blks = [],
  152.     i; /* Andy King said do it this way. */
  153.   for (i = 0; i < 64; i += 4) {
  154.     md5blks[i >> 2] =
  155.       s.charCodeAt(i) +
  156.       (s.charCodeAt(i + 1) << 8) +
  157.       (s.charCodeAt(i + 2) << 16) +
  158.       (s.charCodeAt(i + 3) << 24);
  159.   }
  160.   return md5blks;
  161. }
  163. var hex_chr = "0123456789abcdef".split("");
  165. function rhex(n) {
  166.   var s = "",
  167.     j = 0;
  168.   for (; j < 4; j++)
  169.     s += hex_chr[(n >> (j * 8 + 4)) & 0x0f] + hex_chr[(n >> (j * 8)) & 0x0f];
  170.   return s;
  171. }
  173. function hex(x) {
  174.   for (var i = 0; i < x.length; i++) x[i] = rhex(x[i]);
  175.   return x.join("");
  176. }
  178. // Converts a 4-byte number to byte string
  179. function singleToByteString(n) {
  180.   return String.fromCharCode(
  181.     (n & 0xff) >> 0,
  182.     (n & 0xff00) >> 8,
  183.     (n & 0xff0000) >> 16,
  184.     (n & 0xff000000) >> 24
  185.   );
  186. }
  188. // Converts an array of numbers to a byte string
  189. function toByteString(x) {
  190.   return x.map(singleToByteString).join("");
  191. }
  193. // Returns the MD5 hash as a byte string
  194. function md5Bin(s) {
  195.   return toByteString(md51(s));
  196. }
  198. // Returns MD5 hash as a hex string
  199. function md5(s) {
  200.   return hex(md51(s));
  201. }
  203. var md5Check = md5("hello") != "5d41402abc4b2a76b9719d911017c592";
  205. function add32(a, b) {
  206.   if (md5Check) {
  207.     /* if the md5Check does not match
  208.      the expected value, we're dealing
  209.      with an old browser and need
  210.      this function. */
  211.     var lsw = (a & 0xffff) + (b & 0xffff),
  212.       msw = (a >> 16) + (b >> 16) + (lsw >> 16);
  213.     return (msw << 16) | (lsw & 0xffff);
  214.   } else {
  215.     /* this function is much faster,
  216.     so if possible we use it. Some IEs
  217.     are the only ones I know of that
  218.     need the idiotic second function,
  219.     generated by an if clause.  */
  220.     return (a + b) & 0xffffffff;
  221.   }
  222. }
  224. export { md5, md5Bin };