1 /* $OpenBSD: md5.c,v 1.8 2005/08/08 08:05:35 espie Exp $ */
2
3 /*
4 * This code implements the MD5 message-digest algorithm.
5 * The algorithm is due to Ron Rivest. This code was
6 * written by Colin Plumb in 1993, no copyright is claimed.
7 * This code is in the public domain; do with it what you wish.
8 *
9 * Equivalent code is available from RSA Data Security, Inc.
10 * This code has been tested against that, and is equivalent,
11 * except that you don't need to include two pages of legalese
12 * with every copy.
13 *
14 * To compute the message digest of a chunk of bytes, declare an
15 * MD5Context structure, pass it to MD5Init, call MD5Update as
16 * needed on buffers full of bytes, and then call MD5Final, which
17 * will fill a supplied 16-byte array with the digest.
18 */
19
20 #include <sys/types.h>
21 #include <string.h>
22 #include <md5.h>
23
24 extern const uint8_t RFC1321_padding[64];
25
26 __RCSID("$MirOS: src/lib/libc/hash/md5.c,v 1.3 2009/11/09 21:36:39 tg Exp $");
27
28 #define PUT_64BIT_LE(cp, value) do { \
29 (cp)[7] = (value) >> 56; \
30 (cp)[6] = (value) >> 48; \
31 (cp)[5] = (value) >> 40; \
32 (cp)[4] = (value) >> 32; \
33 (cp)[3] = (value) >> 24; \
34 (cp)[2] = (value) >> 16; \
35 (cp)[1] = (value) >> 8; \
36 (cp)[0] = (value); } while (0)
37
38 #define PUT_32BIT_LE(cp, value) do { \
39 (cp)[3] = (value) >> 24; \
40 (cp)[2] = (value) >> 16; \
41 (cp)[1] = (value) >> 8; \
42 (cp)[0] = (value); } while (0)
43
44 /*
45 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
46 * initialization constants.
47 */
48 void
MD5Init(MD5_CTX * ctx)49 MD5Init(MD5_CTX *ctx)
50 {
51 ctx->count = 0;
52 ctx->state[0] = 0x67452301;
53 ctx->state[1] = 0xefcdab89;
54 ctx->state[2] = 0x98badcfe;
55 ctx->state[3] = 0x10325476;
56 }
57
58 /*
59 * Update context to reflect the concatenation of another buffer full
60 * of bytes.
61 */
62 void
MD5Update(MD5_CTX * ctx,const unsigned char * input,size_t len)63 MD5Update(MD5_CTX *ctx, const unsigned char *input, size_t len)
64 {
65 size_t have, need;
66
67 /* Check how many bytes we already have and how many more we need. */
68 have = (size_t)((ctx->count >> 3) & (MD5_BLOCK_LENGTH - 1));
69 need = MD5_BLOCK_LENGTH - have;
70
71 /* Update bitcount */
72 ctx->count += (u_int64_t)len << 3;
73
74 if (len >= need) {
75 if (have != 0) {
76 memcpy(ctx->buffer + have, input, need);
77 MD5Transform(ctx->state, ctx->buffer);
78 input += need;
79 len -= need;
80 have = 0;
81 }
82
83 /* Process data in MD5_BLOCK_LENGTH-byte chunks. */
84 while (len >= MD5_BLOCK_LENGTH) {
85 MD5Transform(ctx->state, input);
86 input += MD5_BLOCK_LENGTH;
87 len -= MD5_BLOCK_LENGTH;
88 }
89 }
90
91 /* Handle any remaining bytes of data. */
92 if (len != 0)
93 memcpy(ctx->buffer + have, input, len);
94 }
95
96 /*
97 * Pad pad to 64-byte boundary with the bit pattern
98 * 1 0* (64-bit count of bits processed, MSB-first)
99 */
100 void
MD5Pad(MD5_CTX * ctx)101 MD5Pad(MD5_CTX *ctx)
102 {
103 u_int8_t count[8];
104
105 /* Convert count to 8 bytes in little endian order. */
106 PUT_64BIT_LE(count, ctx->count);
107
108 /* Pad out to 56 mod 64. */
109 MD5Update(ctx, RFC1321_padding, 64 - (((ctx->count >> 3) + 8) & 63));
110 MD5Update(ctx, count, 8);
111 }
112
113 /*
114 * Final wrapup--call MD5Pad, fill in digest and zero out ctx.
115 */
116 void
MD5Final(unsigned char digest[MD5_DIGEST_LENGTH],MD5_CTX * ctx)117 MD5Final(unsigned char digest[MD5_DIGEST_LENGTH], MD5_CTX *ctx)
118 {
119 int i;
120
121 MD5Pad(ctx);
122 if (digest != NULL) {
123 for (i = 0; i < 4; i++)
124 PUT_32BIT_LE(digest + i * 4, ctx->state[i]);
125 memset(ctx, 0, sizeof(*ctx));
126 }
127 }
128
129
130 /* The four core functions - F1 is optimized somewhat */
131
132 /* #define F1(x, y, z) (x & y | ~x & z) */
133 #define F1(x, y, z) (z ^ (x & (y ^ z)))
134 #define F2(x, y, z) F1(z, x, y)
135 #define F3(x, y, z) (x ^ y ^ z)
136 #define F4(x, y, z) (y ^ (x | ~z))
137
138 /* This is the central step in the MD5 algorithm. */
139 #define MD5STEP(f, w, x, y, z, data, s) \
140 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
141
142 /*
143 * The core of the MD5 algorithm, this alters an existing MD5 hash to
144 * reflect the addition of 16 longwords of new data. MD5Update blocks
145 * the data and converts bytes into longwords for this routine.
146 */
147 void
MD5Transform(u_int32_t state[4],const u_int8_t block[MD5_BLOCK_LENGTH])148 MD5Transform(u_int32_t state[4], const u_int8_t block[MD5_BLOCK_LENGTH])
149 {
150 u_int32_t a, b, c, d, in[MD5_BLOCK_LENGTH / 4];
151
152 #if BYTE_ORDER == LITTLE_ENDIAN
153 memcpy(in, block, sizeof(in));
154 #else
155 for (a = 0; a < MD5_BLOCK_LENGTH / 4; a++) {
156 in[a] = (u_int32_t)(
157 (u_int32_t)(block[a * 4 + 0]) |
158 (u_int32_t)(block[a * 4 + 1]) << 8 |
159 (u_int32_t)(block[a * 4 + 2]) << 16 |
160 (u_int32_t)(block[a * 4 + 3]) << 24);
161 }
162 #endif
163
164 a = state[0];
165 b = state[1];
166 c = state[2];
167 d = state[3];
168
169 MD5STEP(F1, a, b, c, d, in[ 0] + 0xd76aa478, 7);
170 MD5STEP(F1, d, a, b, c, in[ 1] + 0xe8c7b756, 12);
171 MD5STEP(F1, c, d, a, b, in[ 2] + 0x242070db, 17);
172 MD5STEP(F1, b, c, d, a, in[ 3] + 0xc1bdceee, 22);
173 MD5STEP(F1, a, b, c, d, in[ 4] + 0xf57c0faf, 7);
174 MD5STEP(F1, d, a, b, c, in[ 5] + 0x4787c62a, 12);
175 MD5STEP(F1, c, d, a, b, in[ 6] + 0xa8304613, 17);
176 MD5STEP(F1, b, c, d, a, in[ 7] + 0xfd469501, 22);
177 MD5STEP(F1, a, b, c, d, in[ 8] + 0x698098d8, 7);
178 MD5STEP(F1, d, a, b, c, in[ 9] + 0x8b44f7af, 12);
179 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
180 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
181 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
182 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
183 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
184 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
185
186 MD5STEP(F2, a, b, c, d, in[ 1] + 0xf61e2562, 5);
187 MD5STEP(F2, d, a, b, c, in[ 6] + 0xc040b340, 9);
188 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
189 MD5STEP(F2, b, c, d, a, in[ 0] + 0xe9b6c7aa, 20);
190 MD5STEP(F2, a, b, c, d, in[ 5] + 0xd62f105d, 5);
191 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
192 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
193 MD5STEP(F2, b, c, d, a, in[ 4] + 0xe7d3fbc8, 20);
194 MD5STEP(F2, a, b, c, d, in[ 9] + 0x21e1cde6, 5);
195 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
196 MD5STEP(F2, c, d, a, b, in[ 3] + 0xf4d50d87, 14);
197 MD5STEP(F2, b, c, d, a, in[ 8] + 0x455a14ed, 20);
198 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
199 MD5STEP(F2, d, a, b, c, in[ 2] + 0xfcefa3f8, 9);
200 MD5STEP(F2, c, d, a, b, in[ 7] + 0x676f02d9, 14);
201 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
202
203 MD5STEP(F3, a, b, c, d, in[ 5] + 0xfffa3942, 4);
204 MD5STEP(F3, d, a, b, c, in[ 8] + 0x8771f681, 11);
205 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
206 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
207 MD5STEP(F3, a, b, c, d, in[ 1] + 0xa4beea44, 4);
208 MD5STEP(F3, d, a, b, c, in[ 4] + 0x4bdecfa9, 11);
209 MD5STEP(F3, c, d, a, b, in[ 7] + 0xf6bb4b60, 16);
210 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
211 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
212 MD5STEP(F3, d, a, b, c, in[ 0] + 0xeaa127fa, 11);
213 MD5STEP(F3, c, d, a, b, in[ 3] + 0xd4ef3085, 16);
214 MD5STEP(F3, b, c, d, a, in[ 6] + 0x04881d05, 23);
215 MD5STEP(F3, a, b, c, d, in[ 9] + 0xd9d4d039, 4);
216 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
217 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
218 MD5STEP(F3, b, c, d, a, in[2 ] + 0xc4ac5665, 23);
219
220 MD5STEP(F4, a, b, c, d, in[ 0] + 0xf4292244, 6);
221 MD5STEP(F4, d, a, b, c, in[7 ] + 0x432aff97, 10);
222 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
223 MD5STEP(F4, b, c, d, a, in[5 ] + 0xfc93a039, 21);
224 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
225 MD5STEP(F4, d, a, b, c, in[3 ] + 0x8f0ccc92, 10);
226 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
227 MD5STEP(F4, b, c, d, a, in[1 ] + 0x85845dd1, 21);
228 MD5STEP(F4, a, b, c, d, in[8 ] + 0x6fa87e4f, 6);
229 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
230 MD5STEP(F4, c, d, a, b, in[6 ] + 0xa3014314, 15);
231 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
232 MD5STEP(F4, a, b, c, d, in[4 ] + 0xf7537e82, 6);
233 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
234 MD5STEP(F4, c, d, a, b, in[2 ] + 0x2ad7d2bb, 15);
235 MD5STEP(F4, b, c, d, a, in[9 ] + 0xeb86d391, 21);
236
237 state[0] += a;
238 state[1] += b;
239 state[2] += c;
240 state[3] += d;
241 }
242