第一个
1
/** *//************************************************
2
MD5 算法的Java Bean
3@author:Topcat Tuppin
4Last Modified:10,Mar,2001
5
*************************************************/
6
import java.lang.reflect.*;
7/** *//*************************************************
8md5 类实现了RSA Data Security, Inc.在提交给IETF
9的RFC1321中的MD5 message-digest 算法。
10*************************************************/
11
12public class MD5 
{
13
/**//* 下面这些S11-S44实际上是一个4*4的矩阵，在原始的C实现中是用#define 实现的，
14 这里把它们实现成为static final是表示了只读，切能在同一个进程空间内的多个
15
Instance间共享*/
16 static final int S11 = 7;
17 static final int S12 = 12;
18 static final int S13 = 17;
19 static final int S14 = 22;
20
21 static final int S21 = 5;
22 static final int S22 = 9;
23 static final int S23 = 14;
24 static final int S24 = 20;
25
26 static final int S31 = 4;
27 static final int S32 = 11;
28 static final int S33 = 16;
29 static final int S34 = 23;
30
31 static final int S41 = 6;
32 static final int S42 = 10;
33 static final int S43 = 15;
34 static final int S44 = 21;
35
36 static final byte[] PADDING = { -128, 0, 0, 0, 0, 0, 0, 0, 0,
37 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
38 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
39 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
40 /**//* 下面的三个成员是MD5计算过程中用到的3个核心数据，在原始的C实现中
41 被定义到MD5_CTX结构中
42
43 */
44 private long[] state = new long[4]; // state (ABCD)
45 private long[] count = new long[2]; // number of bits, modulo 2^64 (lsb first)
46 private byte[] buffer = new byte[64]; // input buffer
47
48 /**//* digestHexStr是MD5的唯一一个公共成员，是最新一次计算结果的
49 16进制ASCII表示.
50 */
51 public String digestHexStr;
52
53 /**//* digest,是最新一次计算结果的2进制内部表示，表示128bit的MD5值.
54 */
55 private byte[] digest = new byte[16];
56
57 /**//*
58 getMD5ofStr是类MD5最主要的公共方法，入口参数是你想要进行MD5变换的字符串
59 返回的是变换完的结果，这个结果是从公共成员digestHexStr取得的．
60 */
61 public String getMD5ofStr(byte[] inbuf,int length) {
62 md5Init();
63 md5Update(inbuf, length);
64 md5Final();
65 digestHexStr = "";
66 for (int i = 0; i < 16; i++) {
67 digestHexStr += byteHEX(digest[i]);
68 }
69 return digestHexStr;
70
71 }
72 public byte[] getMD5ofBytes(byte[] inbuf,int length) {
73 md5Init();
74 md5Update(inbuf, length);
75 md5Final();
76 return digest;
77 }
78 public String getMD5ofStr(String inbuf) {
79 md5Init();
80 md5Update(inbuf.getBytes(), inbuf.length());
81 md5Final();
82 digestHexStr = "";
83 for (int i = 0; i < 16; i++) {
84 digestHexStr += byteHEX(digest[i]);
85 }
86 return digestHexStr;
87 }
88 // 这是MD5这个类的标准构造函数，JavaBean要求有一个public的并且没有参数的构造函数
89 public MD5() {
90 md5Init();
91
92 return;
93 }
94
95
96
97 /**//* md5Init是一个初始化函数，初始化核心变量，装入标准的幻数 */
98 private void md5Init() {
99 count[0] = 0L;
100 count[1] = 0L;
101 ///* Load magic initialization constants.
102
103 state[0] = 0x67452301L;
104 state[1] = 0xefcdab89L;
105 state[2] = 0x98badcfeL;
106 state[3] = 0x10325476L;
107
108 return;
109 }
110 /**//* F, G, H ,I 是4个基本的MD5函数，在原始的MD5的C实现中，由于它们是
111 简单的位运算，可能出于效率的考虑把它们实现成了宏，在java中，我们把它们
112 实现成了private方法，名字保持了原来C中的。 */
113
114 private long F(long x, long y, long z) {
115 return (x & y) | ((~x) & z);
116
117 }
118 private long G(long x, long y, long z) {
119 return (x & z) | (y & (~z));
120
121 }
122 private long H(long x, long y, long z) {
123 return x ^ y ^ z;
124 }
125
126 private long I(long x, long y, long z) {
127 return y ^ (x | (~z));
128 }
129
130 /**//*
131 FF,GG,HH和II将调用F,G,H,I进行近一步变换
132 FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
133 Rotation is separate from addition to prevent recomputation.
134 */
135
136 private long FF(long a, long b, long c, long d, long x, long s,
137 long ac) {
138 a += F (b, c, d) + x + ac;
139 a = ((int) a << s) | ((int) a >>> (32 - s));
140 a += b;
141 return a;
142 }
143
144 private long GG(long a, long b, long c, long d, long x, long s,
145 long ac) {
146 a += G (b, c, d) + x + ac;
147 a = ((int) a << s) | ((int) a >>> (32 - s));
148 a += b;
149 return a;
150 }
151 private long HH(long a, long b, long c, long d, long x, long s,
152 long ac) {
153 a += H (b, c, d) + x + ac;
154 a = ((int) a << s) | ((int) a >>> (32 - s));
155 a += b;
156 return a;
157 }
158 private long II(long a, long b, long c, long d, long x, long s,
159 long ac) {
160 a += I (b, c, d) + x + ac;
161 a = ((int) a << s) | ((int) a >>> (32 - s));
162 a += b;
163 return a;
164 }
165 /**//*
166 md5Update是MD5的主计算过程，inbuf是要变换的字节串，inputlen是长度，这个
167 函数由getMD5ofStr调用，调用之前需要调用md5init，因此把它设计成private的
168 */
169 private void md5Update(byte[] inbuf, int inputLen) {
170
171 int i, index, partLen;
172 byte[] block = new byte[64];
173 index = (int)(count[0] >>> 3) & 0x3F;
174 // /* Update number of bits */
175 if ((count[0] += (inputLen << 3)) < (inputLen << 3))
176 count[1]++;
177 count[1] += (inputLen >>> 29);
178
179 partLen = 64 - index;
180
181 // Transform as many times as possible.
182 if (inputLen >= partLen) {
183 md5Memcpy(buffer, inbuf, index, 0, partLen);
184 md5Transform(buffer);
185
186 for (i = partLen; i + 63 < inputLen; i += 64) {
187
188 md5Memcpy(block, inbuf, 0, i, 64);
189 md5Transform (block);
190 }
191 index = 0;
192
193 } else
194
195 i = 0;
196
197 ///* Buffer remaining input */
198 md5Memcpy(buffer, inbuf, index, i, inputLen - i);
199
200 }
201
202 /**//*
203 md5Final整理和填写输出结果
204 */
205 private void md5Final () {
206 byte[] bits = new byte[8];
207 int index, padLen;
208
209 ///* Save number of bits */
210 Encode (bits, count, 8);
211
212 ///* Pad out to 56 mod 64.
213 index = (int)(count[0] >>> 3) & 0x3f;
214 padLen = (index < 56) ? (56 - index) : (120 - index);
215 md5Update (PADDING, padLen);
216
217 ///* Append length (before padding) */
218 md5Update(bits, 8);
219
220 ///* Store state in digest */
221 Encode (digest, state, 16);
222 }
223
224 /**//* md5Memcpy是一个内部使用的byte数组的块拷贝函数，从input的inpos开始把len长度的
225 字节拷贝到output的outpos位置开始
226 */
227
228 private void md5Memcpy (byte[] output, byte[] input,
229 int outpos, int inpos, int len)
230 {
231 int i;
232 for (i = 0; i < len; i++)
233 output[outpos + i] = input[inpos + i];
234 }
235
236 /**//*
237 md5Transform是MD5核心变换程序，有md5Update调用，block是分块的原始字节
238 */
239 private void md5Transform (byte block[]) {
240 long a = state[0], b = state[1], c = state[2], d = state[3];
241 long[] x = new long[16];
242
243 Decode (x, block, 64);
244
245 /**//* Round 1 */
246 a = FF (a, b, c, d, x[0], S11, 0xd76aa478L); /**//* 1 */
247 d = FF (d, a, b, c, x[1], S12, 0xe8c7b756L); /**//* 2 */
248 c = FF (c, d, a, b, x[2], S13, 0x242070dbL); /**//* 3 */
249 b = FF (b, c, d, a, x[3], S14, 0xc1bdceeeL); /**//* 4 */
250 a = FF (a, b, c, d, x[4], S11, 0xf57c0fafL); /**//* 5 */
251 d = FF (d, a, b, c, x[5], S12, 0x4787c62aL); /**//* 6 */
252 c = FF (c, d, a, b, x[6], S13, 0xa8304613L); /**//* 7 */
253 b = FF (b, c, d, a, x[7], S14, 0xfd469501L); /**//* 8 */
254 a = FF (a, b, c, d, x[8], S11, 0x698098d8L); /**//* 9 */
255 d = FF (d, a, b, c, x[9], S12, 0x8b44f7afL); /**//* 10 */
256 c = FF (c, d, a, b, x[10], S13, 0xffff5bb1L); /**//* 11 */
257 b = FF (b, c, d, a, x[11], S14, 0x895cd7beL); /**//* 12 */
258 a = FF (a, b, c, d, x[12], S11, 0x6b901122L); /**//* 13 */
259 d = FF (d, a, b, c, x[13], S12, 0xfd987193L); /**//* 14 */
260 c = FF (c, d, a, b, x[14], S13, 0xa679438eL); /**//* 15 */
261 b = FF (b, c, d, a, x[15], S14, 0x49b40821L); /**//* 16 */
262
263 /**//* Round 2 */
264 a = GG (a, b, c, d, x[1], S21, 0xf61e2562L); /**//* 17 */
265 d = GG (d, a, b, c, x[6], S22, 0xc040b340L); /**//* 18 */
266 c = GG (c, d, a, b, x[11], S23, 0x265e5a51L); /**//* 19 */
267 b = GG (b, c, d, a, x[0], S24, 0xe9b6c7aaL); /**//* 20 */
268 a = GG (a, b, c, d, x[5], S21, 0xd62f105dL); /**//* 21 */
269 d = GG (d, a, b, c, x[10], S22, 0x2441453L); /**//* 22 */
270 c = GG (c, d, a, b, x[15], S23, 0xd8a1e681L); /**//* 23 */
271 b = GG (b, c, d, a, x[4], S24, 0xe7d3fbc8L); /**//* 24 */
272 a = GG (a, b, c, d, x[9], S21, 0x21e1cde6L); /**//* 25 */
273 d = GG (d, a, b, c, x[14], S22, 0xc33707d6L); /**//* 26 */
274 c = GG (c, d, a, b, x[3], S23, 0xf4d50d87L); /**//* 27 */
275 b = GG (b, c, d, a, x[8], S24, 0x455a14edL); /**//* 28 */
276 a = GG (a, b, c, d, x[13], S21, 0xa9e3e905L); /**//* 29 */
277 d = GG (d, a, b, c, x[2], S22, 0xfcefa3f8L); /**//* 30 */
278 c = GG (c, d, a, b, x[7], S23, 0x676f02d9L); /**//* 31 */
279 b = GG (b, c, d, a, x[12], S24, 0x8d2a4c8aL); /**//* 32 */
280
281 /**//* Round 3 */
282 a = HH (a, b, c, d, x[5], S31, 0xfffa3942L); /**//* 33 */
283 d = HH (d, a, b, c, x[8], S32, 0x8771f681L); /**//* 34 */
284 c = HH (c, d, a, b, x[11], S33, 0x6d9d6122L); /**//* 35 */
285 b = HH (b, c, d, a, x[14], S34, 0xfde5380cL); /**//* 36 */
286 a = HH (a, b, c, d, x[1], S31, 0xa4beea44L); /**//* 37 */
287 d = HH (d, a, b, c, x[4], S32, 0x4bdecfa9L); /**//* 38 */
288 c = HH (c, d, a, b, x[7], S33, 0xf6bb4b60L); /**//* 39 */
289 b = HH (b, c, d, a, x[10], S34, 0xbebfbc70L); /**//* 40 */
290 a = HH (a, b, c, d, x[13], S31, 0x289b7ec6L); /**//* 41 */
291 d = HH (d, a, b, c, x[0], S32, 0xeaa127faL); /**//* 42 */
292 c = HH (c, d, a, b, x[3], S33, 0xd4ef3085L); /**//* 43 */
293 b = HH (b, c, d, a, x[6], S34, 0x4881d05L); /**//* 44 */
294 a = HH (a, b, c, d, x[9], S31, 0xd9d4d039L); /**//* 45 */
295 d = HH (d, a, b, c, x[12], S32, 0xe6db99e5L); /**//* 46 */
296 c = HH (c, d, a, b, x[15], S33, 0x1fa27cf8L); /**//* 47 */
297 b = HH (b, c, d, a, x[2], S34, 0xc4ac5665L); /**//* 48 */
298
299 /**//* Round 4 */
300 a = II (a, b, c, d, x[0], S41, 0xf4292244L); /**//* 49 */
301 d = II (d, a, b, c, x[7], S42, 0x432aff97L); /**//* 50 */
302 c = II (c, d, a, b, x[14], S43, 0xab9423a7L); /**//* 51 */
303 b = II (b, c, d, a, x[5], S44, 0xfc93a039L); /**//* 52 */
304 a = II (a, b, c, d, x[12], S41, 0x655b59c3L); /**//* 53 */
305 d = II (d, a, b, c, x[3], S42, 0x8f0ccc92L); /**//* 54 */
306 c = II (c, d, a, b, x[10], S43, 0xffeff47dL); /**//* 55 */
307 b = II (b, c, d, a, x[1], S44, 0x85845dd1L); /**//* 56 */
308 a = II (a, b, c, d, x[8], S41, 0x6fa87e4fL); /**//* 57 */
309 d = II (d, a, b, c, x[15], S42, 0xfe2ce6e0L); /**//* 58 */
310 c = II (c, d, a, b, x[6], S43, 0xa3014314L); /**//* 59 */
311 b = II (b, c, d, a, x[13], S44, 0x4e0811a1L); /**//* 60 */
312 a = II (a, b, c, d, x[4], S41, 0xf7537e82L); /**//* 61 */
313 d = II (d, a, b, c, x[11], S42, 0xbd3af235L); /**//* 62 */
314 c = II (c, d, a, b, x[2], S43, 0x2ad7d2bbL); /**//* 63 */
315 b = II (b, c, d, a, x[9], S44, 0xeb86d391L); /**//* 64 */
316
317 state[0] += a;
318 state[1] += b;
319 state[2] += c;
320 state[3] += d;
321
322 }
323
324 /**//*Encode把long数组按顺序拆成byte数组，因为java的long类型是64bit的，
325 只拆低32bit，以适应原始C实现的用途
326 */
327 private void Encode (byte[] output, long[] input, int len) {
328 int i, j;
329 for (i = 0, j = 0; j < len; i++, j += 4) {
330 output[j] = (byte)(input[i] & 0xffL);
331 output[j + 1] = (byte)((input[i] >>> 8) & 0xffL);
332 output[j + 2] = (byte)((input[i] >>> 16) & 0xffL);
333 output[j + 3] = (byte)((input[i] >>> 24) & 0xffL);
334 }
335 }
336
337 /**//*Decode把byte数组按顺序合成成long数组，因为java的long类型是64bit的，
338 只合成低32bit，高32bit清零，以适应原始C实现的用途
339 */
340 private void Decode (long[] output, byte[] input, int len) {
341 int i, j;
342 for (i = 0, j = 0; j < len; i++, j += 4)
343 output[i] = b2iu(input[j]) |
344 (b2iu(input[j + 1]) << 8) |
345 (b2iu(input[j + 2]) << 16) |
346 (b2iu(input[j + 3]) << 24);
347
348 return;
349 }
350
351 /**//*
352 b2iu是我写的一个把byte按照不考虑正负号的原则的＂升位＂程序，因为java没有unsigned运算
353 */
354 public static long b2iu(byte b) {
355 return b < 0 ? b & 0x7F + 128 : b;
356 }
357
358 /**//*byteHEX()，用来把一个byte类型的数转换成十六进制的ASCII表示，
359 因为java中的byte的toString无法实现这一点，我们又没有C语言中的
360 sprintf(outbuf,"%02X",ib)
361 */
362 public static String byteHEX(byte ib) {
363 char[] Digit = { '0','1','2','3','4','5','6','7','8','9',
364 'A','B','C','D','E','F' };
365 char [] ob = new char[2];
366 ob[0] = Digit[(ib >>> 4) & 0X0F];
367 ob[1] = Digit[ib & 0X0F];
368 String s = new String(ob);
369 return s;
370 }
371}
第二个，要简单一些
1package md5;
2import java.security.MessageDigest;
3
4public class Md5 {
5 private final static String[] hexDigits = {"0","1", "2", "3", "4", "5", "6", "7",
6 "8", "9", "a", "b", "c", "d", "e", "f"};
7 /** *//** *//** *//**
8 * 转换字节数组为16进制字串
9 * @param b 字节数组
10 * @return 16进制字串
11 */
12 public String byteArrayToHexString(byte[] b) {
13 StringBuffer resultSb = new StringBuffer();
14 for (int i = 0; i < b.length; i++) {
15 resultSb.append(byteToHexString(b[i]));
16 }
17 return resultSb.toString();
18 }
19 private String byteToHexString(byte b) {
20 int n = b;
21 if (n < 0)
22 n = 256 + n;
23 int d1 = n / 16;
24 int d2 = n % 16;
25 return hexDigits[d1] + hexDigits[d2];
26 }
27 public String MD5Encode(String origin) {
28 String resultString = null;
29 try {
30 resultString=new String(origin);
31 MessageDigest md = MessageDigest.getInstance("MD5");
32 resultString=byteArrayToHexString(md.digest(resultString.getBytes()));
33 }
34 catch (Exception ex) {
35 }
36 return resultString;
37 }
38 public static void main(String[] args){
39 System.err.println(new Md5().MD5Encode("abc"));
40 }
41 /** *//**//*
42 * 在RFC 1321中，给出了Test suite用来检验你的实现是否正确：
43
44MD5 ('') = d41d8cd98f00b204e9800998ecf8427e
45MD5 ('a') = 0cc175b9c0f1b6a831c399e269772661
46MD5 ('abc') = 900150983cd24fb0d6963f7d28e17f72
47MD5 ('message digest') = f96b697d7cb7938d525a2f31aaf161d0
48MD5 ('abcdefghijklmnopqrstuvwxyz') = c3fcd3d76192e4007dfb496cca67e13b
49
50 * */
51}
52