加入收藏 | 设为首页 | 会员中心 | 我要投稿 李大同 (https://www.lidatong.com.cn/)- 科技、建站、经验、云计算、5G、大数据,站长网!
当前位置: 首页 > 综合聚焦 > 服务器 > 安全 > 正文

angular进行md5加密

发布时间:2020-12-17 09:35:21 所属栏目:安全 来源:网络整理
导读:1、引入文件encrypt.js 2、注入模块 var DiagnoseApp = angular. module ( 'DiagnoseApp' ,[ 'ui.router' , 'ngCookies' , 'ngFileUpload' , 'Encrypt' ]); 3、引用 DiagnoseApp.controller( 'NavbarCtrl' , function ( $scope , $rootScope , $http , $loca

1、引入文件encrypt.js
2、注入模块

var DiagnoseApp = angular.module('DiagnoseApp',['ui.router','ngCookies','ngFileUpload','Encrypt']);

3、引用

DiagnoseApp.controller('NavbarCtrl',function($scope,$rootScope,$http,$location,$timeout,$interval,Md5,Base64,Sha1) {
  // MD5加密当前日期
  $scope.md5Value=Md5.hex_md5(new Date());
})

encrypt.js 文件内容如下:

/** * * @authors lsmife (you@example.org) * @date 2017-02-28 00:28:54 * @version $Id$ */

var encrypt = angular.module('Encrypt',[]);
encrypt.service('Md5',function(){
    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 */
    /** * 供外部调用的方法 */
    this.hex_md5 = function(s) {

        return binl2hex(core_md5(str2binl(s),s.length * chrsz));
    }
    /* * 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,x[i+ 1],12,-389564586);
        c = md5_ff(c,x[i+ 2],17,606105819);
        b = md5_ff(b,x[i+ 3],22,-1044525330);
        a = md5_ff(a,x[i+ 4],-176418897);
        d = md5_ff(d,x[i+ 5],1200080426);
        c = md5_ff(c,x[i+ 6],-1473231341);
        b = md5_ff(b,x[i+ 7],-45705983);
        a = md5_ff(a,x[i+ 8],1770035416);
        d = md5_ff(d,x[i+ 9],-1958414417);
        c = md5_ff(c,x[i+10],-42063);
        b = md5_ff(b,x[i+11],-1990404162);
        a = md5_ff(a,x[i+12],1804603682);
        d = md5_ff(d,x[i+13],-40341101);
        c = md5_ff(c,x[i+14],-1502002290);
        b = md5_ff(b,x[i+15],1236535329);

        a = md5_gg(a,5,-165796510);
        d = md5_gg(d,9,-1069501632);
        c = md5_gg(c,14,643717713);
        b = md5_gg(b,20,-373897302);
        a = md5_gg(a,-701558691);
        d = md5_gg(d,38016083);
        c = md5_gg(c,-660478335);
        b = md5_gg(b,-405537848);
        a = md5_gg(a,568446438);
        d = md5_gg(d,-1019803690);
        c = md5_gg(c,-187363961);
        b = md5_gg(b,1163531501);
        a = md5_gg(a,-1444681467);
        d = md5_gg(d,-51403784);
        c = md5_gg(c,1735328473);
        b = md5_gg(b,-1926607734);

        a = md5_hh(a,4,-378558);
        d = md5_hh(d,11,-2022574463);
        c = md5_hh(c,16,1839030562);
        b = md5_hh(b,23,-35309556);
        a = md5_hh(a,-1530992060);
        d = md5_hh(d,1272893353);
        c = md5_hh(c,-155497632);
        b = md5_hh(b,-1094730640);
        a = md5_hh(a,681279174);
        d = md5_hh(d,-358537222);
        c = md5_hh(c,-722521979);
        b = md5_hh(b,76029189);
        a = md5_hh(a,-640364487);
        d = md5_hh(d,-421815835);
        c = md5_hh(c,530742520);
        b = md5_hh(b,-995338651);

        a = md5_ii(a,6,-198630844);
        d = md5_ii(d,10,1126891415);
        c = md5_ii(c,15,-1416354905);
        b = md5_ii(b,21,-57434055);
        a = md5_ii(a,1700485571);
        d = md5_ii(d,-1894986606);
        c = md5_ii(c,-1051523);
        b = md5_ii(b,-2054922799);
        a = md5_ii(a,1873313359);
        d = md5_ii(d,-30611744);
        c = md5_ii(c,-1560198380);
        b = md5_ii(b,1309151649);
        a = md5_ii(a,-145523070);
        d = md5_ii(d,-1120210379);
        c = md5_ii(c,718787259);
        b = md5_ii(b,-343485551);

        a = safe_add(a,olda);
        b = safe_add(b,oldb);
        c = safe_add(c,oldc);
        d = safe_add(d,oldd);
      }
      return Array(a,d);
    }

    function md5_cmn(q,x,s,t) {
            return safe_add(bit_rol(safe_add(safe_add(a,q),safe_add(x,t)),s),b);
        }

    function md5_ff(a,t) {
        return md5_cmn((b & c) | ((~b) & d),t);
    }

    function md5_gg(a,t) {
        return md5_cmn((b & d) | (c & (~d)),t);
    }

    function md5_hh(a,t) {
        return md5_cmn(b ^ c ^ d,t);
    }

    function md5_ii(a,t) {
        return md5_cmn(c ^ (b | (~d)),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;
    }
}).
service('Base64',function(){
    _keyStr = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";

    // public method for encoding
    this.encode = function (input) {
        var output = "";
        var chr1,chr2,chr3,enc1,enc2,enc3,enc4;
        var i = 0;
        input = _utf8_encode(input);
        while (i < input.length) {
            chr1 = input.charCodeAt(i++);
            chr2 = input.charCodeAt(i++);
            chr3 = input.charCodeAt(i++);
            enc1 = chr1 >> 2;
            enc2 = ((chr1 & 3) << 4) | (chr2 >> 4);
            enc3 = ((chr2 & 15) << 2) | (chr3 >> 6);
            enc4 = chr3 & 63;
            if (isNaN(chr2)) {
                enc3 = enc4 = 64;
            } else if (isNaN(chr3)) {
                enc4 = 64;
            }
            output = output +
            _keyStr.charAt(enc1) + _keyStr.charAt(enc2) +
            _keyStr.charAt(enc3) + _keyStr.charAt(enc4);
        }
        return output;
    }


    // private method for UTF-8 encoding
    _utf8_encode = function (string) {
        string = string.replace(/rn/g,"n");
        var utftext = "";
        for (var n = 0; n < string.length; n++) {
            var c = string.charCodeAt(n);
            if (c < 128) {
                utftext += String.fromCharCode(c);
            } else if((c > 127) && (c < 2048)) {
                utftext += String.fromCharCode((c >> 6) | 192);
                utftext += String.fromCharCode((c & 63) | 128);
            } else {
                utftext += String.fromCharCode((c >> 12) | 224);
                utftext += String.fromCharCode(((c >> 6) & 63) | 128);
                utftext += String.fromCharCode((c & 63) | 128);
            }
        }
        return utftext;
    }
}).
service('Sha1',function(){
    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 */

    /* * 供外部调用的方法 */
    this.hex_sha1 = function (s) {
        return binb2hex(core_sha1(str2binb(s),s.length * chrsz));
    }
    /* * 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,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,e);

    }  
})

(编辑:李大同)

【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容!

    推荐文章
      热点阅读