md5.js 5.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173
  1. /*
  2. CryptoJS v3.0.2
  3. code.google.com/p/crypto-js
  4. (c) 2009-2012 by Jeff Mott. All rights reserved.
  5. code.google.com/p/crypto-js/wiki/License
  6. */
  7. (function (Math) {
  8. // Shortcuts
  9. var C = CryptoJS;
  10. var C_lib = C.lib;
  11. var WordArray = C_lib.WordArray;
  12. var Hasher = C_lib.Hasher;
  13. var C_algo = C.algo;
  14. // Constants table
  15. var T = [];
  16. // Compute constants
  17. (function () {
  18. for (var i = 0; i < 64; i++) {
  19. T[i] = (Math.abs(Math.sin(i + 1)) * 0x100000000) | 0;
  20. }
  21. }());
  22. /**
  23. * MD5 hash algorithm.
  24. */
  25. var MD5 = C_algo.MD5 = Hasher.extend({
  26. _doReset: function () {
  27. this._hash = WordArray.create([0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476]);
  28. },
  29. _doProcessBlock: function (M, offset) {
  30. // Swap endian
  31. for (var i = 0; i < 16; i++) {
  32. // Shortcuts
  33. var offset_i = offset + i;
  34. var M_offset_i = M[offset_i];
  35. // Swap
  36. M[offset_i] = (
  37. (((M_offset_i << 8) | (M_offset_i >>> 24)) & 0x00ff00ff) |
  38. (((M_offset_i << 24) | (M_offset_i >>> 8)) & 0xff00ff00)
  39. );
  40. }
  41. // Shortcut
  42. var H = this._hash.words;
  43. // Working variables
  44. var a = H[0];
  45. var b = H[1];
  46. var c = H[2];
  47. var d = H[3];
  48. // Computation
  49. for (var i = 0; i < 64; i += 4) {
  50. if (i < 16) {
  51. a = FF(a, b, c, d, M[offset + i], 7, T[i]);
  52. d = FF(d, a, b, c, M[offset + i + 1], 12, T[i + 1]);
  53. c = FF(c, d, a, b, M[offset + i + 2], 17, T[i + 2]);
  54. b = FF(b, c, d, a, M[offset + i + 3], 22, T[i + 3]);
  55. } else if (i < 32) {
  56. a = GG(a, b, c, d, M[offset + ((i + 1) % 16)], 5, T[i]);
  57. d = GG(d, a, b, c, M[offset + ((i + 6) % 16)], 9, T[i + 1]);
  58. c = GG(c, d, a, b, M[offset + ((i + 11) % 16)], 14, T[i + 2]);
  59. b = GG(b, c, d, a, M[offset + (i % 16)], 20, T[i + 3]);
  60. } else if (i < 48) {
  61. a = HH(a, b, c, d, M[offset + ((i * 3 + 5) % 16)], 4, T[i]);
  62. d = HH(d, a, b, c, M[offset + ((i * 3 + 8) % 16)], 11, T[i + 1]);
  63. c = HH(c, d, a, b, M[offset + ((i * 3 + 11) % 16)], 16, T[i + 2]);
  64. b = HH(b, c, d, a, M[offset + ((i * 3 + 14) % 16)], 23, T[i + 3]);
  65. } else /* if (i < 64) */ {
  66. a = II(a, b, c, d, M[offset + ((i * 3) % 16)], 6, T[i]);
  67. d = II(d, a, b, c, M[offset + ((i * 3 + 7) % 16)], 10, T[i + 1]);
  68. c = II(c, d, a, b, M[offset + ((i * 3 + 14) % 16)], 15, T[i + 2]);
  69. b = II(b, c, d, a, M[offset + ((i * 3 + 5) % 16)], 21, T[i + 3]);
  70. }
  71. }
  72. // Intermediate hash value
  73. H[0] = (H[0] + a) | 0;
  74. H[1] = (H[1] + b) | 0;
  75. H[2] = (H[2] + c) | 0;
  76. H[3] = (H[3] + d) | 0;
  77. },
  78. _doFinalize: function () {
  79. // Shortcuts
  80. var data = this._data;
  81. var dataWords = data.words;
  82. var nBitsTotal = this._nDataBytes * 8;
  83. var nBitsLeft = data.sigBytes * 8;
  84. // Add padding
  85. dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);
  86. dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = (
  87. (((nBitsTotal << 8) | (nBitsTotal >>> 24)) & 0x00ff00ff) |
  88. (((nBitsTotal << 24) | (nBitsTotal >>> 8)) & 0xff00ff00)
  89. );
  90. data.sigBytes = (dataWords.length + 1) * 4;
  91. // Hash final blocks
  92. this._process();
  93. // Shortcut
  94. var H = this._hash.words;
  95. // Swap endian
  96. for (var i = 0; i < 4; i++) {
  97. // Shortcut
  98. var H_i = H[i];
  99. // Swap
  100. H[i] = (((H_i << 8) | (H_i >>> 24)) & 0x00ff00ff) |
  101. (((H_i << 24) | (H_i >>> 8)) & 0xff00ff00);
  102. }
  103. }
  104. });
  105. function FF(a, b, c, d, x, s, t) {
  106. var n = a + ((b & c) | (~b & d)) + x + t;
  107. return ((n << s) | (n >>> (32 - s))) + b;
  108. }
  109. function GG(a, b, c, d, x, s, t) {
  110. var n = a + ((b & d) | (c & ~d)) + x + t;
  111. return ((n << s) | (n >>> (32 - s))) + b;
  112. }
  113. function HH(a, b, c, d, x, s, t) {
  114. var n = a + (b ^ c ^ d) + x + t;
  115. return ((n << s) | (n >>> (32 - s))) + b;
  116. }
  117. function II(a, b, c, d, x, s, t) {
  118. var n = a + (c ^ (b | ~d)) + x + t;
  119. return ((n << s) | (n >>> (32 - s))) + b;
  120. }
  121. /**
  122. * Shortcut function to the hasher's object interface.
  123. *
  124. * @param {WordArray|string} message The message to hash.
  125. *
  126. * @return {WordArray} The hash.
  127. *
  128. * @static
  129. *
  130. * @example
  131. *
  132. * var hash = CryptoJS.MD5('message');
  133. * var hash = CryptoJS.MD5(wordArray);
  134. */
  135. C.MD5 = Hasher._createHelper(MD5);
  136. /**
  137. * Shortcut function to the HMAC's object interface.
  138. *
  139. * @param {WordArray|string} message The message to hash.
  140. * @param {WordArray|string} key The secret key.
  141. *
  142. * @return {WordArray} The HMAC.
  143. *
  144. * @static
  145. *
  146. * @example
  147. *
  148. * var hmac = CryptoJS.HmacMD5(message, key);
  149. */
  150. C.HmacMD5 = Hasher._createHmacHelper(MD5);
  151. }(Math));