VirtualBox

source: vbox/trunk/src/VBox/Runtime/md5.cpp@ 4672

Last change on this file since 4672 was 4071, checked in by vboxsync, 17 years ago

Biggest check-in ever. New source code headers for all (C) innotek files.

  • Property svn:eol-style set to native
  • Property svn:keywords set to Id
File size: 8.7 KB
Line 
1/* $Id: md5.cpp 4071 2007-08-07 17:07:59Z vboxsync $ */
2/** @file
3 * MD5 message digest functions
4 */
5
6/*
7 * Copyright (C) 2006-2007 innotek GmbH
8 *
9 * This file is part of VirtualBox Open Source Edition (OSE), as
10 * available from http://www.virtualbox.org. This file is free software;
11 * you can redistribute it and/or modify it under the terms of the GNU
12 * General Public License as published by the Free Software Foundation,
13 * in version 2 as it comes in the "COPYING" file of the VirtualBox OSE
14 * distribution. VirtualBox OSE is distributed in the hope that it will
15 * be useful, but WITHOUT ANY WARRANTY of any kind.
16 */
17
18/* The code is virtually unchanged from the original version (see copyright
19 * notice below). Most changes are related to the function names and data
20 * types - in order to fit the code in the IPRT naming style. */
21
22/*
23 * This code implements the MD5 message-digest algorithm.
24 * The algorithm is due to Ron Rivest. This code was
25 * written by Colin Plumb in 1993, no copyright is claimed.
26 * This code is in the public domain; do with it what you wish.
27 *
28 * Equivalent code is available from RSA Data Security, Inc.
29 * This code has been tested against that, and is equivalent,
30 * except that you don't need to include two pages of legalese
31 * with every copy.
32 *
33 * To compute the message digest of a chunk of bytes, declare an
34 * RTMD5CONTEXT structure, pass it to MD5Init, call MD5Update as
35 * needed on buffers full of bytes, and then call MD5Final, which
36 * will fill a supplied 16-byte array with the digest.
37 */
38
39#include <iprt/string.h> /* for memcpy() */
40#include <iprt/md5.h>
41
42#ifdef sgi
43#define HIGHFIRST
44#endif
45
46#ifdef sun
47#define HIGHFIRST
48#endif
49
50#ifndef HIGHFIRST
51#define byteReverse(buf, len) /* Nothing */
52#else
53/*
54 * Note: this code is harmless on little-endian machines.
55 */
56static void byteReverse(uint32_t *buf, unsigned int longs)
57{
58 uint32_t t;
59 do {
60 t = (uint32_t) *((uint8_t *)buf + 3) << 24 |
61 (uint32_t) *((uint8_t *)buf + 2) << 16 |
62 (uint32_t) *((uint8_t *)buf + 1) << 8 | *(uint8_t *)buf;
63 *buf = t;
64 buf++;
65 } while (--longs);
66}
67#endif
68
69static void MD5Transform(uint32_t buf[4], uint32_t in[16]);
70
71
72/*
73 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
74 * initialization constants.
75 */
76RTDECL(void) RTMd5Init(PRTMD5CONTEXT ctx)
77{
78 ctx->buf[0] = 0x67452301;
79 ctx->buf[1] = 0xefcdab89;
80 ctx->buf[2] = 0x98badcfe;
81 ctx->buf[3] = 0x10325476;
82
83 ctx->bits[0] = 0;
84 ctx->bits[1] = 0;
85}
86
87/*
88 * Update context to reflect the concatenation of another buffer full
89 * of bytes.
90 */
91RTDECL(void) RTMd5Update(PRTMD5CONTEXT ctx, const void *pvBuf, size_t len)
92{
93 const uint8_t *buf = (const uint8_t *)pvBuf;
94 uint32_t t;
95
96 /* Update bitcount */
97
98 t = ctx->bits[0];
99 if ((ctx->bits[0] = t + ((uint32_t) len << 3)) < t)
100 ctx->bits[1]++; /* Carry from low to high */
101 ctx->bits[1] += len >> 29;
102
103 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
104
105 /* Handle any leading odd-sized chunks */
106
107 if (t) {
108 uint8_t *p = (uint8_t *) ctx->in + t;
109
110 t = 64 - t;
111 if (len < t) {
112 memcpy(p, buf, len);
113 return;
114 }
115 memcpy(p, buf, t);
116 byteReverse(ctx->in, 16);
117 MD5Transform(ctx->buf, ctx->in);
118 buf += t;
119 len -= t;
120 }
121 /* Process data in 64-byte chunks */
122
123 while (len >= 64) {
124 memcpy(ctx->in, buf, 64);
125 byteReverse(ctx->in, 16);
126 MD5Transform(ctx->buf, ctx->in);
127 buf += 64;
128 len -= 64;
129 }
130
131 /* Handle any remaining bytes of data. */
132
133 memcpy(ctx->in, buf, len);
134}
135
136/*
137 * Final wrapup - pad to 64-byte boundary with the bit pattern
138 * 1 0* (64-bit count of bits processed, MSB-first)
139 */
140RTDECL(void) RTMd5Final(uint8_t digest[16], PRTMD5CONTEXT ctx)
141{
142 unsigned int count;
143 uint8_t *p;
144
145 /* Compute number of bytes mod 64 */
146 count = (ctx->bits[0] >> 3) & 0x3F;
147
148 /* Set the first char of padding to 0x80. This is safe since there is
149 always at least one byte free */
150 p = (uint8_t *)ctx->in + count;
151 *p++ = 0x80;
152
153 /* Bytes of padding needed to make 64 bytes */
154 count = 64 - 1 - count;
155
156 /* Pad out to 56 mod 64 */
157 if (count < 8) {
158 /* Two lots of padding: Pad the first block to 64 bytes */
159 memset(p, 0, count);
160 byteReverse(ctx->in, 16);
161 MD5Transform(ctx->buf, ctx->in);
162
163 /* Now fill the next block with 56 bytes */
164 memset(ctx->in, 0, 56);
165 } else {
166 /* Pad block to 56 bytes */
167 memset(p, 0, count - 8);
168 }
169 byteReverse(ctx->in, 14);
170
171 /* Append length in bits and transform */
172 ctx->in[14] = ctx->bits[0];
173 ctx->in[15] = ctx->bits[1];
174
175 MD5Transform(ctx->buf, ctx->in);
176 byteReverse(ctx->buf, 4);
177 memcpy(digest, ctx->buf, 16);
178 memset(ctx, 0, sizeof(ctx)); /* In case it's sensitive */
179}
180
181
182/* The four core functions - F1 is optimized somewhat */
183
184/* #define F1(x, y, z) (x & y | ~x & z) */
185#define F1(x, y, z) (z ^ (x & (y ^ z)))
186#define F2(x, y, z) F1(z, x, y)
187#define F3(x, y, z) (x ^ y ^ z)
188#define F4(x, y, z) (y ^ (x | ~z))
189
190/* This is the central step in the MD5 algorithm. */
191#define MD5STEP(f, w, x, y, z, data, s) \
192 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
193
194/*
195 * The core of the MD5 algorithm, this alters an existing MD5 hash to
196 * reflect the addition of 16 longwords of new data. MD5Update blocks
197 * the data and converts bytes into longwords for this routine.
198 */
199static void MD5Transform(uint32_t buf[4], uint32_t in[16])
200{
201 uint32_t a, b, c, d;
202
203 a = buf[0];
204 b = buf[1];
205 c = buf[2];
206 d = buf[3];
207
208 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
209 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
210 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
211 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
212 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
213 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
214 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
215 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
216 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
217 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
218 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
219 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
220 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
221 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
222 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
223 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
224
225 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
226 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
227 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
228 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
229 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
230 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
231 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
232 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
233 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
234 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
235 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
236 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
237 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
238 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
239 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
240 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
241
242 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
243 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
244 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
245 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
246 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
247 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
248 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
249 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
250 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
251 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
252 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
253 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
254 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
255 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
256 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
257 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
258
259 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
260 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
261 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
262 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
263 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
264 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
265 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
266 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
267 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
268 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
269 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
270 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
271 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
272 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
273 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
274 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
275
276 buf[0] += a;
277 buf[1] += b;
278 buf[2] += c;
279 buf[3] += d;
280}
Note: See TracBrowser for help on using the repository browser.

© 2024 Oracle Support Privacy / Do Not Sell My Info Terms of Use Trademark Policy Automated Access Etiquette