用JavaScript实现MD5,SHA1加密

最新推荐文章于 2024-03-12 18:08:12 发布
最新推荐文章于 2024-03-12 18:08:12 发布
阅读量113 收藏
点赞数
分类专栏： JavaScript 文章标签： JavaScript C C++ C# J# ViewUI
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/doch2000/article/details/83328655
版权

在一般网站开发中,用户登陆的密码都是明码发送的,这样是很不安全的.   

解决方法:在提交前,用JavaScript将用户密码进行sha1或md5加密.下面是js源码

 

/*sha1   
* 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 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";    
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;    
}    
   
   
   
   
/*md5   
* A JavaScript implementation of the RSA Data Security, Inc. MD5 Message   
* Digest Algorithm, as defined in RFC 1321.   
* Version 2.1 Copyright (C) Paul Johnston 1999 - 2002.   
* Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet   
* Distributed under the BSD License   
* See http://pajhome.org.uk/crypt/md5 for more info.   
*/   
   
/*   
* 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_md5(s){ return binl2hex(core_md5(str2binl(s), s.length * chrsz));}    
function b64_md5(s){ return binl2b64(core_md5(str2binl(s), s.length * chrsz));}    
function str_md5(s){ return binl2str(core_md5(str2binl(s), s.length * chrsz));}    
function hex_hmac_md5(key, data) { return binl2hex(core_hmac_md5(key, data)); }    
function b64_hmac_md5(key, data) { return binl2b64(core_hmac_md5(key, data)); }    
function str_hmac_md5(key, data) { return binl2str(core_hmac_md5(key, data)); }    
   
/*   
* Perform a simple self-test to see if the VM is working   
*/   
function md5_vm_test()    
{    
return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72";    
}    
   
/*   
* Calculate the MD5 of an array of little-endian words, and a bit length   
*/   
function core_md5(x, len)    
{    
/* append padding */   
x[len >> 5] |= 0x80 << ((len) % 32);    
x[(((len + 64) >>> 9) << 4) + 14] = len;    
   
var a = 1732584193;    
var b = -271733879;    
var c = -1732584194;    
var d = 271733878;    
   
for(var i = 0; i < x.length; i += 16)    
{    
    var olda = a;    
    var oldb = b;    
    var oldc = c;    
    var oldd = d;    
   
    a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);    
    d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);    
    c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);    
    b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);    
    a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);    
    d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);    
    c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);    
    b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);    
    a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);    
    d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);    
    c = md5_ff(c, d, a, b, x[i+10], 17, -42063);    
    b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);    
    a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);    
    d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);    
    c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);    
    b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);    
   
    a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);    
    d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);    
    c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);    
    b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);    
    a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);    
    d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);    
    c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);    
    b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);    
    a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);    
    d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);    
    c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);    
    b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);    
    a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);    
    d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);    
    c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);    
    b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);    
   
    a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);    
    d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);    
    c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);    
    b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);    
    a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);    
    d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);    
    c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);    
    b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);    
    a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);    
    d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);    
    c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);    
    b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);    
    a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);    
    d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);    
    c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);    
    b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);    
   
    a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);    
    d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);    
    c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);    
    b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);    
    a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);    
    d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);    
    c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);    
    b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);    
    a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);    
    d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);    
    c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);    
    b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);    
    a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);    
    d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);    
    c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);    
    b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);    
   
    a = safe_add(a, olda);    
    b = safe_add(b, oldb);    
    c = safe_add(c, oldc);    
    d = safe_add(d, oldd);    
}    
return Array(a, b, c, d);    
   
}    
   
/*   
* These functions implement the four basic operations the algorithm uses.   
*/   
function md5_cmn(q, a, b, x, s, t)    
{    
return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b);    
}    
function md5_ff(a, b, c, d, x, s, t)    
{    
return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);    
}    
function md5_gg(a, b, c, d, x, s, t)    
{    
return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);    
}    
function md5_hh(a, b, c, d, x, s, t)    
{    
return md5_cmn(b ^ c ^ d, a, b, x, s, t);    
}    
function md5_ii(a, b, c, d, x, s, t)    
{    
return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);    
}    
   
