A unf. social network done poorly.
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.

257 lines
8.6KB

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