JavaWeb加密解密——md5

主要内容:前台js加密 + 后台java解密

一、前台js加密:  将要发送给后台的信息在js里进行md5加密,得到密钥,然后将信息和密钥一起发送给后台。

1.引入md5的js框架,即md5.js文件,如下:

/**

* MD5 for JavaScript. (32bit)

* @ interface:  MD5("Input String")

* @ return: key for Input String

**/

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,y,z) { return (x & z) | (y & (~z)); }

function H(x,y,z) { return (x ^ y ^ z); }

function I(x,y,z) { return (y ^ (x | (~z))); }

function FF(a,b,c,d,x,s,ac) {

a = AddUnsigned(a, AddUnsigned(AddUnsigned(F(b, c, d), x), ac));

return AddUnsigned(RotateLeft(a, s), b);

};

function GG(a,b,c,d,x,s,ac) {

a = AddUnsigned(a, AddUnsigned(AddUnsigned(G(b, c, d), x), ac));

return AddUnsigned(RotateLeft(a, s), b);

};

function HH(a,b,c,d,x,s,ac) {

a = AddUnsigned(a, AddUnsigned(AddUnsigned(H(b, c, d), x), ac));

return AddUnsigned(RotateLeft(a, s), b);

};

function II(a,b,c,d,x,s,ac) {

a = AddUnsigned(a, AddUnsigned(AddUnsigned(I(b, c, d), x), ac));

return AddUnsigned(RotateLeft(a, s), 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,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 temp = WordToHex(a)+WordToHex(b)+WordToHex(c)+WordToHex(d);

return temp.toLowerCase();

}

2.调用md5.js提供的接口,得到密钥key,如下:

<script>

var key = MD5("Input String");

</script>

二、后台java解密:后台得到前台传来的信息和密钥,之后用java将信息md5加密从而得到新密钥,然后和前台传来的密钥对比,若两个密钥相同则正确,若不一致,则内容被黑客篡改。

1.接收前台传来的信息和密钥:

String Text = request.getParameter(" Input String ");

String oldKey = request.getParameter("key");

2.用java给得到的信息加密,得到新的key

3.对比两个密钥key是否相同:

if( oldKey==newKey ){

System.out.println("信息正确,没有被黑客篡改");

return true;

} else {

System.out.println("信息错误,已经被黑客篡改");

return false;

}

注意:md5加密算法分为16bit和32bit,此处的md5.js代码是32bit的加密方式。不管用那种,都要保证前后台加密方法的一致性,即前台js里用32bit的加密,后台java里就用32bit的解密,不能搞错。

时间: 2024-08-07 21:18:32

JavaWeb加密解密——md5的相关文章

C/C++使用openssl进行摘要和加密解密(md5, sha256, des, rsa)

openssl里面有很多用于摘要哈希.加密解密的算法,方便集成于工程项目,被广泛应用于网络报文中的安全传输和认证.下面以md5,sha256,des,rsa几个典型的api简单使用作为例子. 算法介绍 md5:https://en.wikipedia.org/wiki/MD5 sha256:https://en.wikipedia.org/wiki/SHA-2 des: https://en.wikipedia.org/wiki/Data_Encryption_Standard rsa: htt

C#加密解密(DES,AES,Base64,md5,SHA256,RSA,RC4)

一:异或^简单加解密(数字类型) 1:原理: 异或用于比较两个二进制数的相应位,在执行按位"异或"运算时,如果两个二进制数的相应位都为1或者都为0,则返回0;如果两个二进制数的相应位其中一个为1另一个为0,则返回1. //对数字加密 int P_int_Num, P_int_Key;//定义两个值类型变量 string Encryptstr = (P_int_Num ^ P_int_Key).ToString();//加密数值 //对数字解密 int P_int_Key, P_int_

java 采用MD5加密解密

MD5加密解密 package endecrypt; import java.io.UnsupportedEncodingException; import java.security.MessageDigest; import java.security.NoSuchAlgorithmException; /** * 采用MD5加密解密 * @author tfq * @datetime 2011-10-13 */ public class MD5Util { /*** * MD5加码 生成3

.NET MD5加密解密代码

MD5简介: 是让大容量信息在用数字签名软件签署私人密匙前被"压缩"成一种保密的格式(就是把一个任意长度的字节串变换成一定长的大整数).不管是MD2.MD4还是MD5,它们都需要获得一个随机长度的信息并产生一个128位的信息摘要.虽然这些算法的结构或多或少有些相似,但MD2的设计与MD4和MD5完全不同,那是因为MD2是为8位机器做过设计优化的,而MD4和MD5却是面向32位的电脑.这三个算法的描述和C语言源代码在Internet RFCs 1321中有详细的描述,这是一份最权威的文档

.net实现md5加密 sha1加密 sha256加密 sha384加密 sha512加密 des加密解密

写项目时,后台一直用md5加密,一天群里人问,除了MD5还有其它的加密方法吗?当时只知道还有个SHA,但怎么实现什么的都不清楚,于是当网上找了下,把几种常见的加密方法都整理了下,用winform写了个程序,如图: 关键代码 using System.Security;using System.Security.Cryptography;using System.Web;using System.IO; //MD5 不区分大小写的        //type 类型,16位还是32位,16位就是取3

AES加密解密&amp;amp;&amp;amp;SHA1、SHA加密&amp;amp;&amp;amp;MD5加密

AES加密解密 SHA1.SHA加密 MD5加密 二话不说立即附上代码: package com.luo.util; import java.io.UnsupportedEncodingException; import java.security.InvalidKeyException; import java.security.MessageDigest; import java.security.NoSuchAlgorithmException; import java.security.

c#加密解密源码,md5、des、rsa

从网上找来的代码,顺手改改,用起来更方便. 感谢原作者的慷慨代码 http://www.cnblogs.com/zhhh/archive/2013/04/13/3018437.html 配置文件 using System; using System.Collections.Generic; using System.Text; using System.IO; using System.Xml.Serialization; namespace Encoder { [Serializable] p

DES对称加解密、AES RijndaelManaged加解密、Base64加密解密、MD5加密等操作辅助类 EncodeHelper

/// <summary> /// 使用默认加密 /// </summary> /// <param name="strText"></param> /// <returns></returns> public static string DesEncrypt(string strText) /// <summary> /// 使用默认解密 /// </summary> /// <pa

Java 关于密码处理的工具类[MD5编码][AES加密/解密]

项目中又遇到了加密问题,又去翻了半天,然后做测试,干脆就把常用的两类小结一下. 1.第一种所谓的MD5加密 其实也不算加密,只是基于Hash算法的不可逆编码而已,等于说,一旦经过MD5处理,是不可能从编码后的字符串反推回去的. MD5的方法是基于散列的.本身信息不全.理论上是不能还原成唯一字符串的. 网上所谓的解密,也只是拥有一个足够大的字典映射,将编码前的源字符和编码后的目标字符关联起来而已,大多数常见的还行,复杂点的估计就会话费很长时间,有兴趣的可以试试. 至于MD5的用法,在初次录入的时候