JQuery - MD5加密
效果:

JS代码:
- 命名为任意名称,一般为:Jquery.md5.js
/**
* jQuery MD5 hash algorithm function
*
* <code>
* Calculate the md5 hash of a String
* String $.md5 ( String str )
* </code>
*
* Calculates the MD5 hash of str using the 禄 RSA Data Security, Inc. MD5 Message-Digest Algorithm, and returns that hash.
* MD5 (Message-Digest algorithm 5) is a widely-used cryptographic hash function with a 128-bit hash value. MD5 has been employed in a wide variety of security applications, and is also commonly used to check the integrity of data. The generated hash is also non-reversable. Data cannot be retrieved from the message digest, the digest uniquely identifies the data.
* MD5 was developed by Professor Ronald L. Rivest in 1994. Its 128 bit (16 byte) message digest makes it a faster implementation than SHA-1.
* This script is used to process a variable length message into a fixed-length output of 128 bits using the MD5 algorithm. It is fully compatible with UTF-8 encoding. It is very useful when u want to transfer encrypted passwords over the internet. If you plan using UTF-8 encoding in your project don't forget to set the page encoding to UTF-8 (Content-Type meta tag).
* This function orginally get from the WebToolkit and rewrite for using as the jQuery plugin.
*
* Example
* Code
* <code>
* $.md5("I'm Persian.");
* </code>
* Result
* <code>
* "b8c901d0f02223f9761016cfff9d68df"
* </code>
*
* @alias Muhammad Hussein Fattahizadeh < muhammad [AT] semnanweb [DOT] com >
* @link http://www.semnanweb.com/jquery-plugin/md5.html
* @see http://www.webtoolkit.info/
* @license http://www.gnu.org/licenses/gpl.html [GNU General Public License]
* @param {jQuery} {md5:function(string))
* @return string
*/
(function ($) {
var rotateLeft = function (lValue, iShiftBits) {
return (lValue << iShiftBits) | (lValue >>> ( - 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 + ;
var lNumberOfWordsTempTwo = (lNumberOfWordsTempOne - (lNumberOfWordsTempOne % )) / ;
var lNumberOfWords = (lNumberOfWordsTempTwo + ) * ;
var lWordArray = Array(lNumberOfWords - );
var lBytePosition = ;
var lByteCount = ;
while (lByteCount < lMessageLength) {
lWordCount = (lByteCount - (lByteCount % )) / ;
lBytePosition = (lByteCount % ) * ;
lWordArray[lWordCount] = (lWordArray[lWordCount] | (string.charCodeAt(lByteCount) << lBytePosition));
lByteCount++;
}
lWordCount = (lByteCount - (lByteCount % )) / ;
lBytePosition = (lByteCount % ) * ;
lWordArray[lWordCount] = lWordArray[lWordCount] | (0x80 << lBytePosition);
lWordArray[lNumberOfWords - ] = lMessageLength << ;
lWordArray[lNumberOfWords - ] = lMessageLength >>> ;
return lWordArray;
};
var wordToHex = function (lValue) {
var WordToHexValue = "", WordToHexValueTemp = "", lByte, lCount;
for (lCount = ; lCount <= ; lCount++) {
lByte = (lValue >>> (lCount * )) & ;
WordToHexValueTemp = "" + lByte.toString();
WordToHexValue = WordToHexValue + WordToHexValueTemp.substr(WordToHexValueTemp.length - , );
}
return WordToHexValue;
};
var uTF8Encode = function (string) {
string = string.replace(/\x0d\x0a/g, "\x0a");
var output = "";
for (var n = ; n < string.length; n++) {
var c = string.charCodeAt(n);
if (c < ) {
output += String.fromCharCode(c);
} else if ((c > ) && (c < )) {
output += String.fromCharCode((c >> ) | );
output += String.fromCharCode((c & ) | );
} else {
output += String.fromCharCode((c >> ) | );
output += String.fromCharCode(((c >> ) & ) | );
output += String.fromCharCode((c & ) | );
}
}
return output;
};
$.extend({
md5: function (string) {
var x = Array();
var k, AA, BB, CC, DD, a, b, c, d;
var S11 = , S12 = , S13 = , S14 = ;
var S21 = , S22 = , S23 = , S24 = ;
var S31 = , S32 = , S33 = , S34 = ;
var S41 = , S42 = , S43 = , S44 = ;
string = uTF8Encode(string);
x = convertToWordArray(string);
a = 0x67452301; b = 0xEFCDAB89; c = 0x98BADCFE; d = 0x10325476;
for (k = ; k < x.length; k += ) {
AA = a; BB = b; CC = c; DD = d;
a = FF(a, b, c, d, x[k + ], S11, 0xD76AA478);
d = FF(d, a, b, c, x[k + ], S12, 0xE8C7B756);
c = FF(c, d, a, b, x[k + ], S13, 0x242070DB);
b = FF(b, c, d, a, x[k + ], S14, 0xC1BDCEEE);
a = FF(a, b, c, d, x[k + ], S11, 0xF57C0FAF);
d = FF(d, a, b, c, x[k + ], S12, 0x4787C62A);
c = FF(c, d, a, b, x[k + ], S13, 0xA8304613);
b = FF(b, c, d, a, x[k + ], S14, 0xFD469501);
a = FF(a, b, c, d, x[k + ], S11, 0x698098D8);
d = FF(d, a, b, c, x[k + ], S12, 0x8B44F7AF);
c = FF(c, d, a, b, x[k + ], S13, 0xFFFF5BB1);
b = FF(b, c, d, a, x[k + ], S14, 0x895CD7BE);
a = FF(a, b, c, d, x[k + ], S11, 0x6B901122);
d = FF(d, a, b, c, x[k + ], S12, 0xFD987193);
c = FF(c, d, a, b, x[k + ], S13, 0xA679438E);
b = FF(b, c, d, a, x[k + ], S14, 0x49B40821);
a = GG(a, b, c, d, x[k + ], S21, 0xF61E2562);
d = GG(d, a, b, c, x[k + ], S22, 0xC040B340);
c = GG(c, d, a, b, x[k + ], S23, 0x265E5A51);
b = GG(b, c, d, a, x[k + ], S24, 0xE9B6C7AA);
a = GG(a, b, c, d, x[k + ], S21, 0xD62F105D);
d = GG(d, a, b, c, x[k + ], S22, 0x2441453);
c = GG(c, d, a, b, x[k + ], S23, 0xD8A1E681);
b = GG(b, c, d, a, x[k + ], S24, 0xE7D3FBC8);
a = GG(a, b, c, d, x[k + ], S21, 0x21E1CDE6);
d = GG(d, a, b, c, x[k + ], S22, 0xC33707D6);
c = GG(c, d, a, b, x[k + ], S23, 0xF4D50D87);
b = GG(b, c, d, a, x[k + ], S24, 0x455A14ED);
a = GG(a, b, c, d, x[k + ], S21, 0xA9E3E905);
d = GG(d, a, b, c, x[k + ], S22, 0xFCEFA3F8);
c = GG(c, d, a, b, x[k + ], S23, 0x676F02D9);
b = GG(b, c, d, a, x[k + ], S24, 0x8D2A4C8A);
a = HH(a, b, c, d, x[k + ], S31, 0xFFFA3942);
d = HH(d, a, b, c, x[k + ], S32, 0x8771F681);
c = HH(c, d, a, b, x[k + ], S33, 0x6D9D6122);
b = HH(b, c, d, a, x[k + ], S34, 0xFDE5380C);
a = HH(a, b, c, d, x[k + ], S31, 0xA4BEEA44);
d = HH(d, a, b, c, x[k + ], S32, 0x4BDECFA9);
c = HH(c, d, a, b, x[k + ], S33, 0xF6BB4B60);
b = HH(b, c, d, a, x[k + ], S34, 0xBEBFBC70);
a = HH(a, b, c, d, x[k + ], S31, 0x289B7EC6);
d = HH(d, a, b, c, x[k + ], S32, 0xEAA127FA);
c = HH(c, d, a, b, x[k + ], S33, 0xD4EF3085);
b = HH(b, c, d, a, x[k + ], S34, 0x4881D05);
a = HH(a, b, c, d, x[k + ], S31, 0xD9D4D039);
d = HH(d, a, b, c, x[k + ], S32, 0xE6DB99E5);
c = HH(c, d, a, b, x[k + ], S33, 0x1FA27CF8);
b = HH(b, c, d, a, x[k + ], S34, 0xC4AC5665);
a = II(a, b, c, d, x[k + ], S41, 0xF4292244);
d = II(d, a, b, c, x[k + ], S42, 0x432AFF97);
c = II(c, d, a, b, x[k + ], S43, 0xAB9423A7);
b = II(b, c, d, a, x[k + ], S44, 0xFC93A039);
a = II(a, b, c, d, x[k + ], S41, 0x655B59C3);
d = II(d, a, b, c, x[k + ], S42, 0x8F0CCC92);
c = II(c, d, a, b, x[k + ], S43, 0xFFEFF47D);
b = II(b, c, d, a, x[k + ], S44, 0x85845DD1);
a = II(a, b, c, d, x[k + ], S41, 0x6FA87E4F);
d = II(d, a, b, c, x[k + ], S42, 0xFE2CE6E0);
c = II(c, d, a, b, x[k + ], S43, 0xA3014314);
b = II(b, c, d, a, x[k + ], S44, 0x4E0811A1);
a = II(a, b, c, d, x[k + ], S41, 0xF7537E82);
d = II(d, a, b, c, x[k + ], S42, 0xBD3AF235);
c = II(c, d, a, b, x[k + ], S43, 0x2AD7D2BB);
b = II(b, c, d, a, x[k + ], 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();
}
});
})(jQuery);
引用:
- 此处引用的为上面自己封装的文件。
<script src="../js/Jquery.md5.js"></script>
调用:
var pwd = $.md5(pwd);
JQuery - MD5加密的更多相关文章
- jQuery MD5 加密
一 MD5 概述 MD5消息摘要算法(英语:MD5 Message-Digest Algorithm),一种被广泛使用的密码散列函数,可以产生出一个128位(16字节)的散列值(hash value) ...
- jQuery MD5加密实现代码
$(md("你想要加密的字符串")); md5插件下载地址:http://xiazai.jb51.net/201003/yuanma/jquery_md5.rar 下面是我的简单例 ...
- Jquery Md5加密解密
首先需要调用md5解析的js文件.(右击-目标另存为方式下载) http://files.cnblogs.com/files/colinliu/md5.js 加密方法参考: <script ty ...
- java 实现md5加密的三种方式与解密
java 实现md5加密的三种方式 CreateTime--2018年5月31日15点04分 Author:Marydon 一.解密 说明:截止文章发布,Java没有实现解密,但是已有网站可以免费 ...
- ASP.NET使用jQuery AJAX实现MD5加密实例
一个asp.net ajax例子,使用jquery,实现md5加密.在.NET 4.0,Visual Studio 2010上成功运行. 效果体验:http://tool.keleyi.com/t/m ...
- Jquery实现MD5加密
$.md5("你想要加密的字符串"); md5插件下载地址:http://xiazai.jb51.net/201003/yuanma/jquery_md5.rar <!DOC ...
- 【javascript类库】zepto和jquery的md5加密插件
[javascript类库]zepto和jquery的md5加密插件 相信很多人对jQuery并不陌生,这款封装良好的插件被很多开发者使用. zepto可以说是jQuery在移动端的替代产品,它比jQ ...
- jQuery的md5加密插件及其它js md5加密代码
/** * jQuery MD5 hash algorithm function * * <code> * Calculate the md5 hash of a String * Str ...
- 一个简单的后台与数据库交互的登录与注册[sql注入处理,以及MD5加密]
一.工具: vs2013[因为我现在用的也是2013,版本随便你自己开心] sql2008[准备过久升级] 二.用到的语言: HTML+CSS+Jquery+Ajax+sqlserver HTML[相 ...
随机推荐
- stm32之GPIO
stm32有5组GPIO口,GPIOA GPIOB GPIOC GPIOD GPIOE 每个GPIO端口有: 2个配置寄存器GPIOx_CRL, GPIOx_CRH(32位): 2个数据寄存器GPIO ...
- load、save方法、spark sql的几种数据源
load.save方法的用法 DataFrame usersDF = sqlContext.read().load("hdfs://spark1:9000/users.pa ...
- vim下设置tab
前言:大多数情况下tab键的宽度设置为4个空格,这个可以根据自己 的代码风格进行替换,然而当你提交不同的语言的代码的时候python 和c的时候就有区别了.c的话一般tab键做缩进,而python提交 ...
- Two-phase Termination
本文参阅[http://ifeve.com/java-two-phase-termination/] Two-phase Termination模式简介 停止线程是一个目标简单而实现却不那么简单的任务 ...
- UVALive 6467 Strahler Order 拓扑排序
这题是今天下午BNU SUMMER TRAINING的C题 是队友给的解题思路,用拓扑排序然后就可以了 最后是3A 其中两次RE竟然是因为: scanf("%d",mm); ORZ ...
- android如何让service不被杀死-提高进程优先级
1.在service中重写下面的方法,这个方法有三个返回值, START_STICKY是service被kill掉后自动重写创建 @Override public int onStartCommand ...
- 网络爬虫 kamike.collect
Another Simple Crawler 又一个网络爬虫,可以支持代理服务器的FQ爬取. 1.数据存在mysql当中. 2.使用时,先修改web-inf/config.ini的数据链接相关信息,主 ...
- 基于visual Studio2013解决C语言竞赛题之0413同构数
题目 解决代码及点评 该题目与水仙花数类似,只是条件不同,循环还是一样的 /***************************************************** ...
- C#根据域名查询IP(CMD命令参数输入或者启动程序后再输入查询)
有时因为需要,希望知道域名的IP,那用C#怎么实现呢?以下是实现代码 using System; using System.Collections.Generic; using System.Linq ...
- ARM标准汇编与GNU汇编
ARM标准汇编与GNU汇编 http://www.cnblogs.com/hnrainll/archive/2011/05/17/2048315.html