H5 加密(MD5 Base64 sha1)

1. 说明

  很多的时候是避免不了注册登录这一关的,但是一般的注册是没有任何的难度的,无非就是一些简单的获取用户输入的数据,然后进行简单的校验以后调用接口,将数据发送到后端,完成一个简单的注册的流程,那么一般来说,密码是不做加密的。但是也有一些数据库里面存放的是加密后的密码,这样有一个比较安全的地方在于,即使黑客将用户输入的文本密码得到了,也不知道具体是什么,因为密码是经过加密的。
  js的加密没特别多的办法,常见的就三种, MD5加密、Base64加密和shal加密,那么今天就将这三种的用法写一下。

2. MD5

2.1. md5.js

/*
 * 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;
}
/**使用 方法 : hex_md5("123456");
 * 最好用 用户名(手机号)和密码同时 加密产生密文,这样存在数据库里的相同密码的密文就不一样了
*/

2.2. test.html

 <script type="text/javascript" src="../static/helper/crypto-js.js"></script>
 <script type="text/javascript">
    console.log('MD5加密', hex_md5("123456"));
</script>

在这里插入图片描述

3. base64

3.1. base64.js

**var Base64=
	{
   
		_keyStr:"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=",
		encode:function(e){
   
			var t="";
			var n,r,i,s,o,u,a;
			var f=0;
			e=Base64._utf8_encode(e);
			while(f<e.length){
   
				n=e.charCodeAt(f++);
				r=e.charCodeAt(f++);
				i=e.charCodeAt(f++);
				s=n>>2;
				o=(n&3)<<4|r>>4;
				u=(r&15)<<2|i>>6;
				a=i&63;
				if(isNaN(r)){
   
					u=a=64
				}else if(isNaN(i)){
   
					a=64
				}
				t=t+this._keyStr.charAt(s)+this._keyStr.charAt(o)+this._keyStr.charAt(u)+this._keyStr.charAt(a)
			}
			return t
		},
		decode:function(e){
   
			var t="";
			var n,r,i;
			var s,o,u,a;
			var f=0;
			e=e.replace(/[^A-Za-z0-9+/=]/g,"");
			while(f<e.length){
   
				s=this._keyStr.indexOf(e.charAt(f++));
				o=this._keyStr.indexOf(e.charAt(f++));
				u=this._keyStr.indexOf(e.charAt(f++));
				a=this._keyStr.indexOf(e.charAt(f++));
				n=s<<2|o>>4;
				r=(o&15)<<4|u>>2;
				i=(u&3)<<6|a;
				t=t+String.fromCharCode(n);
				if(u!=64){
   
					t=t+String.fromCharCode(r)
				}
				if(a!=64){
   
					t=t+String.fromCharCode(i)
				}
			}
			t=Base64._utf8_decode(t);
			return t
		},
		_utf8_encode:function(e){
   
			e=e.replace(/rn/g,"n");
			var t="";
			for(var n=0;n<e.length;n++){
   
				var r=e.charCodeAt(n);
				if(r<128){
   
					t+=String.fromCharCode(r)
				}else if(r>127&&r<2048){
   
					t+=String.fromCharCode(r>>6|192);
					t+=String.fromCharCode(r&63|128)
				}else{
   
					t+=String.fromCharCode(r>>12|224);
					t+=String.fromCharCode(r>>6&63|128);
					t+=String.fromCharCode(r&63|128)
				}
			}
			return t
		},
		_utf8_decode:function(e){
   
			var t="";
			var n=0;
			var r=c1=c2=0;
			while(n<e.length){
   
				r=e.charCodeAt(n);
				if(r<128){
   
					t+=String.fromCharCode(r);
					n++
				}else if(r>191&&r<224){
   
					c2=e.charCodeAt(n+1);
					t+=String.fromCharCode((r&31)<<6|c2&63);
					n+=2
				}else{
   
					c2=e.charCodeAt(n+1);
					c3=e.charCodeAt(n+2);
					t+=String.fromCharCode((r&15)<<12|(c2&63)<<6|c3&63);
					n+=3
				}
			}
			return t
		}
	};
