c6e2a2a1fdd7a9cc788f65dd530e42a86cb082d2
[u/mdw/catacomb] / md5.c
1 /* -*-c-*-
2 *
3 * $Id: md5.c,v 1.1 1999/09/03 08:41:12 mdw Exp $
4 *
5 * The MD5 message digest function
6 *
7 * (c) 1998 Straylight/Edgeware
8 */
9
10 /*----- Licensing notice --------------------------------------------------*
11 *
12 * This file is part of Catacomb.
13 *
14 * Catacomb is free software; you can redistribute it and/or modify
15 * it under the terms of the GNU Library General Public License as
16 * published by the Free Software Foundation; either version 2 of the
17 * License, or (at your option) any later version.
18 *
19 * Catacomb is distributed in the hope that it will be useful,
20 * but WITHOUT ANY WARRANTY; without even the implied warranty of
21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * GNU Library General Public License for more details.
23 *
24 * You should have received a copy of the GNU Library General Public
25 * License along with Catacomb; if not, write to the Free
26 * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
27 * MA 02111-1307, USA.
28 */
29
30 /*----- Revision history --------------------------------------------------*
31 *
32 * $Log: md5.c,v $
33 * Revision 1.1 1999/09/03 08:41:12 mdw
34 * Initial import.
35 *
36 */
37
38 /*----- Header files ------------------------------------------------------*/
39
40 #include <mLib/bits.h>
41
42 #include "hash.h"
43 #include "md5.h"
44
45 /*----- Main code ---------------------------------------------------------*/
46
47 /* --- @md5_compress@ --- *
48 *
49 * Arguments: @md5_ctx *ctx@ = pointer to context block
50 * @const void *sbuf@ = pointer to buffer of appropriate size
51 *
52 * Returns: ---
53 *
54 * Use: MD5 compression function.
55 */
56
57 void md5_compress(md5_ctx *ctx, const void *sbuf)
58 {
59 uint32 a, b, c, d;
60 uint32 buf[16];
61
62 /* --- Fetch the chaining variables --- */
63
64 a = ctx->a;
65 b = ctx->b;
66 c = ctx->c;
67 d = ctx->d;
68
69 /* --- Fetch the buffer contents --- */
70
71 {
72 int i;
73 const octet *p;
74
75 for (i = 0, p = sbuf; i < 16; i++, p += 4)
76 buf[i] = LOAD32_L(p);
77 }
78
79 /* --- Definitions for round functions --- */
80
81 #define F(x, y, z) (((x) & (y)) | (~(x) & (z)))
82 #define G(x, y, z) (((x) & (z)) | ((y) & ~(z)))
83 #define H(x, y, z) ((x) ^ (y) ^ (z))
84 #define I(x, y, z) ((y) ^ ((x) | ~(z)))
85
86 #define T(w, x, y, z, i, r, k, f) do { \
87 uint32 _t = w + f(x, y, z) + buf[i] + k; \
88 w = ROL32(_t, r) + x; \
89 } while (0)
90
91 #define FF(w, x, y, z, i, r, k) T(w, x, y, z, i, r, k, F)
92 #define GG(w, x, y, z, i, r, k) T(w, x, y, z, i, r, k, G)
93 #define HH(w, x, y, z, i, r, k) T(w, x, y, z, i, r, k, H)
94 #define II(w, x, y, z, i, r, k) T(w, x, y, z, i, r, k, I)
95
96 /* --- The main compression function --- */
97
98 FF(a, b, c, d, 0, 7, 0xd76aa478);
99 FF(d, a, b, c, 1, 12, 0xe8c7b756);
100 FF(c, d, a, b, 2, 17, 0x242070db);
101 FF(b, c, d, a, 3, 22, 0xc1bdceee);
102 FF(a, b, c, d, 4, 7, 0xf57c0faf);
103 FF(d, a, b, c, 5, 12, 0x4787c62a);
104 FF(c, d, a, b, 6, 17, 0xa8304613);
105 FF(b, c, d, a, 7, 22, 0xfd469501);
106 FF(a, b, c, d, 8, 7, 0x698098d8);
107 FF(d, a, b, c, 9, 12, 0x8b44f7af);
108 FF(c, d, a, b, 10, 17, 0xffff5bb1);
109 FF(b, c, d, a, 11, 22, 0x895cd7be);
110 FF(a, b, c, d, 12, 7, 0x6b901122);
111 FF(d, a, b, c, 13, 12, 0xfd987193);
112 FF(c, d, a, b, 14, 17, 0xa679438e);
113 FF(b, c, d, a, 15, 22, 0x49b40821);
114
115 GG(a, b, c, d, 1, 5, 0xf61e2562);
116 GG(d, a, b, c, 6, 9, 0xc040b340);
117 GG(c, d, a, b, 11, 14, 0x265e5a51);
118 GG(b, c, d, a, 0, 20, 0xe9b6c7aa);
119 GG(a, b, c, d, 5, 5, 0xd62f105d);
120 GG(d, a, b, c, 10, 9, 0x02441453);
121 GG(c, d, a, b, 15, 14, 0xd8a1e681);
122 GG(b, c, d, a, 4, 20, 0xe7d3fbc8);
123 GG(a, b, c, d, 9, 5, 0x21e1cde6);
124 GG(d, a, b, c, 14, 9, 0xc33707d6);
125 GG(c, d, a, b, 3, 14, 0xf4d50d87);
126 GG(b, c, d, a, 8, 20, 0x455a14ed);
127 GG(a, b, c, d, 13, 5, 0xa9e3e905);
128 GG(d, a, b, c, 2, 9, 0xfcefa3f8);
129 GG(c, d, a, b, 7, 14, 0x676f02d9);
130 GG(b, c, d, a, 12, 20, 0x8d2a4c8a);
131
132 HH(a, b, c, d, 5, 4, 0xfffa3942);
133 HH(d, a, b, c, 8, 11, 0x8771f681);
134 HH(c, d, a, b, 11, 16, 0x6d9d6122);
135 HH(b, c, d, a, 14, 23, 0xfde5380c);
136 HH(a, b, c, d, 1, 4, 0xa4beea44);
137 HH(d, a, b, c, 4, 11, 0x4bdecfa9);
138 HH(c, d, a, b, 7, 16, 0xf6bb4b60);
139 HH(b, c, d, a, 10, 23, 0xbebfbc70);
140 HH(a, b, c, d, 13, 4, 0x289b7ec6);
141 HH(d, a, b, c, 0, 11, 0xeaa127fa);
142 HH(c, d, a, b, 3, 16, 0xd4ef3085);
143 HH(b, c, d, a, 6, 23, 0x04881d05);
144 HH(a, b, c, d, 9, 4, 0xd9d4d039);
145 HH(d, a, b, c, 12, 11, 0xe6db99e5);
146 HH(c, d, a, b, 15, 16, 0x1fa27cf8);
147 HH(b, c, d, a, 2, 23, 0xc4ac5665);
148
149 II(a, b, c, d, 0, 6, 0xf4292244);
150 II(d, a, b, c, 7, 10, 0x432aff97);
151 II(c, d, a, b, 14, 15, 0xab9423a7);
152 II(b, c, d, a, 5, 21, 0xfc93a039);
153 II(a, b, c, d, 12, 6, 0x655b59c3);
154 II(d, a, b, c, 3, 10, 0x8f0ccc92);
155 II(c, d, a, b, 10, 15, 0xffeff47d);
156 II(b, c, d, a, 1, 21, 0x85845dd1);
157 II(a, b, c, d, 8, 6, 0x6fa87e4f);
158 II(d, a, b, c, 15, 10, 0xfe2ce6e0);
159 II(c, d, a, b, 6, 15, 0xa3014314);
160 II(b, c, d, a, 13, 21, 0x4e0811a1);
161 II(a, b, c, d, 4, 6, 0xf7537e82);
162 II(d, a, b, c, 11, 10, 0xbd3af235);
163 II(c, d, a, b, 2, 15, 0x2ad7d2bb);
164 II(b, c, d, a, 9, 21, 0xeb86d391);
165
166 /* --- Update the chaining variables --- */
167
168 ctx->a += a;
169 ctx->b += b;
170 ctx->c += c;
171 ctx->d += d;
172 }
173
174 /* --- @md5_init@ --- *
175 *
176 * Arguments: @md5_ctx *ctx@ = pointer to context block to initialize
177 *
178 * Returns: ---
179 *
180 * Use: Initializes a context block ready for hashing.
181 */
182
183 void md5_init(md5_ctx *ctx)
184 {
185 ctx->a = 0x67452301;
186 ctx->b = 0xefcdab89;
187 ctx->c = 0x98badcfe;
188 ctx->d = 0x10325476;
189 ctx->off = 0;
190 ctx->count = 0;
191 }
192
193 /* --- @md5_set@ --- *
194 *
195 * Arguments: @md5_ctx *ctx@ = pointer to context block
196 * @const void *buf@ = pointer to state buffer
197 * @unsigned long count@ = current count of bytes processed
198 *
199 * Returns: ---
200 *
201 * Use: Initializes a context block from a given state. This is
202 * useful in cases where the initial hash state is meant to be
203 * secret, e.g., for NMAC and HMAC support.
204 */
205
206 void md5_set(md5_ctx *ctx, const void *buf, unsigned long count)
207 {
208 const octet *p = buf;
209 ctx->a = LOAD32_L(p + 0);
210 ctx->b = LOAD32_L(p + 4);
211 ctx->c = LOAD32_L(p + 8);
212 ctx->d = LOAD32_L(p + 12);
213 ctx->off = 0;
214 ctx->count = count;
215 }
216
217 /* --- @md5_hash@ --- *
218 *
219 * Arguments: @md5_ctx *ctx@ = pointer to context block
220 * @const void *buf@ = buffer of data to hash
221 * @size_t sz@ = size of buffer to hash
222 *
223 * Returns: ---
224 *
225 * Use: Hashes a buffer of data. The buffer may be of any size and
226 * alignment.
227 */
228
229 void md5_hash(md5_ctx *ctx, const void *buf, size_t sz)
230 {
231 HASH_BUFFER(MD5, md5, ctx, buf, sz);
232 }
233
234 /* --- @md5_done@ --- *
235 *
236 * Arguments: @md5_ctx *ctx@ = pointer to context block
237 * @void *hash@ = pointer to output buffer
238 *
239 * Returns: ---
240 *
241 * Use: Returns the hash of the data read so far.
242 */
243
244 void md5_done(md5_ctx *ctx, void *hash)
245 {
246 octet *p = hash;
247 HASH_MD5STRENGTH(MD5, md5, ctx);
248 STORE32_L(p + 0, ctx->a);
249 STORE32_L(p + 4, ctx->b);
250 STORE32_L(p + 8, ctx->c);
251 STORE32_L(p + 12, ctx->d);
252 }
253
254 /* --- @md5_state@ --- *
255 *
256 * Arguments: @md5_ctx *ctx@ = pointer to context
257 * @void *state@ = pointer to buffer for current state
258 *
259 * Returns: Number of bytes written to the hash function so far.
260 *
261 * Use: Returns the current state of the hash function such that
262 * it can be passed to @md5_set@.
263 */
264
265 unsigned long md5_state(md5_ctx *ctx, void *state)
266 {
267 octet *p = state;
268 STORE32_L(p + 0, ctx->a);
269 STORE32_L(p + 4, ctx->b);
270 STORE32_L(p + 8, ctx->c);
271 STORE32_L(p + 12, ctx->d);
272 return (ctx->count);
273 }
274
275 /* --- Test code --- */
276
277 HASH_TEST(MD5, md5)
278
279 /*----- That's all, folks -------------------------------------------------*/