zoukankan      html  css  js  c++  java
  • 加密与解密

    引入该js ,可对字符串进行加密

    function PwdEncryption() {
    
        // private property
        _keyStr = "fhgjdlfghsjdf#$%^&f,md^*()()";
    
        // 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;
        }
    
        // public method for decoding
        this.decode = function (input) {
            var output = "";
            var chr1, chr2, chr3;
            var enc1, enc2, enc3, enc4;
            var i = 0;
            input = input.replace(/[^A-Za-z0-9+/=]/g, "");
            while (i < input.length) {
                enc1 = _keyStr.indexOf(input.charAt(i++));
                enc2 = _keyStr.indexOf(input.charAt(i++));
                enc3 = _keyStr.indexOf(input.charAt(i++));
                enc4 = _keyStr.indexOf(input.charAt(i++));
                chr1 = (enc1 << 2) | (enc2 >> 4);
                chr2 = ((enc2 & 15) << 4) | (enc3 >> 2);
                chr3 = ((enc3 & 3) << 6) | enc4;
                output = output + String.fromCharCode(chr1);
                if (enc3 != 64) {
                    output = output + String.fromCharCode(chr2);
                }
                if (enc4 != 64) {
                    output = output + String.fromCharCode(chr3);
                }
            }
            output = _utf8_decode(output);
            return output;
        }
    
        // private method for UTF-8 encoding
        _utf8_encode = function (string) {
            string = string.replace(/
    /g,"
    ");
            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;
        }
    
        // private method for UTF-8 decoding
        _utf8_decode = function (utftext) {
            var string = "";
            var i = 0;
            var c = c1 = c2 = 0;
            while ( i < utftext.length ) {
                c = utftext.charCodeAt(i);
                if (c < 128) {
                    string += String.fromCharCode(c);
                    i++;
                } else if((c > 191) && (c < 224)) {
                    c2 = utftext.charCodeAt(i+1);
                    string += String.fromCharCode(((c & 31) << 6) | (c2 & 63));
                    i += 2;
                } else {
                    c2 = utftext.charCodeAt(i+1);
                    c3 = utftext.charCodeAt(i+2);
                    string += String.fromCharCode(((c & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63));
                    i += 3;
                }
            }
            return string;
        }
    
        this.xor = function ff(keys,pwd) {
            var last = "";
            for (i = 0;i < pwd.length;i++){
                var key = keys.charCodeAt(i%pwd.length);
                var encodepwd = pwd.charCodeAt(i) ^ key;
                last += String.fromCharCode(encodepwd);
            }
            return last;
        }
    }
    
     var pwdEncryption = new PwdEncryption();
     var key = "testencode";
     var pwd = "testpwd";
     //异或加密
     var lastPwd = pwdEncryption.xor(key,pwd);
     //Base64加密
     pwd = pwdEncryption.encode(lastPwd);
    

    后端java解密

    //获取加密后字符串
    String srcStr= getSrc();
    //base64解密
    byte[] pwd = Base64.getDecoder().decode(pwdstr);
    //异或解密
    byte[] plainBytes = XORUtils.encrypt(pwd, "testcode".getBytes());
    //将解密后字符数组转换为字符串
    String lastPwd = new  String(plainBytes);
    

    后端java加密

    //加密后字符串
    String pwdstr = getSrc();
    //异或加密
    byte[] plainBytes = XORUtils.encrypt(pwdstr.getBytes(), "testcode".getBytes());
    //base64解密
    byte[] lastPwdBytes =Base64.getEncoder().encode(plainBytes);
    String lastPwd = new String(lastPwdBytes);
    
    
    //异或加密/解密
    public static byte[] xorDecrypt(byte[] dec) {
            int size = dec.length;
            int i, j;
            for (i = 0, j = 0; i < size; i++, j++) {
                if (j == keyBytes.length)
                    j = 0;
                dec[i] = (byte) (dec[i] ^ keyBytes[j]);
            }
            return dec;
        }
    

    大家有兴趣也可以关注我的公众号查看文章。

  • 相关阅读:
    PyCharm 2018 最新激活方式总结(最新最全最有效)!!!
    Python入门编程中的变量、字符串以及数据类型
    用列主元消去法分别解方程组Ax=b,用MATLAB程序实现(最有效版)
    ISE 14.7安装教程最新版(Win10安装)——解决Win10安装完后打不开快捷方式的方法
    Python零基础入门必知
    Python安装教程最新版
    MATLAB实现连续周期信号的频谱分析(正余弦波信号举例)
    Android 基于帧布局实现一个进度条 FrameLayout+ProgressBar
    Android 使用RadioGroup和RadioButton实现单选效果
    Android 使用CheckBox实现多选效果
  • 原文地址:https://www.cnblogs.com/caozz/p/encryption.html
Copyright © 2011-2022 走看看