AI销管
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.

ripemd160.js 9.2 KiB

2 年之前
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267
  1. ;(function (root, factory) {
  2. if (typeof exports === "object") {
  3. // CommonJS
  4. module.exports = exports = factory(require("./core"));
  5. }
  6. else if (typeof define === "function" && define.amd) {
  7. // AMD
  8. define(["./core"], factory);
  9. }
  10. else {
  11. // Global (browser)
  12. factory(root.CryptoJS);
  13. }
  14. }(this, function (CryptoJS) {
  15. /** @preserve
  16. (c) 2012 by Cédric Mesnil. All rights reserved.
  17. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
  18. - Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
  19. - Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
  20. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  21. */
  22. (function (Math) {
  23. // Shortcuts
  24. var C = CryptoJS;
  25. var C_lib = C.lib;
  26. var WordArray = C_lib.WordArray;
  27. var Hasher = C_lib.Hasher;
  28. var C_algo = C.algo;
  29. // Constants table
  30. var _zl = WordArray.create([
  31. 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
  32. 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,
  33. 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,
  34. 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,
  35. 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13]);
  36. var _zr = WordArray.create([
  37. 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,
  38. 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,
  39. 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,
  40. 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,
  41. 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11]);
  42. var _sl = WordArray.create([
  43. 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,
  44. 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,
  45. 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,
  46. 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,
  47. 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6 ]);
  48. var _sr = WordArray.create([
  49. 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,
  50. 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,
  51. 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,
  52. 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,
  53. 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11 ]);
  54. var _hl = WordArray.create([ 0x00000000, 0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xA953FD4E]);
  55. var _hr = WordArray.create([ 0x50A28BE6, 0x5C4DD124, 0x6D703EF3, 0x7A6D76E9, 0x00000000]);
  56. /**
  57. * RIPEMD160 hash algorithm.
  58. */
  59. var RIPEMD160 = C_algo.RIPEMD160 = Hasher.extend({
  60. _doReset: function () {
  61. this._hash = WordArray.create([0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0]);
  62. },
  63. _doProcessBlock: function (M, offset) {
  64. // Swap endian
  65. for (var i = 0; i < 16; i++) {
  66. // Shortcuts
  67. var offset_i = offset + i;
  68. var M_offset_i = M[offset_i];
  69. // Swap
  70. M[offset_i] = (
  71. (((M_offset_i << 8) | (M_offset_i >>> 24)) & 0x00ff00ff) |
  72. (((M_offset_i << 24) | (M_offset_i >>> 8)) & 0xff00ff00)
  73. );
  74. }
  75. // Shortcut
  76. var H = this._hash.words;
  77. var hl = _hl.words;
  78. var hr = _hr.words;
  79. var zl = _zl.words;
  80. var zr = _zr.words;
  81. var sl = _sl.words;
  82. var sr = _sr.words;
  83. // Working variables
  84. var al, bl, cl, dl, el;
  85. var ar, br, cr, dr, er;
  86. ar = al = H[0];
  87. br = bl = H[1];
  88. cr = cl = H[2];
  89. dr = dl = H[3];
  90. er = el = H[4];
  91. // Computation
  92. var t;
  93. for (var i = 0; i < 80; i += 1) {
  94. t = (al + M[offset+zl[i]])|0;
  95. if (i<16){
  96. t += f1(bl,cl,dl) + hl[0];
  97. } else if (i<32) {
  98. t += f2(bl,cl,dl) + hl[1];
  99. } else if (i<48) {
  100. t += f3(bl,cl,dl) + hl[2];
  101. } else if (i<64) {
  102. t += f4(bl,cl,dl) + hl[3];
  103. } else {// if (i<80) {
  104. t += f5(bl,cl,dl) + hl[4];
  105. }
  106. t = t|0;
  107. t = rotl(t,sl[i]);
  108. t = (t+el)|0;
  109. al = el;
  110. el = dl;
  111. dl = rotl(cl, 10);
  112. cl = bl;
  113. bl = t;
  114. t = (ar + M[offset+zr[i]])|0;
  115. if (i<16){
  116. t += f5(br,cr,dr) + hr[0];
  117. } else if (i<32) {
  118. t += f4(br,cr,dr) + hr[1];
  119. } else if (i<48) {
  120. t += f3(br,cr,dr) + hr[2];
  121. } else if (i<64) {
  122. t += f2(br,cr,dr) + hr[3];
  123. } else {// if (i<80) {
  124. t += f1(br,cr,dr) + hr[4];
  125. }
  126. t = t|0;
  127. t = rotl(t,sr[i]) ;
  128. t = (t+er)|0;
  129. ar = er;
  130. er = dr;
  131. dr = rotl(cr, 10);
  132. cr = br;
  133. br = t;
  134. }
  135. // Intermediate hash value
  136. t = (H[1] + cl + dr)|0;
  137. H[1] = (H[2] + dl + er)|0;
  138. H[2] = (H[3] + el + ar)|0;
  139. H[3] = (H[4] + al + br)|0;
  140. H[4] = (H[0] + bl + cr)|0;
  141. H[0] = t;
  142. },
  143. _doFinalize: function () {
  144. // Shortcuts
  145. var data = this._data;
  146. var dataWords = data.words;
  147. var nBitsTotal = this._nDataBytes * 8;
  148. var nBitsLeft = data.sigBytes * 8;
  149. // Add padding
  150. dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);
  151. dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = (
  152. (((nBitsTotal << 8) | (nBitsTotal >>> 24)) & 0x00ff00ff) |
  153. (((nBitsTotal << 24) | (nBitsTotal >>> 8)) & 0xff00ff00)
  154. );
  155. data.sigBytes = (dataWords.length + 1) * 4;
  156. // Hash final blocks
  157. this._process();
  158. // Shortcuts
  159. var hash = this._hash;
  160. var H = hash.words;
  161. // Swap endian
  162. for (var i = 0; i < 5; i++) {
  163. // Shortcut
  164. var H_i = H[i];
  165. // Swap
  166. H[i] = (((H_i << 8) | (H_i >>> 24)) & 0x00ff00ff) |
  167. (((H_i << 24) | (H_i >>> 8)) & 0xff00ff00);
  168. }
  169. // Return final computed hash
  170. return hash;
  171. },
  172. clone: function () {
  173. var clone = Hasher.clone.call(this);
  174. clone._hash = this._hash.clone();
  175. return clone;
  176. }
  177. });
  178. function f1(x, y, z) {
  179. return ((x) ^ (y) ^ (z));
  180. }
  181. function f2(x, y, z) {
  182. return (((x)&(y)) | ((~x)&(z)));
  183. }
  184. function f3(x, y, z) {
  185. return (((x) | (~(y))) ^ (z));
  186. }
  187. function f4(x, y, z) {
  188. return (((x) & (z)) | ((y)&(~(z))));
  189. }
  190. function f5(x, y, z) {
  191. return ((x) ^ ((y) |(~(z))));
  192. }
  193. function rotl(x,n) {
  194. return (x<<n) | (x>>>(32-n));
  195. }
  196. /**
  197. * Shortcut function to the hasher's object interface.
  198. *
  199. * @param {WordArray|string} message The message to hash.
  200. *
  201. * @return {WordArray} The hash.
  202. *
  203. * @static
  204. *
  205. * @example
  206. *
  207. * var hash = CryptoJS.RIPEMD160('message');
  208. * var hash = CryptoJS.RIPEMD160(wordArray);
  209. */
  210. C.RIPEMD160 = Hasher._createHelper(RIPEMD160);
  211. /**
  212. * Shortcut function to the HMAC's object interface.
  213. *
  214. * @param {WordArray|string} message The message to hash.
  215. * @param {WordArray|string} key The secret key.
  216. *
  217. * @return {WordArray} The HMAC.
  218. *
  219. * @static
  220. *
  221. * @example
  222. *
  223. * var hmac = CryptoJS.HmacRIPEMD160(message, key);
  224. */
  225. C.HmacRIPEMD160 = Hasher._createHmacHelper(RIPEMD160);
  226. }(Math));
  227. return CryptoJS.RIPEMD160;
  228. }));