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