MD5key.java

代码如下：

package com.lekou.utils;
 
public class MD5key {
 
;
;
;
;
;
;
;
;
;
;
;
;
;
;
;
;
 
, , , , , , , , , , , , ,
, , , , , , , , , , , , , , , , , , , , , ,
, , , , , , , , , , , , , , , , , , , , , ,
, , , , , ,  };
 
]; // state (ABCD)
 
]; // number of bits, modulo 2^64 (lsb
// first)
]; // input buffer
 
public String digestHexStr;
 
];
 
public String getkeyBeanofStr(String inbuf) {
keyBeanInit();
keyBeanUpdate(inbuf.getBytes(), inbuf.length());
keyBeanFinal();
digestHexStr = "";
; i < ; i++) {
digestHexStr += byteHEX(digest[i]);
}
return digestHexStr;
}
 
public MD5key() {
keyBeanInit();
return;
}
 
private void keyBeanInit() {
count[] = 0L;
count[] = 0L;
// /* Load magic initialization constants.
state[] = 0x67452301L;
state[] = 0xefcdab89L;
state[] = 0x98badcfeL;
state[] = 0x10325476L;
return;
}
 
private long F(long x, long y, long z) {
return (x & y) | ((~x) & z);
}
 
private long G(long x, long y, long z) {
return (x & z) | (y & (~z));
}
 
private long H(long x, long y, long z) {
return x ^ y ^ z;
}
 
private long I(long x, long y, long z) {
return y ^ (x | (~z));
}
 
private long FF(long a, long b, long c, long d, long x, long s, long ac) {
a += F(b, c, d) + x + ac;
a = (( - s));
a += b;
return a;
}
 
private long GG(long a, long b, long c, long d, long x, long s, long ac) {
a += G(b, c, d) + x + ac;
a = (( - s));
a += b;
return a;
}
 
private long HH(long a, long b, long c, long d, long x, long s, long ac) {
a += H(b, c, d) + x + ac;
a = (( - s));
a += b;
return a;
}
 
private long II(long a, long b, long c, long d, long x, long s, long ac) {
a += I(b, c, d) + x + ac;
a = (( - s));
a += b;
return a;
}
 
private void keyBeanUpdate(byte[] inbuf, int inputLen) {
int i, index, partLen;
];
index = (] >>> ) & 0x3F;
// /* Update number of bits */
] += (inputLen << )) < (inputLen << ))
count[]++;
count[] += (inputLen >>> );
partLen =  - index;
// Transform as many times as possible.
if (inputLen >= partLen) {
keyBeanMemcpy(buffer, inbuf, index, , partLen);
keyBeanTransform(buffer);
 < inputLen; i += ) {
keyBeanMemcpy(block, inbuf, , i, );
keyBeanTransform(block);
}
index = ;
} else
i = ;
// /* Buffer remaining input */
keyBeanMemcpy(buffer, inbuf, index, i, inputLen - i);
}
 
private void keyBeanFinal() {
];
int index, padLen;
// /* Save number of bits */
Encode(bits, count, );
// /* Pad out to 56 mod 64.
index = (] >>> ) & 0x3f;
padLen = (index < ) ? ( - index) : ( - index);
keyBeanUpdate(PADDING, padLen);
// /* Append length (before padding) */
keyBeanUpdate(bits, );
// /* Store state in digest */
Encode(digest, state, );
}
 
private void keyBeanMemcpy(byte[] output, byte[] input, int outpos,
int inpos, int len) {
int i;
; i < len; i++)
output[outpos + i] = input[inpos + i];
}
 
