首页后端开发ASP.NETasp实现的sha1加密解密代码(和C#兼容)

asp实现的sha1加密解密代码(和C#兼容)

时间2024-02-07 16:05:03发布访客分类ASP.NET浏览643
导读:收集整理的这篇文章主要介绍了asp实现的sha1加密解密代码(和C#兼容),觉得挺不错的,现在分享给大家,也给大家做个参考。 在百度找的几个asp sha1(vbS写的)加密结果和asp...
收集整理的这篇文章主要介绍了asp实现的sha1加密解密代码(和C#兼容),觉得挺不错的,现在分享给大家,也给大家做个参考。

在百度找的几个asp sha1(vbS写的)加密结果和asp.net的sha1加密结果不一样,asp.net sha1加密完后是40位,网上找的asp sha1加密是64位,还以为asp.net做了截取(如网上的asp的md5机密和asp.net位数不一样,是做了截取的问题),但是asp的64位加密结果并没有包含asp.net的40位结果,看来找到的版本和asp.net的加密算法不一样。
 
最后还是靠翻墙用GOOGLE找到了一个js版本的sha1加密代码结合asp使用后结果和asp.net的sha1加密一模一样。。看来技术类的文字用度娘还是搞不过谷歌啊。。随便fuck下中国的防火墙。。谷歌也给封了。
 
asp sha1加密源代码如下,和asp.net的sha1加密结果一致:

复制代码 代码如下:
script language="javascript" tyPE="text/javascript" runat="server">
/*
 * A JavaScript implementation of the Secure Hash AlgorIThm, SHA-1, as defined
 * in FIPS Pub 180-1
 * Version 2.1a Copyright Paul Johnston 2000 - 2002.
 * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
 * Distributed under the BSD License
 * See http://pajhome.org.uk/crypt/md5 for details.
 */
/*
 * configurable VARiables. You may need to tweak these to be compatible with
 * the server-side, but the defaults work in most cases.
 */
var hexcase = 0;   /* hex output format. 0 - lowercase; 1 - uppercase        */
var b64pad  = "="; /* base-64 pad character. "=" for strict Rfc compliance   */
var chrsz   = 8;   /* bits per input character. 8 - ASCII; 16 - Unicode      */
/*
 * These are the functions you'll usually want to call
 * They take string arguments and return either hex or base-64 encoded strings
 */
function hex_sha1(s){ return binb2hex(core_sha1(str2binb(s),s.length * chrsz)); }
function b64_sha1(s){ return binB2B64(core_sha1(str2binb(s),s.length * chrsz)); }
function str_sha1(s){ return binb2str(core_sha1(str2binb(s),s.length * chrsz)); }
function hex_hmac_sha1(key, data){ return binb2hex(core_hmac_sha1(key, data)); }
function b64_hmac_sha1(key, data){ return binb2b64(core_hmac_sha1(key, data)); }
function str_hmac_sha1(key, data){ return binb2str(core_hmac_sha1(key, data)); }
/*
 * Perform a simple self-test to see if the VM is working
 */
function sha1_vm_test()
{
  return hex_sha1("abc") == "a9993e364706816aba3e25717850c26c9cd0d89d";
}
/*
 * Calculate the SHA-1 of an array of Big-endian words, and a bit length
 */
function core_sha1(x, len)
{
  /* append padding */
  x[len > > 5] |= 0x80 (24 - len % 32);
  x[((len + 64 > > 9) 4) + 15] = len;
  var w = Array(80);
  var a =  1732584193;
  var b = -271733879;
  var c = -1732584194;
  var d =  271733878;
  var e = -1009589776;
  for(var i = 0; i x.length; i += 16)
  {
    var olda = a;
    var oldb = b;
    var oldc = c;
    var oldd = d;
    var olde = e;
    for(var j = 0; j 80; j++)
    {
      if(j 16) w[j] = x[i + j];
      else w[j] = rol(w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16], 1);
      var t = safe_add(safe_add(rol(a, 5), sha1_ft(j, b, c, d)),
                       safe_add(safe_add(e, w[j]), sha1_kt(j)));
      e = d;
      d = c;
      c = rol(b, 30);
      b = a;
      a = t;
    }
    a = safe_add(a, olda);
    b = safe_add(b, oldb);
    c = safe_add(c, oldc);
    d = safe_add(d, oldd);
    e = safe_add(e, olde);
  }
  return Array(a, b, c, d, e);
}
/*
 * Perform the apPRopriate triplet combination function for the current
 * iteration
 */
function sha1_ft(t, b, c, d)
{
  if(t 20) return (b & c) | ((~b) & d);
  if(t 40) return b ^ c ^ d;
  if(t 60) return (b & c) | (b & d) | (c & d);
  return b ^ c ^ d;
}
/*
 * Determine the appropriate additive constant for the current iteration
 */
function sha1_kt(t)
{
  return (t 20) ?  1518500249 : (t 40) ?  1859775393 :
         (t 60) ? -1894007588 : -899497514;
}
/*
 * Calculate the HMAC-SHA1 of a key and some data
 */
function core_hmac_sha1(key, data)
{
  var bkey = str2binb(key);
  if(bkey.length > 16) bkey = core_sha1(bkey, key.length * chrsz);
  var ipad = Array(16), opad = Array(16);
  for(var i = 0; i 16; i++)
  {
    ipad[i] = bkey[i] ^ 0x36363636;
    opad[i] = bkey[i] ^ 0x5C5C5C5C;
  }
  var hash = core_sha1(ipad.concat(str2binb(data)), 512 + data.length * chrsz);
  return core_sha1(opad.concat(hash), 512 + 160);
}
/*
 * Add integers, wrapping at 2^32. This uses 16-bit operations internally
 * to work around bugs in some JS interpreters.
 */
function safe_add(x, y)
{
  var lsw = (x & 0xFFFF) + (y & 0xFFFF);
  var msw = (x > > 16) + (y > > 16) + (lsw > > 16);
  return (msw 16) | (lsw & 0xFFFF);
}
/*
 * Bitwise rotate a 32-bit number to the left.
 */
function rol(num, cnt)
{
  return (num cnt) | (num > > > (32 - cnt));
}
/*
 * Convert an 8-bit or 16-bit string to an array of big-endian words
 * In 8-bit function, characters > 255 have their hi-byte silently ignored.
 */
function str2binb(str)
{
  var bin = Array();
  var mask = (1 chrsz) - 1;
  for(var i = 0; i str.length * chrsz; i += chrsz)
    bin[i> > 5] |= (str.charCodeAt(i / chrsz) & mask) (32 - chrsz - i%32);
  return bin;
}
/*
 * Convert an array of big-endian words to a string
 */
function binb2str(bin)
{
  var str = "";
  var mask = (1 chrsz) - 1;
  for(var i = 0; i bin.length * 32; i += chrsz)
    str += String.FromCharCode((bin[i> > 5] > > > (32 - chrsz - i%32)) & mask);
  return str;
}
/*
 * Convert an array of big-endian words to a hex string.
 */
function binb2hex(binarray)
{
  var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
  var str = "";
  for(var i = 0; i binarray.length * 4; i++)
  {
    str += hex_tab.charAt((binarray[i> > 2] > > ((3 - i%4)*8+4)) & 0xF) +
           hex_tab.charAt((binarray[i> > 2] > > ((3 - i%4)*8  )) & 0xF);
  }
  return str;
}
/*
 * Convert an array of big-endian words to a base-64 string
 */
function binb2b64(binarray)
{
  var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwx  yz0123456789+/";
  var str = "";
  for(var i = 0; i binarray.length * 4; i += 3)
  {
    var triplet = (((binarray[i   > > 2] > > 8 * (3 -  i   %4)) & 0xFF) 16)
                | (((binarray[i+1 > > 2] > > 8 * (3 - (i+1)%4)) & 0xFF) 8 )
                |  ((binarray[i+2 > > 2] > > 8 * (3 - (i+2)%4)) & 0xFF);
    for(var j = 0; j 4; j++)
    {
      if(i * 8 + j * 6 > binarray.length * 32) str += b64pad;
      else str += tab.charAt((triplet > > 6*(3-j)) & 0x3F);
    }
  }
  return str;
}
/script>
%
function Sha1(Data)
    Sha1 = hex_sha1(Data)
end function
%>
%
Response.Write(Sha1("abcdef"))
%>

复制代码 代码如下:
public void ProcessRequest(HttpContext context)
    {
        context.Response.Write(System.Web.Security.FormsAuthentication.HashPassworDForStoringinConfigFile("abcdef", "SHA1").ToLower());
    }

您可能感兴趣的文章:
  • 浅谈C#中Md5和Sha1两种加密方式
  • c# 实现MD5,SHA1,SHA256,SHA512等常用加密算法源代码
  • C# 实现对PPT文档加密、解密及重置密码的操作方法
  • C# 批量生成随机密码必须包含数字和字母并用加密算法加密
  • C#使用 Salt + Hash 来为密码加密
  • 基于C#对用户密码使用MD5加密与解密
  • C#使用伪随机数实现加密用户密码的方法
  • C# 使用SHA1算法对密码进行加密

声明:本文内容由网友自发贡献,本站不承担相应法律责任。对本内容有异议或投诉,请联系2913721942#qq.com核实处理,我们将尽快回复您,谢谢合作!


若转载请注明出处: asp实现的sha1加密解密代码(和C#兼容)
本文地址: https://pptw.com/jishu/604257.html
asp执行带参数的sql语句实例 JScript中调用ActiveX获取访客网卡MAC地址实现代码

游客 回复需填写必要信息