• 数据请求加密


      1 /*
      2 * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message
      3 * Digest Algorithm, as defined in RFC 1321.
      4 * Version 2.1 Copyright (C) Paul Johnston 1999 - 2002.
      5 * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
      6 * Distributed under the BSD License
      7 * See http://pajhome.org.uk/crypt/md5 for more info.
      8 */
      9 
     10 /*
     11 * Configurable variables. You may need to tweak these to be compatible with
     12 * the server-side, but the defaults work in most cases.
     13 */
     14 var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */
     15 var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */
     16 var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */
     17 
     18 /*
     19 * These are the functions you'll usually want to call
     20 * They take string arguments and return either hex or base-64 encoded strings
     21 */
     22 function hex_md5(s) { return binl2hex(core_md5(str2binl(s), s.length * chrsz)); }
     23 function b64_md5(s) { return binl2b64(core_md5(str2binl(s), s.length * chrsz)); }
     24 function str_md5(s) { return binl2str(core_md5(str2binl(s), s.length * chrsz)); }
     25 function hex_hmac_md5(key, data) { return binl2hex(core_hmac_md5(key, data)); }
     26 function b64_hmac_md5(key, data) { return binl2b64(core_hmac_md5(key, data)); }
     27 function str_hmac_md5(key, data) { return binl2str(core_hmac_md5(key, data)); }
     28 
     29 /*
     30 * Perform a simple self-test to see if the VM is working
     31 */
     32 function md5_vm_test() {
     33 return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72";
     34 }
     35 
     36 /*
     37 * Calculate the MD5 of an array of little-endian words, and a bit length
     38 */
     39 function core_md5(x, len) {
     40 /* append padding */
     41 x[len >> 5] |= 0x80 << ((len) % 32);
     42 x[(((len + 64) >>> 9) << 4) + 14] = len;
     43 
     44 var a = 1732584193;
     45 var b = -271733879;
     46 var c = -1732584194;
     47 var d = 271733878;
     48 
     49 for (var i = 0; i < x.length; i += 16) {
     50 var olda = a;
     51 var oldb = b;
     52 var oldc = c;
     53 var oldd = d;
     54 
     55 a = md5_ff(a, b, c, d, x[i + 0], 7, -680876936);
     56 d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);
     57 c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);
     58 b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);
     59 a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);
     60 d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);
     61 c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);
     62 b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);
     63 a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);
     64 d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);
     65 c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);
     66 b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);
     67 a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);
     68 d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);
     69 c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);
     70 b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);
     71 
     72 a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);
     73 d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);
     74 c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);
     75 b = md5_gg(b, c, d, a, x[i + 0], 20, -373897302);
     76 a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);
     77 d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);
     78 c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);
     79 b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);
     80 a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);
     81 d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);
     82 c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);
     83 b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);
     84 a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);
     85 d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);
     86 c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);
     87 b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);
     88 
     89 a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);
     90 d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);
     91 c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);
     92 b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);
     93 a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);
     94 d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);
     95 c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);
     96 b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);
     97 a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);
     98 d = md5_hh(d, a, b, c, x[i + 0], 11, -358537222);
     99 c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);
    100 b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);
    101 a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);
    102 d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);
    103 c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);
    104 b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);
    105 
    106 a = md5_ii(a, b, c, d, x[i + 0], 6, -198630844);
    107 d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);
    108 c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);
    109 b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);
    110 a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);
    111 d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);
    112 c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);
    113 b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);
    114 a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);
    115 d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);
    116 c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);
    117 b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);
    118 a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);
    119 d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);
    120 c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);
    121 b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);
    122 
    123 a = safe_add(a, olda);
    124 b = safe_add(b, oldb);
    125 c = safe_add(c, oldc);
    126 d = safe_add(d, oldd);
    127 }
    128 return Array(a, b, c, d);
    129 
    130 }
    131 
    132 /*
    133 * These functions implement the four basic operations the algorithm uses.
    134 */
    135 function md5_cmn(q, a, b, x, s, t) {
    136 return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s), b);
    137 }
    138 function md5_ff(a, b, c, d, x, s, t) {
    139 return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);
    140 }
    141 function md5_gg(a, b, c, d, x, s, t) {
    142 return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);
    143 }
    144 function md5_hh(a, b, c, d, x, s, t) {
    145 return md5_cmn(b ^ c ^ d, a, b, x, s, t);
    146 }
    147 function md5_ii(a, b, c, d, x, s, t) {
    148 return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);
    149 }
    150 
    151 /*
    152 * Calculate the HMAC-MD5, of a key and some data
    153 */
    154 function core_hmac_md5(key, data) {
    155 var bkey = str2binl(key);
    156 if (bkey.length > 16) bkey = core_md5(bkey, key.length * chrsz);
    157 
    158 var ipad = Array(16), opad = Array(16);
    159 for (var i = 0; i < 16; i++) {
    160 ipad[i] = bkey[i] ^ 0x36363636;
    161 opad[i] = bkey[i] ^ 0x5C5C5C5C;
    162 }
    163 
    164 var hash = core_md5(ipad.concat(str2binl(data)), 512 + data.length * chrsz);
    165 return core_md5(opad.concat(hash), 512 + 128);
    166 }
    167 
    168 /*
    169 * Add integers, wrapping at 2^32. This uses 16-bit operations internally
    170 * to work around bugs in some JS interpreters.
    171 */
    172 function safe_add(x, y) {
    173 var lsw = (x & 0xFFFF) + (y & 0xFFFF);
    174 var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
    175 return (msw << 16) | (lsw & 0xFFFF);
    176 }
    177 
    178 /*
    179 * Bitwise rotate a 32-bit number to the left.
    180 */
    181 function bit_rol(num, cnt) {
    182 return (num << cnt) | (num >>> (32 - cnt));
    183 }
    184 
    185 /*
    186 * Convert a string to an array of little-endian words
    187 * If chrsz is ASCII, characters >255 have their hi-byte silently ignored.
    188 */
    189 function str2binl(str) {
    190 var bin = Array();
    191 var mask = (1 << chrsz) - 1;
    192 for (var i = 0; i < str.length * chrsz; i += chrsz)
    193 bin[i >> 5] |= (str.charCodeAt(i / chrsz) & mask) << (i % 32);
    194 return bin;
    195 }
    196 
    197 /*
    198 * Convert an array of little-endian words to a string
    199 */
    200 function binl2str(bin) {
    201 var str = "";
    202 var mask = (1 << chrsz) - 1;
    203 for (var i = 0; i < bin.length * 32; i += chrsz)
    204 str += String.fromCharCode((bin[i >> 5] >>> (i % 32)) & mask);
    205 return str;
    206 }
    207 
    208 /*
    209 * Convert an array of little-endian words to a hex string.
    210 */
    211 function binl2hex(binarray) {
    212 var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
    213 var str = "";
    214 for (var i = 0; i < binarray.length * 4; i++) {
    215 str += hex_tab.charAt((binarray[i >> 2] >> ((i % 4) * 8 + 4)) & 0xF) +
    216 hex_tab.charAt((binarray[i >> 2] >> ((i % 4) * 8)) & 0xF);
    217 }
    218 return str;
    219 }
    220 
    221 /*
    222 * Convert an array of little-endian words to a base-64 string
    223 */
    224 function binl2b64(binarray) {
    225 var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
    226 var str = "";
    227 for (var i = 0; i < binarray.length * 4; i += 3) {
    228 var triplet = (((binarray[i >> 2] >> 8 * (i % 4)) & 0xFF) << 16)
    229 | (((binarray[i + 1 >> 2] >> 8 * ((i + 1) % 4)) & 0xFF) << 8)
    230 | ((binarray[i + 2 >> 2] >> 8 * ((i + 2) % 4)) & 0xFF);
    231 for (var j = 0; j < 4; j++) {
    232 if (i * 8 + j * 6 > binarray.length * 32) str += b64pad;
    233 else str += tab.charAt((triplet >> 6 * (3 - j)) & 0x3F);
    234 }
    235 }
    236 return str;
    237 }
    238  
    239 //以上是代码包
    240 //一下是自行写的代码加密
    241 
    242 function hexMD5(param) {
    243 var secret = '1bc81b01751f741c163c7585ffbece90';
    244 var api_key = 'bd09d371bc8eb09af7e4c47f7a91b659';
    245  
    246 param.api_key = api_key;
    247 // 循环组装键值
    248 var arr_key = [];
    249 for (var test in param) {
    250 arr_key.push(test);
    251 }
    252 // 排序键值
    253 arr_key.sort();
    254 var obj = {};
    255 // console.log(arr_key);
    256 var one_val;
    257 var one_key;
    258 
    259 for (var key in arr_key) {
    260 // 当前键
    261 one_key = arr_key[key];
    262 // 当前值
    263 one_val = param[one_key];
    264 // 组装对象
    265 obj[one_key] = one_val;
    266 }
    267 
    268 var arr_name = "";
    269 
    270 for (var test in obj) {
    271 if (test === Object) {
    272 } else {
    273 arr_name += test + param[test];
    274 }
    275 
    276 }
    277 // 加密
    278 var passd = hex_md5(secret + arr_name + secret);
    279 // 密码大写
    280 var upper = passd.toUpperCase();
    281  
    282 // 添加密码
    283 param.api_sign = upper;
    284 return param;
    285 }
    286 module.exports = {
    287 hexMD5: hexMD5
    288 }
    289  

    小程序的代码

    //请求的数据
    const md5 = require("../../utils/md5.js")
    
      onLoad: function (options) {
    
        var send_data = md5.hexMD5({act: 1, phone: 'liujun', send_type:1});
        // console.log(send_data);
    
        var that = this;
        // console.log(domain + "test/test.html")
         wx.request({
           url: domain +"test/test.html",
           data: send_data,
           method: "GET",
           header: {
             'content-type': 'application/json'
           },
           success: function (res) {
             that.setData({
               test: res.data.data
             })
           
           },
         })
      },
    

      

     
    不懂的,可以留言
     
  • 相关阅读:
    第十六周项目5-为动态数组扩容
    Remoting
    C# 调用https服务
    12306
    Byte[]和Stream相互转换
    SQL Server之数据库语句优化
    前端框架VUE学习
    Oracle连接字符串总结
    .net 操作Oracle 海量数据
    新建一个Windows Service的方法
  • 原文地址:https://www.cnblogs.com/liujun1128/p/7834176.html
Copyright © 2020-2023  润新知