private void keyBeanTransform(byte block[]) {
], b = state[], c = state[], d = state[];
];
Decode(x, block, );
/* Round 1 */
a = FF(a, b, c, d, x[], S11, 0xd76aa478L); /* 1 */
d = FF(d, a, b, c, x[], S12, 0xe8c7b756L); /* 2 */
c = FF(c, d, a, b, x[], S13, 0x242070dbL); /* 3 */
b = FF(b, c, d, a, x[], S14, 0xc1bdceeeL); /* 4 */
a = FF(a, b, c, d, x[], S11, 0xf57c0fafL); /* 5 */
d = FF(d, a, b, c, x[], S12, 0x4787c62aL); /* 6 */
c = FF(c, d, a, b, x[], S13, 0xa8304613L); /* 7 */
b = FF(b, c, d, a, x[], S14, 0xfd469501L); /* 8 */
a = FF(a, b, c, d, x[], S11, 0x698098d8L); /* 9 */
d = FF(d, a, b, c, x[], S12, 0x8b44f7afL); /* 10 */
c = FF(c, d, a, b, x[], S13, 0xffff5bb1L); /* 11 */
b = FF(b, c, d, a, x[], S14, 0x895cd7beL); /* 12 */
a = FF(a, b, c, d, x[], S11, 0x6b901122L); /* 13 */
d = FF(d, a, b, c, x[], S12, 0xfd987193L); /* 14 */
c = FF(c, d, a, b, x[], S13, 0xa679438eL); /* 15 */
b = FF(b, c, d, a, x[], S14, 0x49b40821L); /* 16 */
/* Round 2 */
a = GG(a, b, c, d, x[], S21, 0xf61e2562L); /* 17 */
d = GG(d, a, b, c, x[], S22, 0xc040b340L); /* 18 */
c = GG(c, d, a, b, x[], S23, 0x265e5a51L); /* 19 */
b = GG(b, c, d, a, x[], S24, 0xe9b6c7aaL); /* 20 */
a = GG(a, b, c, d, x[], S21, 0xd62f105dL); /* 21 */
d = GG(d, a, b, c, x[], S22, 0x2441453L); /* 22 */
c = GG(c, d, a, b, x[], S23, 0xd8a1e681L); /* 23 */
b = GG(b, c, d, a, x[], S24, 0xe7d3fbc8L); /* 24 */
a = GG(a, b, c, d, x[], S21, 0x21e1cde6L); /* 25 */
d = GG(d, a, b, c, x[], S22, 0xc33707d6L); /* 26 */
c = GG(c, d, a, b, x[], S23, 0xf4d50d87L); /* 27 */
b = GG(b, c, d, a, x[], S24, 0x455a14edL); /* 28 */
a = GG(a, b, c, d, x[], S21, 0xa9e3e905L); /* 29 */
d = GG(d, a, b, c, x[], S22, 0xfcefa3f8L); /* 30 */
c = GG(c, d, a, b, x[], S23, 0x676f02d9L); /* 31 */
b = GG(b, c, d, a, x[], S24, 0x8d2a4c8aL); /* 32 */
/* Round 3 */
a = HH(a, b, c, d, x[], S31, 0xfffa3942L); /* 33 */
d = HH(d, a, b, c, x[], S32, 0x8771f681L); /* 34 */
c = HH(c, d, a, b, x[], S33, 0x6d9d6122L); /* 35 */
b = HH(b, c, d, a, x[], S34, 0xfde5380cL); /* 36 */
a = HH(a, b, c, d, x[], S31, 0xa4beea44L); /* 37 */
d = HH(d, a, b, c, x[], S32, 0x4bdecfa9L); /* 38 */
c = HH(c, d, a, b, x[], S33, 0xf6bb4b60L); /* 39 */
b = HH(b, c, d, a, x[], S34, 0xbebfbc70L); /* 40 */
a = HH(a, b, c, d, x[], S31, 0x289b7ec6L); /* 41 */
d = HH(d, a, b, c, x[], S32, 0xeaa127faL); /* 42 */
c = HH(c, d, a, b, x[], S33, 0xd4ef3085L); /* 43 */
b = HH(b, c, d, a, x[], S34, 0x4881d05L); /* 44 */
a = HH(a, b, c, d, x[], S31, 0xd9d4d039L); /* 45 */
d = HH(d, a, b, c, x[], S32, 0xe6db99e5L); /* 46 */
c = HH(c, d, a, b, x[], S33, 0x1fa27cf8L); /* 47 */
b = HH(b, c, d, a, x[], S34, 0xc4ac5665L); /* 48 */
/* Round 4 */
a = II(a, b, c, d, x[], S41, 0xf4292244L); /* 49 */
d = II(d, a, b, c, x[], S42, 0x432aff97L); /* 50 */
c = II(c, d, a, b, x[], S43, 0xab9423a7L); /* 51 */
b = II(b, c, d, a, x[], S44, 0xfc93a039L); /* 52 */
a = II(a, b, c, d, x[], S41, 0x655b59c3L); /* 53 */
d = II(d, a, b, c, x[], S42, 0x8f0ccc92L); /* 54 */
c = II(c, d, a, b, x[], S43, 0xffeff47dL); /* 55 */
b = II(b, c, d, a, x[], S44, 0x85845dd1L); /* 56 */
a = II(a, b, c, d, x[], S41, 0x6fa87e4fL); /* 57 */
d = II(d, a, b, c, x[], S42, 0xfe2ce6e0L); /* 58 */
c = II(c, d, a, b, x[], S43, 0xa3014314L); /* 59 */
b = II(b, c, d, a, x[], S44, 0x4e0811a1L); /* 60 */
a = II(a, b, c, d, x[], S41, 0xf7537e82L); /* 61 */
d = II(d, a, b, c, x[], S42, 0xbd3af235L); /* 62 */
c = II(c, d, a, b, x[], S43, 0x2ad7d2bbL); /* 63 */
b = II(b, c, d, a, x[], S44, 0xeb86d391L); /* 64 */
state[] += a;
state[] += b;
state[] += c;
state[] += d;
}
 
private void Encode(byte[] output, long[] input, int len) {
int i, j;
, j = ; j < len; i++, j += ) {
output[j] = (byte) (input[i] & 0xffL);
output[j + ] = () & 0xffL);
output[j + ] = () & 0xffL);
output[j + ] = () & 0xffL);
}
}
 
private void Decode(long[] output, byte[] input, int len) {
int i, j;
 
, j = ; j < len; i++, j += )
output[i] = b2iu(input[j]) | (b2iu(input[j + ]) << )
| (b2iu(input[j + ]) << ) | (b2iu(input[j + ]) << );
return;
}
 
public static long b2iu(byte b) {
 ? b &  : b;
}
 
public static String byteHEX(byte ib) {
', 'A',
'B', 'C', 'D', 'E', 'F' };
];
ob[] = Digit[(ib >>> ) & 0X0F];
ob[] = Digit[ib & 0X0F];
String s = new String(ob);
return s;
}
}

controller层这样实现：

//注册新用户
    @RequestMapping("doRegister")
    @ResponseBody
    public int doRegister(User user,String randomCode,HttpServletRequest request) {
        ;
        String code = (String) request.getSession().getAttribute("randomCode");
        //验证码一致就做添加
        if(code.equals(randomCode)) {
          try {
                MD5key md5key = new MD5key();
                String password = md5key.getkeyBeanofStr(user.getPassword());
                user.setPassword(password);
 
                i=service.insertRegister(user);
            } catch (Exception e) {
                e.printStackTrace();
                ;
            }
 
            ) {
                ;
            }else {
                ;
            }
        }else {
            ;//验证码不一致
        }
    }