1 | /***************************************************************************** |
---|
2 | * |
---|
3 | * "derived from the RSA Data Security, Inc. MD5 Message-Digest Algorithm". |
---|
4 | * |
---|
5 | * This program is free software; you can redistribute it and/or modify |
---|
6 | * it under the terms of the GNU General Public License as published by |
---|
7 | * the Free Software Foundation; either version 2 of the License, or |
---|
8 | * (at your option) any later version. |
---|
9 | * |
---|
10 | * This program is distributed in the hope that it will be useful, |
---|
11 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
---|
12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
---|
13 | * GNU General Public License for more details. |
---|
14 | * |
---|
15 | * You should have received a copy of the GNU General Public License |
---|
16 | * along with this program; if not, write to the Free Software |
---|
17 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
---|
18 | * |
---|
19 | *****************************************************************************/ |
---|
20 | |
---|
21 | //#include <endian.h> |
---|
22 | #include <md5.h> |
---|
23 | #include <string.h> |
---|
24 | |
---|
25 | #define __BYTE_ORDER __LITTLE_ENDIAN |
---|
26 | |
---|
27 | #if (__BYTE_ORDER == __BIG_ENDIAN) |
---|
28 | /* |
---|
29 | Block copy and convert byte order to little-endian. |
---|
30 | dst must be 32bit aligned. |
---|
31 | Length is the number of 32bit words |
---|
32 | */ |
---|
33 | static void CopyToLittleEndian (uint32_t *dst, const uint8_t *src, int length) { |
---|
34 | while (length--) { |
---|
35 | *dst=(((uint32_t)src[3])<<24) | |
---|
36 | (((uint32_t)src[2])<<16) | |
---|
37 | (((uint32_t)src[1])<< 8) | |
---|
38 | (uint32_t)src[0]; |
---|
39 | src+=4; |
---|
40 | dst++; |
---|
41 | } |
---|
42 | } |
---|
43 | #endif |
---|
44 | |
---|
45 | |
---|
46 | /* |
---|
47 | Assembler versions of __MD5Transform, MD5Init and MD5Update |
---|
48 | currently exist for x86 and little-endian ARM. |
---|
49 | For other targets, we need to use the C versions below. |
---|
50 | */ |
---|
51 | |
---|
52 | #if !(defined (__i386__) || ((defined (__arm__) && (__BYTE_ORDER == __LITTLE_ENDIAN)))) |
---|
53 | |
---|
54 | /* |
---|
55 | Initialise the MD5 context. |
---|
56 | */ |
---|
57 | void MD5Init (MD5_CTX* context) { |
---|
58 | context->count[0] = 0; |
---|
59 | context->count[1] = 0; |
---|
60 | |
---|
61 | context->state[0] = 0x67452301; /* Load magic constants. */ |
---|
62 | context->state[1] = 0xefcdab89; |
---|
63 | context->state[2] = 0x98badcfe; |
---|
64 | context->state[3] = 0x10325476; |
---|
65 | } |
---|
66 | |
---|
67 | #define ROTATE_LEFT(x, n) ((x << n) | (x >> (32-n))) |
---|
68 | |
---|
69 | #define F(x, y, z) (z ^ (x & (y ^ z))) |
---|
70 | #define G(x, y, z) (y ^ (z & (x ^ y))) |
---|
71 | #define H(x, y, z) (x ^ y ^ z) |
---|
72 | #define I(x, y, z) (y ^ (x | ~z)) |
---|
73 | |
---|
74 | #define FF(a, b, c, d, x, s, ac) { (a) += F (b, c, d) + (x) + (uint32_t)(ac); (a) = ROTATE_LEFT (a, s); (a) += (b); } |
---|
75 | #define GG(a, b, c, d, x, s, ac) { (a) += G (b, c, d) + (x) + (uint32_t)(ac); (a) = ROTATE_LEFT (a, s); (a) += (b); } |
---|
76 | #define HH(a, b, c, d, x, s, ac) { (a) += H (b, c, d) + (x) + (uint32_t)(ac); (a) = ROTATE_LEFT (a, s); (a) += (b); } |
---|
77 | #define II(a, b, c, d, x, s, ac) { (a) += I (b, c, d) + (x) + (uint32_t)(ac); (a) = ROTATE_LEFT (a, s); (a) += (b); } |
---|
78 | |
---|
79 | static void __MD5Transform (uint32_t state[4], const uint8_t *in, int repeat) { |
---|
80 | const uint32_t *x; |
---|
81 | |
---|
82 | uint32_t a = state[0]; |
---|
83 | uint32_t b = state[1]; |
---|
84 | uint32_t c = state[2]; |
---|
85 | uint32_t d = state[3]; |
---|
86 | |
---|
87 | for ( ; repeat; repeat--) { |
---|
88 | uint32_t tempBuffer[16]; |
---|
89 | #if (__BYTE_ORDER == __BIG_ENDIAN) |
---|
90 | |
---|
91 | CopyToLittleEndian (tempBuffer, in, 16); |
---|
92 | x = tempBuffer; |
---|
93 | #else |
---|
94 | if ((long)in & 3) { |
---|
95 | memcpy(tempBuffer, (void*)in, 64); |
---|
96 | x = tempBuffer; |
---|
97 | } else |
---|
98 | x = (const uint32_t *) in; |
---|
99 | #endif |
---|
100 | |
---|
101 | FF (a, b, c, d, x[ 0], 7, 0xd76aa478); /* 1 */ /* Round 1 */ |
---|
102 | FF (d, a, b, c, x[ 1], 12, 0xe8c7b756); /* 2 */ |
---|
103 | FF (c, d, a, b, x[ 2], 17, 0x242070db); /* 3 */ |
---|
104 | FF (b, c, d, a, x[ 3], 22, 0xc1bdceee); /* 4 */ |
---|
105 | FF (a, b, c, d, x[ 4], 7, 0xf57c0faf); /* 5 */ |
---|
106 | FF (d, a, b, c, x[ 5], 12, 0x4787c62a); /* 6 */ |
---|
107 | FF (c, d, a, b, x[ 6], 17, 0xa8304613); /* 7 */ |
---|
108 | FF (b, c, d, a, x[ 7], 22, 0xfd469501); /* 8 */ |
---|
109 | FF (a, b, c, d, x[ 8], 7, 0x698098d8); /* 9 */ |
---|
110 | FF (d, a, b, c, x[ 9], 12, 0x8b44f7af); /* 10 */ |
---|
111 | FF (c, d, a, b, x[10], 17, 0xffff5bb1); /* 11 */ |
---|
112 | FF (b, c, d, a, x[11], 22, 0x895cd7be); /* 12 */ |
---|
113 | FF (a, b, c, d, x[12], 7, 0x6b901122); /* 13 */ |
---|
114 | FF (d, a, b, c, x[13], 12, 0xfd987193); /* 14 */ |
---|
115 | FF (c, d, a, b, x[14], 17, 0xa679438e); /* 15 */ |
---|
116 | FF (b, c, d, a, x[15], 22, 0x49b40821); /* 16 */ |
---|
117 | |
---|
118 | GG (a, b, c, d, x[ 1], 5, 0xf61e2562); /* 17 */ /* Round 2 */ |
---|
119 | GG (d, a, b, c, x[ 6], 9, 0xc040b340); /* 18 */ |
---|
120 | GG (c, d, a, b, x[11], 14, 0x265e5a51); /* 19 */ |
---|
121 | GG (b, c, d, a, x[ 0], 20, 0xe9b6c7aa); /* 20 */ |
---|
122 | GG (a, b, c, d, x[ 5], 5, 0xd62f105d); /* 21 */ |
---|
123 | GG (d, a, b, c, x[10], 9, 0x02441453); /* 22 */ |
---|
124 | GG (c, d, a, b, x[15], 14, 0xd8a1e681); /* 23 */ |
---|
125 | GG (b, c, d, a, x[ 4], 20, 0xe7d3fbc8); /* 24 */ |
---|
126 | GG (a, b, c, d, x[ 9], 5, 0x21e1cde6); /* 25 */ |
---|
127 | GG (d, a, b, c, x[14], 9, 0xc33707d6); /* 26 */ |
---|
128 | GG (c, d, a, b, x[ 3], 14, 0xf4d50d87); /* 27 */ |
---|
129 | GG (b, c, d, a, x[ 8], 20, 0x455a14ed); /* 28 */ |
---|
130 | GG (a, b, c, d, x[13], 5, 0xa9e3e905); /* 29 */ |
---|
131 | GG (d, a, b, c, x[ 2], 9, 0xfcefa3f8); /* 30 */ |
---|
132 | GG (c, d, a, b, x[ 7], 14, 0x676f02d9); /* 31 */ |
---|
133 | GG (b, c, d, a, x[12], 20, 0x8d2a4c8a); /* 32 */ |
---|
134 | |
---|
135 | HH (a, b, c, d, x[ 5], 4, 0xfffa3942); /* 33 */ /* Round 3 */ |
---|
136 | HH (d, a, b, c, x[ 8], 11, 0x8771f681); /* 34 */ |
---|
137 | HH (c, d, a, b, x[11], 16, 0x6d9d6122); /* 35 */ |
---|
138 | HH (b, c, d, a, x[14], 23, 0xfde5380c); /* 36 */ |
---|
139 | HH (a, b, c, d, x[ 1], 4, 0xa4beea44); /* 37 */ |
---|
140 | HH (d, a, b, c, x[ 4], 11, 0x4bdecfa9); /* 38 */ |
---|
141 | HH (c, d, a, b, x[ 7], 16, 0xf6bb4b60); /* 39 */ |
---|
142 | HH (b, c, d, a, x[10], 23, 0xbebfbc70); /* 40 */ |
---|
143 | HH (a, b, c, d, x[13], 4, 0x289b7ec6); /* 41 */ |
---|
144 | HH (d, a, b, c, x[ 0], 11, 0xeaa127fa); /* 42 */ |
---|
145 | HH (c, d, a, b, x[ 3], 16, 0xd4ef3085); /* 43 */ |
---|
146 | HH (b, c, d, a, x[ 6], 23, 0x04881d05); /* 44 */ |
---|
147 | HH (a, b, c, d, x[ 9], 4, 0xd9d4d039); /* 45 */ |
---|
148 | HH (d, a, b, c, x[12], 11, 0xe6db99e5); /* 46 */ |
---|
149 | HH (c, d, a, b, x[15], 16, 0x1fa27cf8); /* 47 */ |
---|
150 | HH (b, c, d, a, x[ 2], 23, 0xc4ac5665); /* 48 */ |
---|
151 | |
---|
152 | II (a, b, c, d, x[ 0], 6, 0xf4292244); /* 49 */ /* Round 4 */ |
---|
153 | II (d, a, b, c, x[ 7], 10, 0x432aff97); /* 50 */ |
---|
154 | II (c, d, a, b, x[14], 15, 0xab9423a7); /* 51 */ |
---|
155 | II (b, c, d, a, x[ 5], 21, 0xfc93a039); /* 52 */ |
---|
156 | II (a, b, c, d, x[12], 6, 0x655b59c3); /* 53 */ |
---|
157 | II (d, a, b, c, x[ 3], 10, 0x8f0ccc92); /* 54 */ |
---|
158 | II (c, d, a, b, x[10], 15, 0xffeff47d); /* 55 */ |
---|
159 | II (b, c, d, a, x[ 1], 21, 0x85845dd1); /* 56 */ |
---|
160 | II (a, b, c, d, x[ 8], 6, 0x6fa87e4f); /* 57 */ |
---|
161 | II (d, a, b, c, x[15], 10, 0xfe2ce6e0); /* 58 */ |
---|
162 | II (c, d, a, b, x[ 6], 15, 0xa3014314); /* 59 */ |
---|
163 | II (b, c, d, a, x[13], 21, 0x4e0811a1); /* 60 */ |
---|
164 | II (a, b, c, d, x[ 4], 6, 0xf7537e82); /* 61 */ |
---|
165 | II (d, a, b, c, x[11], 10, 0xbd3af235); /* 62 */ |
---|
166 | II (c, d, a, b, x[ 2], 15, 0x2ad7d2bb); /* 63 */ |
---|
167 | II (b, c, d, a, x[ 9], 21, 0xeb86d391); /* 64 */ |
---|
168 | |
---|
169 | state[0] = a = a + state[0]; |
---|
170 | state[1] = b = b + state[1]; |
---|
171 | state[2] = c = c + state[2]; |
---|
172 | state[3] = d = d + state[3]; |
---|
173 | |
---|
174 | in += 64; |
---|
175 | } |
---|
176 | } |
---|
177 | |
---|
178 | |
---|
179 | /* |
---|
180 | MD5 block update operation: |
---|
181 | Process another sub-string of the message and update the context. |
---|
182 | */ |
---|
183 | void MD5Update (MD5_CTX *context, const uint8_t *input, size_t inputBytes) { |
---|
184 | int i; |
---|
185 | int byteIndex; |
---|
186 | unsigned int partLen; |
---|
187 | int len; |
---|
188 | |
---|
189 | /* Compute number of bytes mod 64 */ |
---|
190 | byteIndex = (context->count[0] >> 3) & 0x3F; |
---|
191 | |
---|
192 | /* Update number of bits: count += 8 * inputBytes */ |
---|
193 | if ((context->count[0] += inputBytes << 3) < (inputBytes << 3)) |
---|
194 | context->count[1]++; |
---|
195 | context->count[1] += (inputBytes >> (32-3)); |
---|
196 | |
---|
197 | partLen = (64 - byteIndex); |
---|
198 | |
---|
199 | /* Transform as many times as possible. */ |
---|
200 | if (inputBytes >= partLen) { |
---|
201 | memcpy (context->buffer + byteIndex, (void*)input, partLen); |
---|
202 | __MD5Transform (context->state, (const uint8_t *) context->buffer, 1); |
---|
203 | len = (inputBytes - partLen) / 64; |
---|
204 | __MD5Transform (context->state, &input[partLen], len); |
---|
205 | i = partLen + 64 * len; |
---|
206 | byteIndex = 0; |
---|
207 | } else |
---|
208 | i = 0; |
---|
209 | |
---|
210 | /* Buffer remaining input */ |
---|
211 | memcpy (&context->buffer[byteIndex], (void*)&input[i], inputBytes - i); |
---|
212 | } |
---|
213 | |
---|
214 | #endif |
---|
215 | |
---|
216 | |
---|
217 | void MD5Final (uint8_t digest[16], MD5_CTX* context) { |
---|
218 | static uint8_t finalBlock[64]; |
---|
219 | |
---|
220 | uint32_t bits[2]; |
---|
221 | int byteIndex; |
---|
222 | int finalBlockLength; |
---|
223 | |
---|
224 | byteIndex = (context->count[0] >> 3) & 0x3F; |
---|
225 | finalBlockLength = ((byteIndex < 56) ? 56 : 120) - byteIndex; |
---|
226 | finalBlock[0] = 0x80; |
---|
227 | |
---|
228 | #if (__BYTE_ORDER == __BIG_ENDIAN) |
---|
229 | CopyToLittleEndian (bits, (const uint8_t *) context->count, 2); |
---|
230 | #else |
---|
231 | memcpy(bits, context->count, 8); |
---|
232 | #endif |
---|
233 | |
---|
234 | MD5Update (context, finalBlock, finalBlockLength); |
---|
235 | MD5Update (context, (const uint8_t *) bits, 8); |
---|
236 | |
---|
237 | #if (__BYTE_ORDER == __BIG_ENDIAN) |
---|
238 | CopyToLittleEndian ((uint32_t *) digest, (const uint8_t *) context->state, 4); |
---|
239 | #else |
---|
240 | memcpy (digest, context->state, 16); |
---|
241 | #endif |
---|
242 | |
---|
243 | memset(context, 0, sizeof(*context)); |
---|
244 | } |
---|
245 | |
---|