1
/* $OpenBSD: md5.c,v 1.7 2004/05/28 15:10:27 millert Exp $ */
2
* MD5C.C - RSA Data Security, Inc., MD5 message-digest algorithm
4
* Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
7
* License to copy and use this software is granted provided that it
8
* is identified as the "RSA Data Security, Inc. MD5 Message-Digest
9
* Algorithm" in all material mentioning or referencing this software
12
* License is also granted to make and use derivative works provided
13
* that such works are identified as "derived from the RSA Data
14
* Security, Inc. MD5 Message-Digest Algorithm" in all material
15
* mentioning or referencing the derived work.
17
* RSA Data Security, Inc. makes no representations concerning either
18
* the merchantability of this software or the suitability of this
19
* software for any particular purpose. It is provided "as is"
20
* without express or implied warranty of any kind.
22
* These notices must be retained in any copies of any part of this
23
* documentation and/or software.
25
* $FreeBSD: src/lib/libmd/md5c.c,v 1.11 1999/12/29 05:04:20 peter Exp $
27
* This code is the same as the code published by RSA Inc. It has been
28
* edited for clarity and style only.
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.
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
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.
20
#include "autoconfig.h"
23
#include <sys/types.h>
32
24
#include <string.h>
36
typedef unsigned int md5uint32;
38
static void MD5Transform(md5uint32 [4], const unsigned char [64]);
46
* Encodes input (md5uint32) into output (unsigned char). Assumes len is
51
Encode (unsigned char *output, md5uint32 *input, unsigned int len)
55
for (i = 0, j = 0; j < len; i++, j += 4) {
56
output[j] = (unsigned char)(input[i] & 0xff);
57
output[j+1] = (unsigned char)((input[i] >> 8) & 0xff);
58
output[j+2] = (unsigned char)((input[i] >> 16) & 0xff);
59
output[j+3] = (unsigned char)((input[i] >> 24) & 0xff);
64
* Decodes input (unsigned char) into output (md5uint32). Assumes len is
69
Decode (md5uint32 *output, const unsigned char *input, unsigned int len)
73
for (i = 0, j = 0; j < len; i++, j += 4)
74
output[i] = ((md5uint32)input[j]) | (((md5uint32)input[j+1]) << 8) |
75
(((md5uint32)input[j+2]) << 16) | (((md5uint32)input[j+3]) << 24);
79
static unsigned char PADDING[64] = {
80
0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
81
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
82
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
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)
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)
44
static u_int8_t PADDING[MD5_BLOCK_LENGTH] = {
45
0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
46
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
47
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
85
/* F, G, H and I are basic MD5 functions. */
86
#define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
87
#define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
88
#define H(x, y, z) ((x) ^ (y) ^ (z))
89
#define I(x, y, z) ((y) ^ ((x) | (~z)))
91
/* ROTATE_LEFT rotates x left n bits. */
92
#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
95
* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
96
* Rotation is separate from addition to prevent recomputation.
98
#define FF(a, b, c, d, x, s, ac) { \
99
(a) += F ((b), (c), (d)) + (x) + (md5uint32)(ac); \
100
(a) = ROTATE_LEFT ((a), (s)); \
103
#define GG(a, b, c, d, x, s, ac) { \
104
(a) += G ((b), (c), (d)) + (x) + (md5uint32)(ac); \
105
(a) = ROTATE_LEFT ((a), (s)); \
108
#define HH(a, b, c, d, x, s, ac) { \
109
(a) += H ((b), (c), (d)) + (x) + (md5uint32)(ac); \
110
(a) = ROTATE_LEFT ((a), (s)); \
113
#define II(a, b, c, d, x, s, ac) { \
114
(a) += I ((b), (c), (d)) + (x) + (md5uint32)(ac); \
115
(a) = ROTATE_LEFT ((a), (s)); \
119
/* MD5 initialization. Begins an MD5 operation, writing a new context. */
122
MD5Init (MD5_CTX *context)
125
context->count[0] = context->count[1] = 0;
127
/* Load magic initialization constants. */
128
context->state[0] = 0x67452301;
129
context->state[1] = 0xefcdab89;
130
context->state[2] = 0x98badcfe;
131
context->state[3] = 0x10325476;
135
* MD5 block update operation. Continues an MD5 message-digest
136
* operation, processing another message block, and updating the
141
MD5Update (MD5_CTX *context, const unsigned char *input, unsigned int inputLen)
143
unsigned int i, index, partLen;
145
/* Compute number of bytes mod 64 */
146
index = (unsigned int)((context->count[0] >> 3) & 0x3F);
148
/* Update number of bits */
149
if ((context->count[0] += ((md5uint32)inputLen << 3))
150
< ((md5uint32)inputLen << 3))
152
context->count[1] += ((md5uint32)inputLen >> 29);
154
partLen = 64 - index;
156
/* Transform as many times as possible. */
157
if (inputLen >= partLen) {
158
memcpy((void *)&context->buffer[index], (const void *)input,
160
MD5Transform (context->state, context->buffer);
162
for (i = partLen; i + 63 < inputLen; i += 64)
163
MD5Transform (context->state, &input[i]);
170
/* Buffer remaining input */
171
memcpy ((void *)&context->buffer[index], (const void *)&input[i],
176
* MD5 padding. Adds padding followed by original length.
180
MD5Pad (MD5_CTX *context)
182
unsigned char bits[8];
183
unsigned int index, padLen;
185
/* Save number of bits */
186
Encode (bits, context->count, 8);
51
* Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
52
* initialization constants.
58
ctx->state[0] = 0x67452301;
59
ctx->state[1] = 0xefcdab89;
60
ctx->state[2] = 0x98badcfe;
61
ctx->state[3] = 0x10325476;
65
* Update context to reflect the concatenation of another buffer full
69
MD5Update(MD5_CTX *ctx, const unsigned char *input, size_t len)
73
/* Check how many bytes we already have and how many more we need. */
74
have = (size_t)((ctx->count >> 3) & (MD5_BLOCK_LENGTH - 1));
75
need = MD5_BLOCK_LENGTH - have;
78
ctx->count += (u_int64_t)len << 3;
82
memcpy(ctx->buffer + have, input, need);
83
MD5Transform(ctx->state, ctx->buffer);
89
/* Process data in MD5_BLOCK_LENGTH-byte chunks. */
90
while (len >= MD5_BLOCK_LENGTH) {
91
MD5Transform(ctx->state, input);
92
input += MD5_BLOCK_LENGTH;
93
len -= MD5_BLOCK_LENGTH;
97
/* Handle any remaining bytes of data. */
99
memcpy(ctx->buffer + have, input, len);
103
* Pad pad to 64-byte boundary with the bit pattern
104
* 1 0* (64-bit count of bits processed, MSB-first)
112
/* Convert count to 8 bytes in little endian order. */
113
PUT_64BIT_LE(count, ctx->count);
188
115
/* Pad out to 56 mod 64. */
189
index = (unsigned int)((context->count[0] >> 3) & 0x3f);
190
padLen = (index < 56) ? (56 - index) : (120 - index);
191
MD5Update (context, PADDING, padLen);
193
/* Append length (before padding) */
194
MD5Update (context, bits, 8);
198
* MD5 finalization. Ends an MD5 message-digest operation, writing the
199
* the message digest and zeroizing the context.
203
MD5Final (unsigned char digest[16],MD5_CTX *context)
208
/* Store state in digest */
209
Encode (digest, context->state, 16);
211
/* Zeroize sensitive information. */
212
memset ((void *)context, 0, sizeof (*context));
215
/* MD5 basic transformation. Transforms state based on block. */
218
MD5Transform (md5uint32 state[4], const unsigned char block[64])
220
md5uint32 a = state[0], b = state[1], c = state[2], d = state[3], x[16];
222
Decode (x, block, 64);
229
FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
230
FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
231
FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
232
FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
233
FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
234
FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
235
FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
236
FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
237
FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
238
FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
239
FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
240
FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
241
FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
242
FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
243
FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
244
FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
251
GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
252
GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
253
GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
254
GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
255
GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
256
GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */
257
GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
258
GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
259
GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
260
GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
261
GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
262
GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
263
GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
264
GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
265
GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
266
GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
273
HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
274
HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
275
HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
276
HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
277
HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
278
HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
279
HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
280
HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
281
HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
282
HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
283
HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
284
HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */
285
HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
286
HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
287
HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
288
HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
295
II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
296
II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
297
II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
298
II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
299
II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
300
II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
301
II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
302
II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
303
II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
304
II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
305
II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
306
II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
307
II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
308
II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
309
II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
310
II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
116
padlen = MD5_BLOCK_LENGTH -
117
((ctx->count >> 3) & (MD5_BLOCK_LENGTH - 1));
119
padlen += MD5_BLOCK_LENGTH;
120
MD5Update(ctx, PADDING, padlen - 8); /* padlen - 8 <= 64 */
121
MD5Update(ctx, count, 8);
125
* Final wrapup--call MD5Pad, fill in digest and zero out ctx.
128
MD5Final(unsigned char digest[MD5_DIGEST_LENGTH], MD5_CTX *ctx)
133
if (digest != NULL) {
134
for (i = 0; i < 4; i++)
135
PUT_32BIT_LE(digest + i * 4, ctx->state[i]);
136
memset(ctx, 0, sizeof(*ctx));
141
/* The four core functions - F1 is optimized somewhat */
143
/* #define F1(x, y, z) (x & y | ~x & z) */
144
#define F1(x, y, z) (z ^ (x & (y ^ z)))
145
#define F2(x, y, z) F1(z, x, y)
146
#define F3(x, y, z) (x ^ y ^ z)
147
#define F4(x, y, z) (y ^ (x | ~z))
149
/* This is the central step in the MD5 algorithm. */
150
#define MD5STEP(f, w, x, y, z, data, s) \
151
( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
154
* The core of the MD5 algorithm, this alters an existing MD5 hash to
155
* reflect the addition of 16 longwords of new data. MD5Update blocks
156
* the data and converts bytes into longwords for this routine.
159
MD5Transform(u_int32_t state[4], const u_int8_t block[MD5_BLOCK_LENGTH])
161
u_int32_t a, b, c, d, in[MD5_BLOCK_LENGTH / 4];
163
#ifndef WORDS_BIGENDIAN
164
memcpy(in, block, sizeof(in));
166
for (a = 0; a < MD5_BLOCK_LENGTH / 4; a++) {
168
(u_int32_t)(block[a * 4 + 0]) |
169
(u_int32_t)(block[a * 4 + 1]) << 8 |
170
(u_int32_t)(block[a * 4 + 2]) << 16 |
171
(u_int32_t)(block[a * 4 + 3]) << 24);
180
MD5STEP(F1, a, b, c, d, in[ 0] + 0xd76aa478, 7);
181
MD5STEP(F1, d, a, b, c, in[ 1] + 0xe8c7b756, 12);
182
MD5STEP(F1, c, d, a, b, in[ 2] + 0x242070db, 17);
183
MD5STEP(F1, b, c, d, a, in[ 3] + 0xc1bdceee, 22);
184
MD5STEP(F1, a, b, c, d, in[ 4] + 0xf57c0faf, 7);
185
MD5STEP(F1, d, a, b, c, in[ 5] + 0x4787c62a, 12);
186
MD5STEP(F1, c, d, a, b, in[ 6] + 0xa8304613, 17);
187
MD5STEP(F1, b, c, d, a, in[ 7] + 0xfd469501, 22);
188
MD5STEP(F1, a, b, c, d, in[ 8] + 0x698098d8, 7);
189
MD5STEP(F1, d, a, b, c, in[ 9] + 0x8b44f7af, 12);
190
MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
191
MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
192
MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
193
MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
194
MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
195
MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
197
MD5STEP(F2, a, b, c, d, in[ 1] + 0xf61e2562, 5);
198
MD5STEP(F2, d, a, b, c, in[ 6] + 0xc040b340, 9);
199
MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
200
MD5STEP(F2, b, c, d, a, in[ 0] + 0xe9b6c7aa, 20);
201
MD5STEP(F2, a, b, c, d, in[ 5] + 0xd62f105d, 5);
202
MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
203
MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
204
MD5STEP(F2, b, c, d, a, in[ 4] + 0xe7d3fbc8, 20);
205
MD5STEP(F2, a, b, c, d, in[ 9] + 0x21e1cde6, 5);
206
MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
207
MD5STEP(F2, c, d, a, b, in[ 3] + 0xf4d50d87, 14);
208
MD5STEP(F2, b, c, d, a, in[ 8] + 0x455a14ed, 20);
209
MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
210
MD5STEP(F2, d, a, b, c, in[ 2] + 0xfcefa3f8, 9);
211
MD5STEP(F2, c, d, a, b, in[ 7] + 0x676f02d9, 14);
212
MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
214
MD5STEP(F3, a, b, c, d, in[ 5] + 0xfffa3942, 4);
215
MD5STEP(F3, d, a, b, c, in[ 8] + 0x8771f681, 11);
216
MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
217
MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
218
MD5STEP(F3, a, b, c, d, in[ 1] + 0xa4beea44, 4);
219
MD5STEP(F3, d, a, b, c, in[ 4] + 0x4bdecfa9, 11);
220
MD5STEP(F3, c, d, a, b, in[ 7] + 0xf6bb4b60, 16);
221
MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
222
MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
223
MD5STEP(F3, d, a, b, c, in[ 0] + 0xeaa127fa, 11);
224
MD5STEP(F3, c, d, a, b, in[ 3] + 0xd4ef3085, 16);
225
MD5STEP(F3, b, c, d, a, in[ 6] + 0x04881d05, 23);
226
MD5STEP(F3, a, b, c, d, in[ 9] + 0xd9d4d039, 4);
227
MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
228
MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
229
MD5STEP(F3, b, c, d, a, in[2 ] + 0xc4ac5665, 23);
231
MD5STEP(F4, a, b, c, d, in[ 0] + 0xf4292244, 6);
232
MD5STEP(F4, d, a, b, c, in[7 ] + 0x432aff97, 10);
233
MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
234
MD5STEP(F4, b, c, d, a, in[5 ] + 0xfc93a039, 21);
235
MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
236
MD5STEP(F4, d, a, b, c, in[3 ] + 0x8f0ccc92, 10);
237
MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
238
MD5STEP(F4, b, c, d, a, in[1 ] + 0x85845dd1, 21);
239
MD5STEP(F4, a, b, c, d, in[8 ] + 0x6fa87e4f, 6);
240
MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
241
MD5STEP(F4, c, d, a, b, in[6 ] + 0xa3014314, 15);
242
MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
243
MD5STEP(F4, a, b, c, d, in[4 ] + 0xf7537e82, 6);
244
MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
245
MD5STEP(F4, c, d, a, b, in[2 ] + 0x2ad7d2bb, 15);
246
MD5STEP(F4, b, c, d, a, in[9 ] + 0xeb86d391, 21);
317
/* Zeroize sensitive information. */
318
memset ((void *)x, 0, sizeof (x));
321
/*************** Convenience / utilities */
322
void MD5Final(string &digest, MD5_CTX *context)
325
MD5Final (d, context);
326
digest.assign((const char *)d, 16);
329
string& MD5String(const string& data, string& digest)
333
MD5Update(&ctx, (const unsigned char*)data.c_str(), data.length());
334
MD5Final(digest, &ctx);
338
string& MD5HexPrint(const string& digest, string &out)
342
static const char hex[]="0123456789abcdef";
343
const unsigned char *hash = (const unsigned char *)digest.c_str();
344
for (int i = 0; i < 16; i++) {
345
out.append(1, hex[hash[i] >> 4]);
346
out.append(1, hex[hash[i] & 0x0f]);
350
string& MD5HexScan(const string& xdigest, string& digest)
353
if (xdigest.length() != 32) {
356
for (unsigned int i = 0; i < 16; i++) {
358
if (sscanf(xdigest.c_str() + 2*i, "%2x", &val) != 1) {
362
digest.append(1, (unsigned char)val);
367
#include "readfile.h"
368
class FileScanMd5 : public FileScanDo {
370
FileScanMd5(string& d) : digest(d) {}
371
virtual bool init(size_t size, string *)
376
virtual bool data(const char *buf, int cnt, string*)
378
MD5Update(&ctx, (const unsigned char*)buf, cnt);
384
bool MD5File(const string& filename, string &digest, string *reason)
386
FileScanMd5 md5er(digest);
387
if (!file_scan(filename, &md5er, reason))
389
// We happen to know that digest and md5er.digest are the same object
390
MD5Final(md5er.digest, &md5er.ctx);
405
static const char *thisprog;
406
static char usage [] =
412
fprintf(stderr, "%s: usage:\n%s", thisprog, usage);
416
int main(int argc, const char **argv)
423
string filename = *argv++;argc--;
425
string reason, digest;
426
if (!MD5File(filename, digest, &reason)) {
427
cerr << reason << endl;
431
cout << "MD5 (" << filename << ") = " << MD5HexPrint(digest, hex) << endl;
434
MD5HexScan(hex, digest1);
435
if (digest1.compare(digest)) {
436
cout << "MD5HexScan Failure" << endl;
437
cout << MD5HexPrint(digest, hex) << " " << digest.length() << " -> "
438
<< MD5HexPrint(digest1, hex) << " " << digest1.length() << endl;
added
removed
utils/md5.cpp