/*   
* Calculate the HMAC-MD5, of a key and some data   
*/   
function core_hmac_md5(key, data)    
{    
var bkey = str2binl(key);    
if(bkey.length > 16) bkey = core_md5(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_md5(ipad.concat(str2binl(data)), 512 + data.length * chrsz);    
return core_md5(opad.concat(hash), 512 + 128);    
}    
   
/*   
* 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 bit_rol(num, cnt)    
{    
return (num << cnt) | (num >>> (32 - cnt));    
}    
   
/*   
* Convert a string to an array of little-endian words   
* If chrsz is ASCII, characters >255 have their hi-byte silently ignored.   
*/   
function str2binl(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) << (i%32);    
return bin;    
}    
   
/*   
* Convert an array of little-endian words to a string   
*/   
function binl2str(bin)    
{    
var str = "";    
var mask = (1 << chrsz) - 1;    
for(var i = 0; i < bin.length * 32; i += chrsz)    
    str += String.fromCharCode((bin[i>>5] >>> (i % 32)) & mask);    
return str;    
}    
   
/*   
* Convert an array of little-endian words to a hex string.   
*/   
function binl2hex(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] >> ((i%4)*8+4)) & 0xF) +    
           hex_tab.charAt((binarray[i>>2] >> ((i%4)*8 )) & 0xF);    
}    
return str;    
}    
   
