在网上查了一下，在网上收集了Java与JavaScript中使用的两个例子，试验过，分享下。 1、Java：
import java.security.MessageDigest;
import java.security.NoSuchAlgorithmException;
public class MD5Utils {
public static void main(String[] args){
System.out.println(getMd5String(""));
System.out.println(MD5("good"));
}
public final static String MD5(String s) {
char hexDigits[] = { '0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F' };
try {
byte[] btInput = s.getBytes();
//获得MD5摘要算法的 MessageDigest 对象
MessageDigest mdInst = MessageDigest.getInstance("MD5");
//使用指定的字节更新摘要
mdInst.update(btInput);
//获得密文
byte[] md = mdInst.digest();
//把密文转换成十六进制的字符串形式
int j = md.length;
char str[] = new char[j * 2];
int k = 0;
for (int i = 0; i < j; i++) {
byte byte0 = md[i];
str[k++] = hexDigits[byte0 >>> 4 & 0xf];
str[k++] = hexDigits[byte0 & 0xf];
}
return new String(str);
}
catch (Exception e) {
e.printStackTrace();
return null;
}
}
public static String getMd5String(String str){
MessageDigest messageDigest = null;
try {
messageDigest = MessageDigest.getInstance("MD5");
messageDigest.reset();
messageDigest.update(str.getBytes("UTF-8"));
} catch (NoSuchAlgorithmException e) {
System.out.println("NoSuchAlgorithmException caught!");
System.exit(-1);
} catch (UnsupportedEncodingException e) {
e.printStackTrace();
}
byte[] byteArray = messageDigest.digest();
StringBuffer md5StrBuff = new StringBuffer();
for (int i = 0; i < byteArray.length; i++) {
if (Integer.toHexString(0xFF & byteArray[i]).length() == 1)
md5StrBuff.append("0").append(Integer.toHexString(0xFF & byteArray[i]));
else
md5StrBuff.append(Integer.toHexString(0xFF & byteArray[i]));
}
return md5StrBuff.toString();
}
}
2、JavaScript:
md5.js
/*
- 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);
}
/*
- These functions implement the four basic operations the algorithm uses.
*/
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;
}