« back to all changes in this revision
Viewing changes to crammd5/md5.c
- browse files at revision 1
- compare with another revision
- download diff
- download tarball
- view history from revision 1
- Committer: Bazaar Package Importer
- Author(s): Jeremy T. Bouse
- Date: 2002-03-06 08:37:48 UTC
- Revision ID: james.westby@ubuntu.com-20020306083748-ihmt32mddsslvg5i
Tags: upstream-0.8.11
Import upstream version 0.8.11
- files added:
- crammd5
- doc
- examples
- login
- ntlm
- plain
added
removed
crammd5/md5.c
1
/* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
2
/*
3
* This code implements the MD5 message-digest algorithm.
4
* The algorithm is due to Ron Rivest. This code was
5
* written by Colin Plumb in 1993, no copyright is claimed.
6
* This code is in the public domain; do with it what you wish.
7
*
8
* Equivalent code is available from RSA Data Security, Inc.
9
* This code has been tested against that, and is equivalent,
10
* except that you don't need to include two pages of legalese
11
* with every copy.
12
*
13
* To compute the message digest of a chunk of bytes, declare an
14
* MD5Context structure, pass it to md5_init, call md5_update as
15
* needed on buffers full of bytes, and then call md5_Final, which
16
* will fill a supplied 16-byte array with the digest.
17
*/
18
19
/* parts of this file are:
20
* Written March 1993 by Branko Lankester
21
* Modified June 1993 by Colin Plumb for altered md5.c.
22
* Modified October 1995 by Erik Troan for RPM
23
*/
24
25
/* Modified 2001 by Brian Stafford to use ISO C typedefs for various
26
* quantities. Also eliminated convenience functions not needed for
27
* libESMTP.
28
*/
29
#if HAVE_CONFIG_H
30
#include <config.h>
31
#endif
32
33
#include <stdio.h>
34
#include <string.h>
35
#include <sys/types.h>
36
#include "md5.h"
37
38
static void md5_transform (unsigned32_t buf[4], const unsigned32_t in[16]);
39
40
static unsigned32_t _ie = 0x44332211;
41
static union _endian { unsigned32_t i; unsigned char b[4]; } *_endian = (union _endian *)&_ie;
42
#define IS_BIG_ENDIAN() (_endian->b[0] == '\x44')
43
#define IS_LITTLE_ENDIAN() (_endian->b[0] == '\x11')
44
45
46
/*
47
* Note: this code is harmless on little-endian machines.
48
*/
49
static void
50
_byte_reverse (unsigned char *buf, unsigned32_t longs)
51
{
52
unsigned32_t t;
53
do {
54
t = (unsigned32_t) ((unsigned32_t) buf[3] << 8 | buf[2]) << 16 |
55
((unsigned32_t) buf[1] << 8 | buf[0]);
56
*(unsigned32_t *) buf = t;
57
buf += 4;
58
} while (--longs);
59
}
60
61
62
/**
63
* md5_init: Initialise an md5 context object
64
* @ctx: md5 context
65
*
66
* Initialise an md5 buffer.
67
*
68
**/
69
void
70
md5_init (MD5Context *ctx)
71
{
72
ctx->buf[0] = 0x67452301;
73
ctx->buf[1] = 0xefcdab89;
74
ctx->buf[2] = 0x98badcfe;
75
ctx->buf[3] = 0x10325476;
76
77
ctx->bits[0] = 0;
78
ctx->bits[1] = 0;
79
80
if (IS_BIG_ENDIAN())
81
ctx->doByteReverse = 1;
82
else
83
ctx->doByteReverse = 0;
84
}
85
86
87
/**
88
* md5_update: add a buffer to md5 hash computation
89
* @ctx: conetxt object used for md5 computaion
90
* @buf: buffer to add
91
* @len: buffer length
92
*
93
* Update context to reflect the concatenation of another buffer full
94
* of bytes. Use this to progressively construct an md5 hash.
95
**/
96
void
97
md5_update (MD5Context *ctx, const void *buf, size_t len)
98
{
99
unsigned32_t t;
100
const unsigned char *ucbuf = buf;
101
102
/* Update bitcount */
103
t = ctx->bits[0];
104
if ((ctx->bits[0] = t + ((unsigned32_t) len << 3)) < t)
105
ctx->bits[1]++; /* Carry from low to high */
106
ctx->bits[1] += len >> 29;
107
108
t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
109
110
/* Handle any leading odd-sized chunks */
111
if (t) {
112
unsigned char *p = (unsigned char *) ctx->in + t;
113
114
t = 64 - t;
115
if (len < t) {
116
memcpy (p, ucbuf, len);
117
return;
118
}
119
memcpy (p, ucbuf, t);
120
if (ctx->doByteReverse)
121
_byte_reverse (ctx->in, 16);
122
md5_transform (ctx->buf, (unsigned32_t *) ctx->in);
123
ucbuf += t;
124
len -= t;
125
}
126
127
/* Process data in 64-byte chunks */
128
while (len >= 64) {
129
memcpy (ctx->in, ucbuf, 64);
130
if (ctx->doByteReverse)
131
_byte_reverse (ctx->in, 16);
132
md5_transform (ctx->buf, (unsigned32_t *) ctx->in);
133
ucbuf += 64;
134
len -= 64;
135
}
136
137
/* Handle any remaining bytes of data. */
138
memcpy (ctx->in, ucbuf, len);
139
}
140
141
142
/*
143
* Final wrapup - pad to 64-byte boundary with the bit pattern
144
* 1 0* (64-bit count of bits processed, MSB-first)
145
*/
146
/**
147
* md5_final: copy the final md5 hash to a bufer
148
* @digest: 16 bytes buffer
149
* @ctx: context containing the calculated md5
150
*
151
* copy the final md5 hash to a bufer
152
**/
153
void
154
md5_final (MD5Context *ctx, unsigned char digest[16])
155
{
156
unsigned32_t count;
157
unsigned char *p;
158
159
/* Compute number of bytes mod 64 */
160
count = (ctx->bits[0] >> 3) & 0x3F;
161
162
/* Set the first char of padding to 0x80. This is safe since there is
163
always at least one byte free */
164
p = ctx->in + count;
165
*p++ = 0x80;
166
167
/* Bytes of padding needed to make 64 bytes */
168
count = 64 - 1 - count;
169
170
/* Pad out to 56 mod 64 */
171
if (count < 8) {
172
/* Two lots of padding: Pad the first block to 64 bytes */
173
memset (p, 0, count);
174
if (ctx->doByteReverse)
175
_byte_reverse (ctx->in, 16);
176
md5_transform (ctx->buf, (unsigned32_t *) ctx->in);
177
178
/* Now fill the next block with 56 bytes */
179
memset (ctx->in, 0, 56);
180
} else {
181
/* Pad block to 56 bytes */
182
memset (p, 0, count - 8);
183
}
184
if (ctx->doByteReverse)
185
_byte_reverse (ctx->in, 14);
186
187
/* Append length in bits and transform */
188
((unsigned32_t *) ctx->in)[14] = ctx->bits[0];
189
((unsigned32_t *) ctx->in)[15] = ctx->bits[1];
190
191
md5_transform (ctx->buf, (unsigned32_t *) ctx->in);
192
if (ctx->doByteReverse)
193
_byte_reverse ((unsigned char *) ctx->buf, 4);
194
memcpy (digest, ctx->buf, 16);
195
}
196
197
198
/* The four core functions - F1 is optimized somewhat */
199
200
/* #define F1(x, y, z) (x & y | ~x & z) */
201
#define F1(x, y, z) (z ^ (x & (y ^ z)))
202
#define F2(x, y, z) F1(z, x, y)
203
#define F3(x, y, z) (x ^ y ^ z)
204
#define F4(x, y, z) (y ^ (x | ~z))
205
206
/* This is the central step in the MD5 algorithm. */
207
#define MD5STEP(f, w, x, y, z, data, s) \
208
( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
209
210
/*
211
* The core of the MD5 algorithm, this alters an existing MD5 hash to
212
* reflect the addition of 16 longwords of new data. md5_Update blocks
213
* the data and converts bytes into longwords for this routine.
214
*/
215
static void
216
md5_transform (unsigned32_t buf[4], const unsigned32_t in[16])
217
{
218
register unsigned32_t a, b, c, d;
219
220
a = buf[0];
221
b = buf[1];
222
c = buf[2];
223
d = buf[3];
224
225
MD5STEP (F1, a, b, c, d, in[0] + 0xd76aa478, 7);
226
MD5STEP (F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
227
MD5STEP (F1, c, d, a, b, in[2] + 0x242070db, 17);
228
MD5STEP (F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
229
MD5STEP (F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
230
MD5STEP (F1, d, a, b, c, in[5] + 0x4787c62a, 12);
231
MD5STEP (F1, c, d, a, b, in[6] + 0xa8304613, 17);
232
MD5STEP (F1, b, c, d, a, in[7] + 0xfd469501, 22);
233
MD5STEP (F1, a, b, c, d, in[8] + 0x698098d8, 7);
234
MD5STEP (F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
235
MD5STEP (F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
236
MD5STEP (F1, b, c, d, a, in[11] + 0x895cd7be, 22);
237
MD5STEP (F1, a, b, c, d, in[12] + 0x6b901122, 7);
238
MD5STEP (F1, d, a, b, c, in[13] + 0xfd987193, 12);
239
MD5STEP (F1, c, d, a, b, in[14] + 0xa679438e, 17);
240
MD5STEP (F1, b, c, d, a, in[15] + 0x49b40821, 22);
241
242
MD5STEP (F2, a, b, c, d, in[1] + 0xf61e2562, 5);
243
MD5STEP (F2, d, a, b, c, in[6] + 0xc040b340, 9);
244
MD5STEP (F2, c, d, a, b, in[11] + 0x265e5a51, 14);
245
MD5STEP (F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
246
MD5STEP (F2, a, b, c, d, in[5] + 0xd62f105d, 5);
247
MD5STEP (F2, d, a, b, c, in[10] + 0x02441453, 9);
248
MD5STEP (F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
249
MD5STEP (F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
250
MD5STEP (F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
251
MD5STEP (F2, d, a, b, c, in[14] + 0xc33707d6, 9);
252
MD5STEP (F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
253
MD5STEP (F2, b, c, d, a, in[8] + 0x455a14ed, 20);
254
MD5STEP (F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
255
MD5STEP (F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
256
MD5STEP (F2, c, d, a, b, in[7] + 0x676f02d9, 14);
257
MD5STEP (F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
258
259
MD5STEP (F3, a, b, c, d, in[5] + 0xfffa3942, 4);
260
MD5STEP (F3, d, a, b, c, in[8] + 0x8771f681, 11);
261
MD5STEP (F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
262
MD5STEP (F3, b, c, d, a, in[14] + 0xfde5380c, 23);
263
MD5STEP (F3, a, b, c, d, in[1] + 0xa4beea44, 4);
264
MD5STEP (F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
265
MD5STEP (F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
266
MD5STEP (F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
267
MD5STEP (F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
268
MD5STEP (F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
269
MD5STEP (F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
270
MD5STEP (F3, b, c, d, a, in[6] + 0x04881d05, 23);
271
MD5STEP (F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
272
MD5STEP (F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
273
MD5STEP (F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
274
MD5STEP (F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
275
276
MD5STEP (F4, a, b, c, d, in[0] + 0xf4292244, 6);
277
MD5STEP (F4, d, a, b, c, in[7] + 0x432aff97, 10);
278
MD5STEP (F4, c, d, a, b, in[14] + 0xab9423a7, 15);
279
MD5STEP (F4, b, c, d, a, in[5] + 0xfc93a039, 21);
280
MD5STEP (F4, a, b, c, d, in[12] + 0x655b59c3, 6);
281
MD5STEP (F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
282
MD5STEP (F4, c, d, a, b, in[10] + 0xffeff47d, 15);
283
MD5STEP (F4, b, c, d, a, in[1] + 0x85845dd1, 21);
284
MD5STEP (F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
285
MD5STEP (F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
286
MD5STEP (F4, c, d, a, b, in[6] + 0xa3014314, 15);
287
MD5STEP (F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
288
MD5STEP (F4, a, b, c, d, in[4] + 0xf7537e82, 6);
289
MD5STEP (F4, d, a, b, c, in[11] + 0xbd3af235, 10);
290
MD5STEP (F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
291
MD5STEP (F4, b, c, d, a, in[9] + 0xeb86d391, 21);
292
293
buf[0] += a;
294
buf[1] += b;
295
buf[2] += c;
296
buf[3] += d;
297
}
Loggerhead is a web-based interface for Breezy
Version: 2.0.1