js md5 过滤表情 数据签名
2024-05-30 07:09:36
//字符编码数值对应的存储长度：//UCS-2编码(16进制) UTF-8 字节流(二进制)//0000 - 007F 0xxxxxxx （1字节）//0080 - 07FF 110xxxxx 10xxxxxx （2字节）//0800 - FFFF 1110xxxx 10xxxxxx 10xxxxxx （3字节）function getBytesLength(str) {var totalLength = 0;var charCode;for (var i = 0; i < str.length; i++) {charCode = str.charCodeAt(i);if (charCode < 0x007f) {totalLength++;} else if ((0x0080 <= charCode) && (charCode <= 0x07ff)) {totalLength += 2;} else if ((0x0800 <= charCode) && (charCode <= 0xffff)) {totalLength += 3;} else{totalLength += 4;}}return totalLength;}//参数签名function sign(data){var strParams = '';if(!data == ''){var data = this.ksorts(data);for (var item in data) {var strs = '';if(typeof(data[item]) == 'string'){var str = data[item];for(let cc of str){var len = this.getBytesLength(cc);if(len < 6){strs+=String(cc);} }}else{strs = data[item]; }var res = item + '=' + strs + '&';strParams += res;}strParams = strParams.substr(0, strParams.length - 1);}strParams = strParams + 'secret';// strParams = this.utf8(strParams);//有的md5 js 不带utf8转码需自己转码let secret= md5.md5(strParams);return secret;}//转码 uft8function utf8(inputStr) {var outputStr = "";for (var i = 0; i < inputStr.length; i++) {var temp = inputStr.charCodeAt(i);//0xxxxxxxif (temp < 128) {outputStr += String.fromCharCode(temp);}//110xxxxx 10xxxxxxelse if (temp < 2048) {outputStr += String.fromCharCode((temp >> 6) | 192);outputStr += String.fromCharCode((temp & 63) | 128);}//1110xxxx 10xxxxxx 10xxxxxxelse if (temp < 65536) {outputStr += String.fromCharCode((temp >> 12) | 224);outputStr += String.fromCharCode(((temp >> 6) & 63) | 128);outputStr += String.fromCharCode((temp & 63) | 128);}//11110xxx 10xxxxxx 10xxxxxx 10xxxxxxelse {outputStr += String.fromCharCode((temp >> 18) | 240);outputStr += String.fromCharCode(((temp >> 12) & 63) | 128);outputStr += String.fromCharCode(((temp >> 6) & 63) | 128);outputStr += String.fromCharCode((temp & 63) | 128);}}return outputStr;}//排序函数function ksorts(inputArr) {var tmp_arr = {},keys = [],sorter, i, k, that = this,strictForIn = false,populateArr = {};sorter = function (a, b) {var aFloat = parseFloat(a),bFloat = parseFloat(b),aNumeric = aFloat + '' === a,bNumeric = bFloat + '' === b;if (aNumeric && bNumeric) {return aFloat > bFloat ? 1 : aFloat < bFloat ? -1 : 0;} else if (aNumeric && !bNumeric) {return 1;} else if (!aNumeric && bNumeric) {return -1;}return a > b ? 1 : a < b ? -1 : 0;};// Make a list of key namesfor (k in inputArr) {if (inputArr.hasOwnProperty(k)) {keys.push(k);}}keys.sort(sorter);// Rebuild array with sorted key namesfor (i = 0; i < keys.length; i++) {k = keys[i];tmp_arr[k] = inputArr[k];}for (i in tmp_arr) {if (tmp_arr.hasOwnProperty(i)) {populateArr[i] = tmp_arr[i];}}return populateArr;}
//md5.js
var rotateLeft = function(lValue, iShiftBits) { return(lValue << iShiftBits) | (lValue >>> (32 - iShiftBits));
} var addUnsigned = function(lX, lY) { var lX4, lY4, lX8, lY8, lResult; lX8 = (lX & 0x80000000); lY8 = (lY & 0x80000000); lX4 = (lX & 0x40000000); lY4 = (lY & 0x40000000); lResult = (lX & 0x3FFFFFFF) + (lY & 0x3FFFFFFF); if(lX4 & lY4) return(lResult ^ 0x80000000 ^ lX8 ^ lY8); if(lX4 | lY4) { if(lResult & 0x40000000) return(lResult ^ 0xC0000000 ^ lX8 ^ lY8); else return(lResult ^ 0x40000000 ^ lX8 ^ lY8); } else { return(lResult ^ lX8 ^ lY8); }
} var F = function(x, y, z) { return(x & y) | ((~x) & z);
} var G = function(x, y, z) { return(x & z) | (y & (~z));
} var H = function(x, y, z) { return(x ^ y ^ z);
} var I = function(x, y, z) { return(y ^ (x | (~z)));
} var FF = function(a, b, c, d, x, s, ac) { a = addUnsigned(a, addUnsigned(addUnsigned(F(b, c, d), x), ac)); return addUnsigned(rotateLeft(a, s), b);
}; var GG = function(a, b, c, d, x, s, ac) { a = addUnsigned(a, addUnsigned(addUnsigned(G(b, c, d), x), ac)); return addUnsigned(rotateLeft(a, s), b);
}; var HH = function(a, b, c, d, x, s, ac) { a = addUnsigned(a, addUnsigned(addUnsigned(H(b, c, d), x), ac)); return addUnsigned(rotateLeft(a, s), b);
}; var II = function(a, b, c, d, x, s, ac) { a = addUnsigned(a, addUnsigned(addUnsigned(I(b, c, d), x), ac)); return addUnsigned(rotateLeft(a, s), b);
}; var convertToWordArray = function(string) { var lWordCount; var lMessageLength = string.length; var lNumberOfWordsTempOne = lMessageLength + 8; var lNumberOfWordsTempTwo = (lNumberOfWordsTempOne - (lNumberOfWordsTempOne % 64)) / 64; var lNumberOfWords = (lNumberOfWordsTempTwo + 1) * 16; var lWordArray = Array(lNumberOfWords - 1); var lBytePosition = 0; var lByteCount = 0; while(lByteCount < lMessageLength) { lWordCount = (lByteCount - (lByteCount % 4)) / 4; lBytePosition = (lByteCount % 4) * 8; lWordArray[lWordCount] = (lWordArray[lWordCount] | (string.charCodeAt(lByteCount) << lBytePosition)); lByteCount++; } lWordCount = (lByteCount - (lByteCount % 4)) / 4; lBytePosition = (lByteCount % 4) * 8; lWordArray[lWordCount] = lWordArray[lWordCount] | (0x80 << lBytePosition); lWordArray[lNumberOfWords - 2] = lMessageLength << 3; lWordArray[lNumberOfWords - 1] = lMessageLength >>> 29; return lWordArray;
}; var wordToHex = function(lValue) { var WordToHexValue = "", WordToHexValueTemp = "", lByte, lCount; for(lCount = 0; lCount <= 3; lCount++) { lByte = (lValue >>> (lCount * 8)) & 255; WordToHexValueTemp = "0" + lByte.toString(16); WordToHexValue = WordToHexValue + WordToHexValueTemp.substr(WordToHexValueTemp.length - 2, 2); } return WordToHexValue;
}; var uTF8Encode = function(string) { string = string.replace(/\x0d\x0a/g, "\x0a"); var output = ""; for(var n = 0; n < string.length; n++) { var c = string.charCodeAt(n); if(c < 128) { output += String.fromCharCode(c); } else if((c > 127) && (c < 2048)) { output += String.fromCharCode((c >> 6) | 192); output += String.fromCharCode((c & 63) | 128); } else { output += String.fromCharCode((c >> 12) | 224); output += String.fromCharCode(((c >> 6) & 63) | 128); output += String.fromCharCode((c & 63) | 128); } } return output;
}; function md5(string) { var x = Array(); var k, AA, BB, CC, DD, a, b, c, d; var S11 = 7, S12 = 12, S13 = 17, S14 = 22; var S21 = 5, S22 = 9, S23 = 14, S24 = 20; var S31 = 4, S32 = 11, S33 = 16, S34 = 23; var S41 = 6, S42 = 10, S43 = 15, S44 = 21; string = uTF8Encode(string); x = convertToWordArray(string); a = 0x67452301; b = 0xEFCDAB89; c = 0x98BADCFE; d = 0x10325476; for(k = 0; k < x.length; k += 16) { AA = a; BB = b; CC = c; DD = d; a = FF(a, b, c, d, x[k + 0], S11, 0xD76AA478); d = FF(d, a, b, c, x[k + 1], S12, 0xE8C7B756); c = FF(c, d, a, b, x[k + 2], S13, 0x242070DB); b = FF(b, c, d, a, x[k + 3], S14, 0xC1BDCEEE); a = FF(a, b, c, d, x[k + 4], S11, 0xF57C0FAF); d = FF(d, a, b, c, x[k + 5], S12, 0x4787C62A); c = FF(c, d, a, b, x[k + 6], S13, 0xA8304613); b = FF(b, c, d, a, x[k + 7], S14, 0xFD469501); a = FF(a, b, c, d, x[k + 8], S11, 0x698098D8); d = FF(d, a, b, c, x[k + 9], S12, 0x8B44F7AF); c = FF(c, d, a, b, x[k + 10], S13, 0xFFFF5BB1); b = FF(b, c, d, a, x[k + 11], S14, 0x895CD7BE); a = FF(a, b, c, d, x[k + 12], S11, 0x6B901122); d = FF(d, a, b, c, x[k + 13], S12, 0xFD987193); c = FF(c, d, a, b, x[k + 14], S13, 0xA679438E); b = FF(b, c, d, a, x[k + 15], S14, 0x49B40821); a = GG(a, b, c, d, x[k + 1], S21, 0xF61E2562); d = GG(d, a, b, c, x[k + 6], S22, 0xC040B340); c = GG(c, d, a, b, x[k + 11], S23, 0x265E5A51); b = GG(b, c, d, a, x[k + 0], S24, 0xE9B6C7AA); a = GG(a, b, c, d, x[k + 5], S21, 0xD62F105D); d = GG(d, a, b, c, x[k + 10], S22, 0x2441453); c = GG(c, d, a, b, x[k + 15], S23, 0xD8A1E681); b = GG(b, c, d, a, x[k + 4], S24, 0xE7D3FBC8); a = GG(a, b, c, d, x[k + 9], S21, 0x21E1CDE6); d = GG(d, a, b, c, x[k + 14], S22, 0xC33707D6); c = GG(c, d, a, b, x[k + 3], S23, 0xF4D50D87); b = GG(b, c, d, a, x[k + 8], S24, 0x455A14ED); a = GG(a, b, c, d, x[k + 13], S21, 0xA9E3E905); d = GG(d, a, b, c, x[k + 2], S22, 0xFCEFA3F8); c = GG(c, d, a, b, x[k + 7], S23, 0x676F02D9); b = GG(b, c, d, a, x[k + 12], S24, 0x8D2A4C8A); a = HH(a, b, c, d, x[k + 5], S31, 0xFFFA3942); d = HH(d, a, b, c, x[k + 8], S32, 0x8771F681); c = HH(c, d, a, b, x[k + 11], S33, 0x6D9D6122); b = HH(b, c, d, a, x[k + 14], S34, 0xFDE5380C); a = HH(a, b, c, d, x[k + 1], S31, 0xA4BEEA44); d = HH(d, a, b, c, x[k + 4], S32, 0x4BDECFA9); c = HH(c, d, a, b, x[k + 7], S33, 0xF6BB4B60); b = HH(b, c, d, a, x[k + 10], S34, 0xBEBFBC70); a = HH(a, b, c, d, x[k + 13], S31, 0x289B7EC6); d = HH(d, a, b, c, x[k + 0], S32, 0xEAA127FA); c = HH(c, d, a, b, x[k + 3], S33, 0xD4EF3085); b = HH(b, c, d, a, x[k + 6], S34, 0x4881D05); a = HH(a, b, c, d, x[k + 9], S31, 0xD9D4D039); d = HH(d, a, b, c, x[k + 12], S32, 0xE6DB99E5); c = HH(c, d, a, b, x[k + 15], S33, 0x1FA27CF8); b = HH(b, c, d, a, x[k + 2], S34, 0xC4AC5665); a = II(a, b, c, d, x[k + 0], S41, 0xF4292244); d = II(d, a, b, c, x[k + 7], S42, 0x432AFF97); c = II(c, d, a, b, x[k + 14], S43, 0xAB9423A7); b = II(b, c, d, a, x[k + 5], S44, 0xFC93A039); a = II(a, b, c, d, x[k + 12], S41, 0x655B59C3); d = II(d, a, b, c, x[k + 3], S42, 0x8F0CCC92); c = II(c, d, a, b, x[k + 10], S43, 0xFFEFF47D); b = II(b, c, d, a, x[k + 1], S44, 0x85845DD1); a = II(a, b, c, d, x[k + 8], S41, 0x6FA87E4F); d = II(d, a, b, c, x[k + 15], S42, 0xFE2CE6E0); c = II(c, d, a, b, x[k + 6], S43, 0xA3014314); b = II(b, c, d, a, x[k + 13], S44, 0x4E0811A1); a = II(a, b, c, d, x[k + 4], S41, 0xF7537E82); d = II(d, a, b, c, x[k + 11], S42, 0xBD3AF235); c = II(c, d, a, b, x[k + 2], S43, 0x2AD7D2BB); b = II(b, c, d, a, x[k + 9], S44, 0xEB86D391); a = addUnsigned(a, AA); b = addUnsigned(b, BB); c = addUnsigned(c, CC); d = addUnsigned(d, DD); } var tempValue = wordToHex(a) + wordToHex(b) + wordToHex(c) + wordToHex(d); return tempValue.toLowerCase();
} module.exports.md5 = md5js md5 过滤表情 数据签名相关推荐
- js正则表达式过滤表情，输入法表情无法匹配，则反向判断
因为输入法表情正则无法匹配,那就匹配当前文本中,不是数字,标点,英文,汉字的字符,做基本的文本格式处理 我这里用到的是替换,标点匹配不够全面,自行添加即可 var mytextarea = e.det ...
- 用js将待签名数据以UTF-8的格式转字节流，对字节流进行MD5算法得到的签名字节流，再经过Base64转换为字符串
最近碰到一个接口是要数字签名的,给的示范是用java写的.一开始没明白直接用了对字节流进行了md5加密,后面在java里面把这段代码运行了一遍才发现md5加密后仍然是字节流,然后在md5中找到了这个 ...
- js json过滤_如何在浏览器不崩溃的情况下过滤 200 万行数据？
最近我分配到了一个非常有趣的任务:在前端显示 1GB 文件和 200 万行数据,并实现过滤,在这篇文章中,我将分享我是如何完成这个任务的. 背景 我曾经创建了一个简单的 React 应用程序.这个应用 ...
- md5只是用来签名，签名的作用是保证数据完整不会被破坏而已。签名和加密是两回事...
md5只是用来签名,签名的作用是保证数据完整不会被破坏而已,多一个sign标签,sign的值就是md5生成的字符串.签名和加密是两回事
- JS判断数据类型以及数据过滤空值方法
JS判断数据类型以及数据过滤空值方法 在我们的项目开发中,经常需要对一个传输中的数据进行滤空处理,过滤 null.undefined.''.[].{}等,还要对字符串进行去除两端的空格操作.为此,我写 ...
- js中的JSON对象转换,过滤特殊字符数据
//过滤特殊字符数据 function checkMetacharacter(obj){ var value = $(obj).val(); var items = ["~", & ...
- js MD5加密处理
关于MD5: MD5.js是通过前台js加密的方式对用户信息,密码等私密信息进行加密处理的工具,也可称为插件. 在本案例中 可以看到MD5共有6种加密方法: 1, hex_md5(value) 2, ...
- 3、Spark 和 D3.js 分析航班大数据
实验资源 1998.csv airports.csv 实验环境 VMware Workstation Ubuntu 16.04 spark-2.4.5 scala-2.12.10 实验内容 " ...
- 使用RSA、MD5对参数生成签名与验签
在日常的工作中,我们对外提供的接口或调用三方的接口往往有一步生成签名或验签的步骤,这个步骤主要是验证调用方是 不是合法的以及内容是否被修改.比如:对于某些网上公开下载的软件,视频,尤其是镜像文件.如果 ...
最新文章
- Protobuf 安装及 Python、C# 示例
- CSS3的flex布局：方向 换行 对齐 顺序
- Java黑皮书课后题第9章：9.2（Stock类）遵照9.2节中Cirlce类的例子，设计一个名为Stock的类
- IOS基础之UIDynamicAnimator动力学入门-02
- ldr加载指令，ldr伪指令
- c++程序设计(第三版) pdf_【好课传送】C++语言程序设计基础入门视频
- xml模块、项目开发过程
- 算法导论 练习12.2
- Serverless 场景排查问题利器：函数实例命令行操作
- 在函数内对带副作用的运算符 rand 的使用无效。_如何成体系掌握Excel函数（一）...
- DeepRacer 找到的最好的奖励函数 reward function
- vbs基础教程(1)
- 向日葵远程分辨率过低解决办法
- 用c语言寸件照换底颜色,怎么给证件照换底色【使用步骤】
- java 找出重复的数字
- 计算机硬件故障检测论文,《浅析计算机硬件故障的判断及维修》-毕业论文（设计）.doc...
- scratch3.0教程 水果忍者游戏
- POJ - Nice Milk(半平面交)
- 【博云+智领云】携手云原生大数据领域，开展深度合作
- 【EARLIER/EARLIEST函数】引用不存在的更早的行上下文 报错解决