**

3.2. test.html

 <script type="text/javascript" src="../static/helper/base64.js"></script>
 var password = "123456";
    var encypass = Base64.encode(password);
    var decryptpass = Base64.decode(encypass);
    if(e == 1){
   
        console.log("加密之前的密码是:"+password);
        console.log("加密之后的结果是:"+encypass);
    }
    else if(e == 2){
   
        console.log("解密之前的结果是:"+encypass);
        console.log("解密之后的结果是:"+decryptpass);
    }

在这里插入图片描述

4. sha1

4.1. sha1.js

var hexcase = 0; /* 十六进制输出格式。0 -小写;1 -大写 */
var b64pad = ""; /* base- 64填充字符。“=”表示严格的RFC合规性 */
var chrsz = 8; /* 每个输入字符的位数。8 - ASCII;16 -统一码 */
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));
}
function sha1_vm_test() {
   
	return hex_sha1("abc") == "a9993e364706816aba3e25717850c26c9cd0d89d";
}
function core_sha1(x, len) {
   
	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);

}
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;
}
function sha1_kt(t) {
   
	return (t < 20) ? 1518500249 : (t < 40) ? 1859775393 : (t < 60) ? -1894007588 : -899497514;
}
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);
}
function safe_add(x, y) {
   
	var lsw = (x & 0xFFFF) + (y & 0xFFFF);
	var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
	return (msw << 16) | (lsw & 0xFFFF);
}
function rol(num, cnt) {
   
	return (num << cnt) | (num >>> (32 - cnt));
}
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) << (24 - i % 32);
	return bin;
}
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] >>> (24 - i % 32)) & mask);
	return str;
}
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;
}
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;
}

4.2. test.html

 <script type="text/javascript" src="../static/helper/sha1.js"></script>
 var password = "123456";
    console.log("没有加密之前的是:" + password);
    var shalpassword = hex_sha1(password);
    console.log("hex_sha1方式加密后是:" + shalpassword);
    var shalpassword = b64_sha1(password);
    console.log("b64_sha1方式加密后是:" + shalpassword);
    var shalpassword = str_sha1(password);
    console.log("str_sha1方式加密后是:" + shalpassword);

在这里插入图片描述

相关推荐

  1. 【.NET】MD5加密

    2024-02-04 21:08:01       40 阅读
  2. <span style='color:red;'>MD</span><span style='color:red;'>5</span><span style='color:red;'>加密</span>

    MD5加密

    2024-02-04 21:08:01      17 阅读
  3. c# MD5加密函数

    2024-02-04 21:08:01       16 阅读
  4. 前端加密后端校验(MD5

    2024-02-04 21:08:01       44 阅读

最近更新

  1. TCP协议是安全的吗?

    2024-02-04 21:08:01       16 阅读
  2. 阿里云服务器执行yum,一直下载docker-ce-stable失败

    2024-02-04 21:08:01       16 阅读
  3. 【Python教程】压缩PDF文件大小

    2024-02-04 21:08:01       15 阅读
  4. 通过文章id递归查询所有评论(xml)

    2024-02-04 21:08:01       18 阅读

热门阅读

  1. C语言:简单排序

    2024-02-04 21:08:01       30 阅读
  2. Chapter 8 - 4. Congestion Management in TCP Storage Networks

    2024-02-04 21:08:01       31 阅读
  3. 力扣:77. 组合

    2024-02-04 21:08:01       29 阅读
  4. sql数据库修复资料

    2024-02-04 21:08:01       22 阅读
  5. 题目 1159: 偶数求和

    2024-02-04 21:08:01       25 阅读
  6. 海量微服务关联关系挖掘与告警拓扑展示

    2024-02-04 21:08:01       27 阅读
  7. React中的事件处理逻辑

    2024-02-04 21:08:01       30 阅读
  8. WiFi测试的核心思路和主要工具

    2024-02-04 21:08:01       27 阅读