1<script language="JavaScript">
2<!--
3/**********************************************************
4
5* md5.js
6*
7* A JavaScript implementation of the RSA Data Security, Inc. MD5
8* Message-Digest Algorithm.
9*
10* Copyright (C) Paul Johnston 1999. Distributed under the LGPL.
11***********************************************************/
12
13/* to convert strings to a list of ascii values */
14var sAscii = " !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ"
15var sAscii = sAscii + "[\\\\]^_`abcdefghijklmnopqrstuvwxyz{|}~";
16
17/* convert integer to hex string */
18var sHex = "0123456789ABCDEF";
19function hex(i)
20{
21h = "";
22for(j = 0; j <= 3; j++)
23{
24h += sHex.charAt((i >> (j * 8 + 4)) & 0x0F) +
25sHex.charAt((i >> (j * 8)) & 0x0F);
26}
27return h;
28}
29
30/* add, handling overflows correctly */
31function add(x, y)
32{
33return ((x&0x7FFFFFFF) + (y&0x7FFFFFFF)) ^ (x&0x80000000) ^ (y&0x80000000);
34}
35
36/* MD5 rounds functions */
37function R1(A, B, C, D, X, S, T)
38{
39q = add(add(A, (B & C) | (~B & D)), add(X, T));
40return add((q << S) | ((q >> (32 - S)) & (Math.pow(2, S) - 1)), B);
41}
42
43function R2(A, B, C, D, X, S, T)
44{
45q = add(add(A, (B & D) | (C & ~D)), add(X, T));
46return add((q << S) | ((q >> (32 - S)) & (Math.pow(2, S) - 1)), B);
47}
48
49function R3(A, B, C, D, X, S, T)
50{
51q = add(add(A, B ^ C ^ D), add(X, T));
52return add((q << S) | ((q >> (32 - S)) & (Math.pow(2, S) - 1)), B);
53}
54
55function R4(A, B, C, D, X, S, T)
56{
57q = add(add(A, C ^ (B | ~D)), add(X, T));
58return add((q << S) | ((q >> (32 - S)) & (Math.pow(2, S) - 1)), B);
59}
60
61/* main entry point */
62function calcMD5(sInp) {
63
64/* Calculate length in machine words, including padding */
65wLen = (((sInp.length + 8) >> 6) + 1) << 4;
66var X = new Array(wLen);
67
68/* Convert string to array of words */
69j = 4;
70for (i = 0; (i * 4) < sInp.length; i++)
71{
72X[i] = 0;
73for (j = 0; (j < 4) && ((j + i * 4) < sInp.length); j++)
74{
75X[i] += (sAscii.indexOf(sInp.charAt((i * 4) + j)) + 32) << (j * 8);
76}
77}
78
79/* Append padding bits and length */
80if (j == 4)
81{
82X[i++] = 0x80;
83}
84else
85{
86X[i - 1] += 0x80 << (j * 8);
87}
88for(; i < wLen; i++) { X[i] = 0; }
89X[wLen - 2] = sInp.length * 8;
90
91/* hard-coded initial values */
92a = 0x67452301;
93b = 0xefcdab89;
94c = 0x98badcfe;
95d = 0x10325476;
96
97/* Process each 16-word block in turn */
98for (i = 0; i < wLen; i += 16) {
99aO = a;
100bO = b;
101cO = c;
102dO = d;
103
104a = R1(a, b, c, d, X[i+ 0], 7 , 0xd76aa478);
105d = R1(d, a, b, c, X[i+ 1], 12, 0xe8c7b756);
106c = R1(c, d, a, b, X[i+ 2], 17, 0x242070db);
107b = R1(b, c, d, a, X[i+ 3], 22, 0xc1bdceee);
108a = R1(a, b, c, d, X[i+ 4], 7 , 0xf57c0faf);
109d = R1(d, a, b, c, X[i+ 5], 12, 0x4787c62a);
110c = R1(c, d, a, b, X[i+ 6], 17, 0xa8304613);
111b = R1(b, c, d, a, X[i+ 7], 22, 0xfd469501);
112a = R1(a, b, c, d, X[i+ 8], 7 , 0x698098d8);
113d = R1(d, a, b, c, X[i+ 9], 12, 0x8b44f7af);
114c = R1(c, d, a, b, X[i+10], 17, 0xffff5bb1);
115b = R1(b, c, d, a, X[i+11], 22, 0x895cd7be);
116a = R1(a, b, c, d, X[i+12], 7 , 0x6b901122);
117d = R1(d, a, b, c, X[i+13], 12, 0xfd987193);
118c = R1(c, d, a, b, X[i+14], 17, 0xa679438e);
119b = R1(b, c, d, a, X[i+15], 22, 0x49b40821);
120
121a = R2(a, b, c, d, X[i+ 1], 5 , 0xf61e2562);
122d = R2(d, a, b, c, X[i+ 6], 9 , 0xc040b340);
123c = R2(c, d, a, b, X[i+11], 14, 0x265e5a51);
124b = R2(b, c, d, a, X[i+ 0], 20, 0xe9b6c7aa);
125a = R2(a, b, c, d, X[i+ 5], 5 , 0xd62f105d);
126d = R2(d, a, b, c, X[i+10], 9 , 0x2441453);
127c = R2(c, d, a, b, X[i+15], 14, 0xd8a1e681);
128b = R2(b, c, d, a, X[i+ 4], 20, 0xe7d3fbc8);
129a = R2(a, b, c, d, X[i+ 9], 5 , 0x21e1cde6);
130d = R2(d, a, b, c, X[i+14], 9 , 0xc33707d6);
131c = R2(c, d, a, b, X[i+ 3], 14, 0xf4d50d87);
132b = R2(b, c, d, a, X[i+ 8], 20, 0x455a14ed);
133a = R2(a, b, c, d, X[i+13], 5 , 0xa9e3e905);
134d = R2(d, a, b, c, X[i+ 2], 9 , 0xfcefa3f8);
135c = R2(c, d, a, b, X[i+ 7], 14, 0x676f02d9);
136b = R2(b, c, d, a, X[i+12], 20, 0x8d2a4c8a);
137
138a = R3(a, b, c, d, X[i+ 5], 4 , 0xfffa3942);
139d = R3(d, a, b, c, X[i+ 8], 11, 0x8771f681);
140c = R3(c, d, a, b, X[i+11], 16, 0x6d9d6122);
141b = R3(b, c, d, a, X[i+14], 23, 0xfde5380c);
142a = R3(a, b, c, d, X[i+ 1], 4 , 0xa4beea44);
143d = R3(d, a, b, c, X[i+ 4], 11, 0x4bdecfa9);
144c = R3(c, d, a, b, X[i+ 7], 16, 0xf6bb4b60);
145b = R3(b, c, d, a, X[i+10], 23, 0xbebfbc70);
146a = R3(a, b, c, d, X[i+13], 4 , 0x289b7ec6);
147d = R3(d, a, b, c, X[i+ 0], 11, 0xeaa127fa);
148c = R3(c, d, a, b, X[i+ 3], 16, 0xd4ef3085);
149b = R3(b, c, d, a, X[i+ 6], 23, 0x4881d05);
150a = R3(a, b, c, d, X[i+ 9], 4 , 0xd9d4d039);
151d = R3(d, a, b, c, X[i+12], 11, 0xe6db99e5);
152c = R3(c, d, a, b, X[i+15], 16, 0x1fa27cf8);
153b = R3(b, c, d, a, X[i+ 2], 23, 0xc4ac5665);
154
155a = R4(a, b, c, d, X[i+ 0], 6 , 0xf4292244);
156d = R4(d, a, b, c, X[i+ 7], 10, 0x432aff97);
157c = R4(c, d, a, b, X[i+14], 15, 0xab9423a7);
158b = R4(b, c, d, a, X[i+ 5], 21, 0xfc93a039);
159a = R4(a, b, c, d, X[i+12], 6 , 0x655b59c3);
160d = R4(d, a, b, c, X[i+ 3], 10, 0x8f0ccc92);
161c = R4(c, d, a, b, X[i+10], 15, 0xffeff47d);
162b = R4(b, c, d, a, X[i+ 1], 21, 0x85845dd1);
163a = R4(a, b, c, d, X[i+ 8], 6 , 0x6fa87e4f);
164d = R4(d, a, b, c, X[i+15], 10, 0xfe2ce6e0);
165c = R4(c, d, a, b, X[i+ 6], 15, 0xa3014314);
166b = R4(b, c, d, a, X[i+13], 21, 0x4e0811a1);
167a = R4(a, b, c, d, X[i+ 4], 6 , 0xf7537e82);
168d = R4(d, a, b, c, X[i+11], 10, 0xbd3af235);
169c = R4(c, d, a, b, X[i+ 2], 15, 0x2ad7d2bb);
170b = R4(b, c, d, a, X[i+ 9], 21, 0xeb86d391);
171
172a = add(a, aO);
173b = add(b, bO);
174c = add(c, cO);
175d = add(d, dO);
176}
177return hex(a) + hex(b) + hex(c) + hex(d);
178}
179
180alert(hex("123456"))
181//-->
182</script>
MD5算法在JS中的实现
comments powered by Disqus