/*   
* Convert an array of little-endian words to a base-64 string   
*/   
function binl2b64(binarray)    
{    
var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";    
var str = "";    
for(var i = 0; i < binarray.length * 4; i += 3)    
{    
    var triplet = (((binarray[i   >> 2] >> 8 * ( i   %4)) & 0xFF) << 16)    
                | (((binarray[i+1 >> 2] >> 8 * ((i+1)%4)) & 0xFF) << 8 )    
                | ((binarray[i+2 >> 2] >> 8 * ((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;    
}

 

 下面说说调用方法:
md5:
页面包含

<script type="text/javascript" src="md5.js"></script>

 调用

if (md5_vm_test()) {     
     document.getElementById('admin_pws').value = hex_md5(document.getElementById('admin_pws').value);     
}     
else {     
     alert("md5加密模块初始化失败");     
}

 

doch2000
关注
专栏目录
javascript:实现sha1算法(附完整源码)
希望我的博客，能帮上你解决学习中工作中所遇到的问题
08-28 663
javascript:实现sha1算法(附完整源码)
javascript实现base64 md5 sha1 密码加密
10-23
JavaScript中的密码加密通常涉及到几个常见的哈希算法，如Base64、MD5和SHA1，这些算法用于将数据转换成不可读的形式，提高安全性。在本文中，我们将深入理解这三种加密方法及其在JavaScript中的实现。 1. **Base64...
JS 使用 SHA1 加密示例
肖朋伟
02-28 4万+
JS 使用 SHA1 加密的示例 前言： 在前端向后端进行接口数据请求时，考虑到数据安全问题，所以会使用一些加密方式，虽然对大佬来说小菜一碟，但对绝大多数人来说还是很有用的，本篇介绍两种加密方式 SHA1 和 MD5 SHA1 加密示例 sha1.js 文件代码： function encodeUTF8(s) { var i, r = [], c, x; for (i = 0; i &amp;amp;...
sha1.js
weixin_30383279的博客
03-13 1403
function encodeUTF8(s) { var i, r = [], c, x; for (i = 0; i < s.length; i++) if ((c = s.charCodeAt(i)) < 0x80) r.push(c); else if (c < 0x800) r.push(0xC0 + (c >> 6 &...
JS实现SHA1
myCOMMUNICATION
08-18 1万+
测试为 西电912abc1.带输入框的cf893293634164e42df0bc0250cbcbffd04c2ec4 <!--/**//* * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined in FIPS PUB 180-1
js实现sha1加密算法
匹夫的博客
09-19 1万+
在实现页面通过js调用微信客户端扫码的api的时候需要用到sha1签名算法，所以在网上找了一圈，以下代码可用，直接调用hex_sha1就可以了 var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */ var chrsz = 8; /* bits per input character.
JS实现的base64加密、md5加密及sha1加密详解
10-22
主要介绍了JS实现的base64加密、md5加密及sha1加密的方法,结合实例形式详细分析了JavaScript各种常见加密方法与实现技巧,需要的朋友可以参考下
md5+sha1 js文件.zip
07-12
平时用的md5+sha1加密的js文件，用法： <script type="text/javascript" src="js/md5.js"> <script type="text/javascript" src="js/sha1.js"> var hash = hex_md5(name+" "+password); var date = new Date();//...
JS(javascript)-md5加密工具类
06-14
- **crypto-js**: 这是一个完整的JavaScript加密库，提供了MD5、SHA-1、SHA-256等多种哈希函数。使用时需要下载对应的库文件，然后通过`CryptoJS.MD5(data)`进行加密。 - **spark-md5**: 这是一个轻量级的MD5库，...
js-sha1实现SHA1加密
Army-海军的博客
08-18 1万+
实用工具常记录是个好习惯
sha1.js（js版sha1加密）
09-01
sha1.js（js版sha1加密）
hmac加密算法的JS文件hmac-sha1.js
04-13
hmac-sha1.js文件下载。通过js给对应字段进行hmac的sha1加密解密的操作。
Javascript 中sha1的实现
最新发布
Dreamweaver_Bob的博客
03-12 607
SHA-1（Secure Hash Algorithm 1）是一种密码哈希函数，它接受输入（通常是字符串），并生成一个固定大小（对于SHA-1是160位或20字节）的哈希值。这个哈希值通常表示为40个十六进制数字。SHA-1被广泛应用于许多安全应用中，包括数字签名和验证数据的完整性。SHA-1的实现原理相对复杂，涉及多个步骤和数学运算。然而，值得注意的是，SHA-1的安全性近年来受到了挑战。
js怎么实现hmacsha256_JS实现的base64加密、md5加密及sha1加密详解
weixin_33509203的博客
02-06 3611
本文实例讲述了JS实现的base64加密、md5加密及sha1加密。分享给大家供大家参考，具体如下：1、base64加密在页面中引入base64.js文件，调用方法为：base64加密var b = new Base64();var str = b.encode("admin:admin");alert("base64 encode:" + str);//解密str = b.decode(str)...
js的常见的三种密码加密方式-MD5加密、Base64加密和解密和sha1加密详解总结
热门推荐
红岸基地
05-15 8万+
写在前面写前端的时候，很多的时候是避免不了注册这一关的，但是一般的注册是没有任何的难度的，无非就是一些简单的获取用户输入的数据，然后进行简单的校验以后调用接口，将数据发送到后端，完成一个简单的注册的流程，那么一般来说，密码是不做加密的。但是也有一些数据库里面存放的是加密后的密码，这样有一个比较安全的地方在于，即使黑客将用户输入的文本密码得到了，也不知道具体是什么，因为密码是经过加密的。今天就简单的...
SHA-1算法简介及JavaScript实现
chengzhezhijian的专栏
05-06 1989
SHA-1算法简介及JavaScript实现 一、SHA-1算法简介 消息认证作为一种重要的安全技术如今已被广泛地应用于网络信息交换领域，它的根本作用是允许通信的当事人验证所接受的消息为可信消息。如果消息、文件、文档或者其他的数据集合是真实的数据并且来自所声称的数据源，那么称这些数据集合是可信的。而在消息认证技术中通常都会用到一类特殊的数学算法-哈希算法，它占有极其重要的地位。哈希算法也即散列
常见JavaScript加密算法、JS加密算法
qq_43762932的博客
06-05 6913
常见JavaScript加密算法、JS加密算法、常见JavaScript加密方法、JS加密方法
JS小工具（hmac-sha1加密）
disadministrator的专栏
08-18 1万+
hmac-sha1.js /* CryptoJS v3.1.2 code.google.com/p/crypto-js (c) 2009-2013 by Jeff Mott. All rights reserved. code.google.com/p/crypto-js/wiki/License */ var CryptoJS = CryptoJS || function(g, l) { ...
如何用 nodejs 进行 sha1 加密验证，微信公众号开发验证
学习笔记
01-05 1827
今天在摆弄微信公众号的时候，遇到这样一个问题：我的后台是 nodejs 写的，express框架，官方开发接入的验证代码是 php 写的，其中有一个部分是要将一个字符串进行sha1加密，那么 nodejs 如何加密呢？
JavaScript实现：Base64、MD5与SHA1加密详解
本篇将详细介绍如何使用JavaScript实现base64、md5以及sha1三种加密算法。 1. **Base64加密** Base64是一种用于在网络上传输二进制数据的编码方式。它将任意长度的字节序列转换为ASCII字符序列，使得这些数据可以...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值