茄子在线看片免费人成视频,午夜福利精品a在线观看,国产高清自产拍在线观看,久久综合久久狠狠综合

    <s id="ddbnn"></s>
  • <sub id="ddbnn"><ol id="ddbnn"></ol></sub>

  • <legend id="ddbnn"></legend><s id="ddbnn"></s>

    asp實(shí)現(xiàn)的sha1加密解密代碼(和C#兼容)
    來(lái)源:易賢網(wǎng) 閱讀:2059 次 日期:2014-08-15 16:44:25
    溫馨提示:易賢網(wǎng)小編為您整理了“asp實(shí)現(xiàn)的sha1加密解密代碼(和C#兼容)”,方便廣大網(wǎng)友查閱!

    在百度找的幾個(gè)asp sha1(vbs寫(xiě)的)加密結(jié)果和asp.net的sha1加密結(jié)果不一樣,asp.net sha1加密完后是40位,網(wǎng)上找的asp sha1加密是64位,還以為asp.net做了截?。ㄈ缇W(wǎng)上的asp的md5機(jī)密和asp.net位數(shù)不一樣,是做了截取的問(wèn)題),但是asp的64位加密結(jié)果并沒(méi)有包含asp.net的40位結(jié)果,看來(lái)找到的版本和asp.net的加密算法不一樣。

    最后還是靠翻墻用google找到了一個(gè)js版本的sha1加密代碼結(jié)合asp使用后結(jié)果和asp.net的sha1加密一模一樣。。看來(lái)技術(shù)類的文字用度娘還是搞不過(guò)谷歌啊。。隨便fuck下中國(guó)的防火墻。。谷歌也給封了。

    asp sha1加密源代碼如下,和asp.net的sha1加密結(jié)果一致:

    代碼如下:

    <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());

    }

    圖片一

    更多信息請(qǐng)查看IT技術(shù)專欄

    更多信息請(qǐng)查看網(wǎng)絡(luò)編程
    易賢網(wǎng)手機(jī)網(wǎng)站地址:asp實(shí)現(xiàn)的sha1加密解密代碼(和C#兼容)
    由于各方面情況的不斷調(diào)整與變化,易賢網(wǎng)提供的所有考試信息和咨詢回復(fù)僅供參考,敬請(qǐng)考生以權(quán)威部門(mén)公布的正式信息和咨詢?yōu)闇?zhǔn)!

    2026國(guó)考·省考課程試聽(tīng)報(bào)名

    • 報(bào)班類型
    • 姓名
    • 手機(jī)號(hào)
    • 驗(yàn)證碼
    關(guān)于我們 | 聯(lián)系我們 | 人才招聘 | 網(wǎng)站聲明 | 網(wǎng)站幫助 | 非正式的簡(jiǎn)要咨詢 | 簡(jiǎn)要咨詢須知 | 新媒體/短視頻平臺(tái) | 手機(jī)站點(diǎn) | 投訴建議
    工業(yè)和信息化部備案號(hào):滇ICP備2023014141號(hào)-1 云南省教育廳備案號(hào):云教ICP備0901021 滇公網(wǎng)安備53010202001879號(hào) 人力資源服務(wù)許可證:(云)人服證字(2023)第0102001523號(hào)
    云南網(wǎng)警備案專用圖標(biāo)
    聯(lián)系電話:0871-65099533/13759567129 獲取招聘考試信息及咨詢關(guān)注公眾號(hào):hfpxwx
    咨詢QQ:1093837350(9:00—18:00)版權(quán)所有:易賢網(wǎng)
    云南網(wǎng)警報(bào)警專用圖標(biāo)