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