微信公众号搜"智元新知"关注
微信扫一扫可直接关注哦!

分享JavaScript与Java中MD5使用两个例子

在网上查了一下,在网上收集了Java与JavaScript中使用的两个例子,试验过,分享下。 1、Java:

rush:java;"> package org.bearfly.test.md5;

import java.io.UnsupportedEncodingException;
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;
    }

md5.html

rush:xhtml;"> md5_Test

代码备份,跟java互通

rush:js;"> var MD5 = function (string) {

function RotateLeft(lValue,iShiftBits) {
return (lValue<<iShiftBits) | (lValue>>>(32-iShiftBits));
}

function AddUnsigned(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);
}
}

function F(x,y,z) { return (x & y) | ((~x) & z); }
function G(x,z) { return (x & z) | (y & (~z)); }
function H(x,z) { return (x ^ y ^ z); }
function I(x,z) { return (y ^ (x | (~z))); }

function FF(a,ac) {
a = AddUnsigned(a,AddUnsigned(AddUnsigned(F(b,d),x),ac));
return AddUnsigned(RotateLeft(a,b);
};

function GG(a,AddUnsigned(AddUnsigned(G(b,b);
};

function HH(a,AddUnsigned(AddUnsigned(H(b,b);
};

function II(a,AddUnsigned(AddUnsigned(I(b,b);
};

function ConvertToWordArray(string) {
var lWordCount;
var lMessageLength = string.length;
var lNumberOfWords_temp1=lMessageLength + 8;
var lNumberOfWords_temp2=(lNumberOfWords_temp1-(lNumberOfWords_temp1 % 64))/64;
var lNumberOfWords = (lNumberOfWords_temp2+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;
};

function WordToHex(lValue) {
var WordToHexValue="",WordToHexValue_temp="",lByte,lCount;
for (lCount = 0;lCount<=3;lCount++) {
lByte = (lValue>>>(lCount*8)) & 255;
WordToHexValue_temp = "0" + lByte.toString(16);
WordToHexValue = WordToHexValue + WordToHexValue_temp.substr(WordToHexValue_temp.length-2,2);
}
return WordToHexValue;
};

function Utf8Encode(string) {
string = string.replace(/\r\n/g,"\n");
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;
};

var x=Array();
var k,AA,BB,CC,DD,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,x[k+0],S11,0xD76AA478);
d=FF(d,x[k+1],S12,0xE8C7B756);
c=FF(c,x[k+2],S13,0x242070DB);
b=FF(b,x[k+3],S14,0xC1BDCEEE);
a=FF(a,x[k+4],0xF57C0FAF);
d=FF(d,x[k+5],0x4787C62A);
c=FF(c,x[k+6],0xA8304613);
b=FF(b,x[k+7],0xFD469501);
a=FF(a,x[k+8],0x698098D8);
d=FF(d,x[k+9],0x8B44F7AF);
c=FF(c,x[k+10],0xFFFF5BB1);
b=FF(b,x[k+11],0x895CD7BE);
a=FF(a,x[k+12],0x6B901122);
d=FF(d,x[k+13],0xFD987193);
c=FF(c,x[k+14],0xA679438E);
b=FF(b,x[k+15],0x49B40821);
a=GG(a,S21,0xF61E2562);
d=GG(d,S22,0xC040B340);
c=GG(c,S23,0x265E5A51);
b=GG(b,S24,0xE9B6C7AA);
a=GG(a,0xD62F105D);
d=GG(d,0x2441453);
c=GG(c,0xD8A1E681);
b=GG(b,0xE7D3FBC8);
a=GG(a,0x21E1CDE6);
d=GG(d,0xC33707D6);
c=GG(c,0xF4D50D87);
b=GG(b,0x455A14ED);
a=GG(a,0xA9E3E905);
d=GG(d,0xFCEFA3F8);
c=GG(c,0x676F02D9);
b=GG(b,0x8D2A4C8A);
a=HH(a,S31,0xFFFA3942);
d=HH(d,S32,0x8771F681);
c=HH(c,S33,0x6D9D6122);
b=HH(b,S34,0xFDE5380C);
a=HH(a,0xA4BEEA44);
d=HH(d,0x4BDECFA9);
c=HH(c,0xF6BB4B60);
b=HH(b,0xBEBFBC70);
a=HH(a,0x289B7EC6);
d=HH(d,0xEAA127FA);
c=HH(c,0xD4EF3085);
b=HH(b,0x4881D05);
a=HH(a,0xD9D4D039);
d=HH(d,0xE6DB99E5);
c=HH(c,0x1FA27CF8);
b=HH(b,0xC4AC5665);
a=II(a,S41,0xF4292244);
d=II(d,S42,0x432AFF97);
c=II(c,S43,0xAB9423A7);
b=II(b,S44,0xFC93A039);
a=II(a,0x655B59C3);
d=II(d,0x8F0CCC92);
c=II(c,0xFFEFF47D);
b=II(b,0x85845DD1);
a=II(a,0x6FA87E4F);
d=II(d,0xFE2CE6E0);
c=II(c,0xA3014314);
b=II(b,0x4E0811A1);
a=II(a,0xF7537E82);
d=II(d,0xBD3AF235);
c=II(c,0x2AD7D2BB);
b=II(b,0xEB86D391);
a=AddUnsigned(a,AA);
b=AddUnsigned(b,BB);
c=AddUnsigned(c,CC);
d=AddUnsigned(d,DD);
}

var temp = WordToHex(a)+WordToHex(b)+WordToHex(c)+WordToHex(d);

return temp.toLowerCase();
}

以上就是本文的全部内容,java、javascript、MD5三者之间的关系,使用,希望对大家的学习有所帮助。

版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。

相关推荐