希米日志

主页
目录
闲谈 代码 笔记 软件 分享
归档 留言 友人 关于

【VB】标准md5加密算法
59 0

程序代码

'在窗体中加入一个WebBrowser控件，然后在窗体加载事件中加入以下代码

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

   2016-11-08 17:52:00
二维码

 评论: 0

正在加载验证码......

请先完成验证

目 录

主页
评论