/src/jsonnet/third_party/md5/md5.cpp
Line | Count | Source (jump to first uncovered line) |
1 | | /* MD5 |
2 | | converted to C++ class by Frank Thilo (thilo@unix-ag.org) |
3 | | for bzflag (http://www.bzflag.org) |
4 | | |
5 | | based on: |
6 | | |
7 | | md5.h and md5.c |
8 | | reference implemantion of RFC 1321 |
9 | | |
10 | | Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All |
11 | | rights reserved. |
12 | | |
13 | | License to copy and use this software is granted provided that it |
14 | | is identified as the "RSA Data Security, Inc. MD5 Message-Digest |
15 | | Algorithm" in all material mentioning or referencing this software |
16 | | or this function. |
17 | | |
18 | | License is also granted to make and use derivative works provided |
19 | | that such works are identified as "derived from the RSA Data |
20 | | Security, Inc. MD5 Message-Digest Algorithm" in all material |
21 | | mentioning or referencing the derived work. |
22 | | |
23 | | RSA Data Security, Inc. makes no representations concerning either |
24 | | the merchantability of this software or the suitability of this |
25 | | software for any particular purpose. It is provided "as is" |
26 | | without express or implied warranty of any kind. |
27 | | |
28 | | These notices must be retained in any copies of any part of this |
29 | | documentation and/or software. |
30 | | |
31 | | */ |
32 | | |
33 | | /* interface header */ |
34 | | #include "md5.h" |
35 | | |
36 | | /* system implementation headers */ |
37 | | #include <cstdio> |
38 | | #include <string> |
39 | | |
40 | | |
41 | | // Constants for MD5Transform routine. |
42 | 0 | #define S11 7 |
43 | 0 | #define S12 12 |
44 | 0 | #define S13 17 |
45 | 0 | #define S14 22 |
46 | 0 | #define S21 5 |
47 | 0 | #define S22 9 |
48 | 0 | #define S23 14 |
49 | 0 | #define S24 20 |
50 | 0 | #define S31 4 |
51 | 0 | #define S32 11 |
52 | 0 | #define S33 16 |
53 | 0 | #define S34 23 |
54 | 0 | #define S41 6 |
55 | 0 | #define S42 10 |
56 | 0 | #define S43 15 |
57 | 0 | #define S44 21 |
58 | | |
59 | | /////////////////////////////////////////////// |
60 | | |
61 | | // F, G, H and I are basic MD5 functions. |
62 | 0 | inline MD5::uint4 MD5::F(uint4 x, uint4 y, uint4 z) { |
63 | 0 | return (x&y) | (~x&z); |
64 | 0 | } |
65 | | |
66 | 0 | inline MD5::uint4 MD5::G(uint4 x, uint4 y, uint4 z) { |
67 | 0 | return (x&z) | (y&~z); |
68 | 0 | } |
69 | | |
70 | 0 | inline MD5::uint4 MD5::H(uint4 x, uint4 y, uint4 z) { |
71 | 0 | return x^y^z; |
72 | 0 | } |
73 | | |
74 | 0 | inline MD5::uint4 MD5::I(uint4 x, uint4 y, uint4 z) { |
75 | 0 | return y ^ (x | ~z); |
76 | 0 | } |
77 | | |
78 | | // rotate_left rotates x left n bits. |
79 | 0 | inline MD5::uint4 MD5::rotate_left(uint4 x, int n) { |
80 | 0 | return (x << n) | (x >> (32-n)); |
81 | 0 | } |
82 | | |
83 | | // FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4. |
84 | | // Rotation is separate from addition to prevent recomputation. |
85 | 0 | inline void MD5::FF(uint4 &a, uint4 b, uint4 c, uint4 d, uint4 x, uint4 s, uint4 ac) { |
86 | 0 | a = rotate_left(a+ F(b,c,d) + x + ac, s) + b; |
87 | 0 | } |
88 | | |
89 | 0 | inline void MD5::GG(uint4 &a, uint4 b, uint4 c, uint4 d, uint4 x, uint4 s, uint4 ac) { |
90 | 0 | a = rotate_left(a + G(b,c,d) + x + ac, s) + b; |
91 | 0 | } |
92 | | |
93 | 0 | inline void MD5::HH(uint4 &a, uint4 b, uint4 c, uint4 d, uint4 x, uint4 s, uint4 ac) { |
94 | 0 | a = rotate_left(a + H(b,c,d) + x + ac, s) + b; |
95 | 0 | } |
96 | | |
97 | 0 | inline void MD5::II(uint4 &a, uint4 b, uint4 c, uint4 d, uint4 x, uint4 s, uint4 ac) { |
98 | 0 | a = rotate_left(a + I(b,c,d) + x + ac, s) + b; |
99 | 0 | } |
100 | | |
101 | | ////////////////////////////////////////////// |
102 | | |
103 | | // default ctor, just initailize |
104 | | MD5::MD5() |
105 | 0 | { |
106 | 0 | init(); |
107 | 0 | } |
108 | | |
109 | | ////////////////////////////////////////////// |
110 | | |
111 | | // nifty shortcut ctor, compute MD5 for string and finalize it right away |
112 | | MD5::MD5(const std::string &text) |
113 | 0 | { |
114 | 0 | init(); |
115 | 0 | update(text.c_str(), text.length()); |
116 | 0 | finalize(); |
117 | 0 | } |
118 | | |
119 | | ////////////////////////////// |
120 | | |
121 | | void MD5::init() |
122 | 0 | { |
123 | 0 | finalized=false; |
124 | | |
125 | 0 | count[0] = 0; |
126 | 0 | count[1] = 0; |
127 | | |
128 | | // load magic initialization constants. |
129 | 0 | state[0] = 0x67452301; |
130 | 0 | state[1] = 0xefcdab89; |
131 | 0 | state[2] = 0x98badcfe; |
132 | 0 | state[3] = 0x10325476; |
133 | 0 | } |
134 | | |
135 | | ////////////////////////////// |
136 | | |
137 | | // decodes input (unsigned char) into output (uint4). Assumes len is a multiple of 4. |
138 | | void MD5::decode(uint4 output[], const uint1 input[], size_type len) |
139 | 0 | { |
140 | 0 | for (unsigned int i = 0, j = 0; j < len; i++, j += 4) |
141 | 0 | output[i] = ((uint4)input[j]) | (((uint4)input[j+1]) << 8) | |
142 | 0 | (((uint4)input[j+2]) << 16) | (((uint4)input[j+3]) << 24); |
143 | 0 | } |
144 | | |
145 | | ////////////////////////////// |
146 | | |
147 | | // encodes input (uint4) into output (unsigned char). Assumes len is |
148 | | // a multiple of 4. |
149 | | void MD5::encode(uint1 output[], const uint4 input[], size_type len) |
150 | 0 | { |
151 | 0 | for (size_type i = 0, j = 0; j < len; i++, j += 4) { |
152 | 0 | output[j] = input[i] & 0xff; |
153 | 0 | output[j+1] = (input[i] >> 8) & 0xff; |
154 | 0 | output[j+2] = (input[i] >> 16) & 0xff; |
155 | 0 | output[j+3] = (input[i] >> 24) & 0xff; |
156 | 0 | } |
157 | 0 | } |
158 | | |
159 | | ////////////////////////////// |
160 | | |
161 | | // apply MD5 algo on a block |
162 | | void MD5::transform(const uint1 block[blocksize]) |
163 | 0 | { |
164 | 0 | uint4 a = state[0], b = state[1], c = state[2], d = state[3], x[16]; |
165 | 0 | decode (x, block, blocksize); |
166 | | |
167 | | /* Round 1 */ |
168 | 0 | FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */ |
169 | 0 | FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */ |
170 | 0 | FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */ |
171 | 0 | FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */ |
172 | 0 | FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */ |
173 | 0 | FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */ |
174 | 0 | FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */ |
175 | 0 | FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */ |
176 | 0 | FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */ |
177 | 0 | FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */ |
178 | 0 | FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */ |
179 | 0 | FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */ |
180 | 0 | FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */ |
181 | 0 | FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */ |
182 | 0 | FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */ |
183 | 0 | FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */ |
184 | | |
185 | | /* Round 2 */ |
186 | 0 | GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */ |
187 | 0 | GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */ |
188 | 0 | GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */ |
189 | 0 | GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */ |
190 | 0 | GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */ |
191 | 0 | GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */ |
192 | 0 | GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */ |
193 | 0 | GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */ |
194 | 0 | GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */ |
195 | 0 | GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */ |
196 | 0 | GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */ |
197 | 0 | GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */ |
198 | 0 | GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */ |
199 | 0 | GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */ |
200 | 0 | GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */ |
201 | 0 | GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */ |
202 | | |
203 | | /* Round 3 */ |
204 | 0 | HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */ |
205 | 0 | HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */ |
206 | 0 | HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */ |
207 | 0 | HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */ |
208 | 0 | HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */ |
209 | 0 | HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */ |
210 | 0 | HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */ |
211 | 0 | HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */ |
212 | 0 | HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */ |
213 | 0 | HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */ |
214 | 0 | HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */ |
215 | 0 | HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */ |
216 | 0 | HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */ |
217 | 0 | HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */ |
218 | 0 | HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */ |
219 | 0 | HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */ |
220 | | |
221 | | /* Round 4 */ |
222 | 0 | II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */ |
223 | 0 | II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */ |
224 | 0 | II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */ |
225 | 0 | II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */ |
226 | 0 | II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */ |
227 | 0 | II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */ |
228 | 0 | II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */ |
229 | 0 | II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */ |
230 | 0 | II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */ |
231 | 0 | II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */ |
232 | 0 | II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */ |
233 | 0 | II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */ |
234 | 0 | II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */ |
235 | 0 | II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */ |
236 | 0 | II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */ |
237 | 0 | II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */ |
238 | | |
239 | 0 | state[0] += a; |
240 | 0 | state[1] += b; |
241 | 0 | state[2] += c; |
242 | 0 | state[3] += d; |
243 | | |
244 | | // Zeroize sensitive information. |
245 | 0 | memset(x, 0, sizeof x); |
246 | 0 | } |
247 | | |
248 | | ////////////////////////////// |
249 | | |
250 | | // MD5 block update operation. Continues an MD5 message-digest |
251 | | // operation, processing another message block |
252 | | void MD5::update(const unsigned char input[], size_type length) |
253 | 0 | { |
254 | | // compute number of bytes mod 64 |
255 | 0 | size_type index = count[0] / 8 % blocksize; |
256 | | |
257 | | // Update number of bits |
258 | 0 | if ((count[0] += (length << 3)) < (length << 3)) |
259 | 0 | count[1]++; |
260 | 0 | count[1] += (length >> 29); |
261 | | |
262 | | // number of bytes we need to fill in buffer |
263 | 0 | size_type firstpart = 64 - index; |
264 | | |
265 | 0 | size_type i; |
266 | | |
267 | | // transform as many times as possible. |
268 | 0 | if (length >= firstpart) |
269 | 0 | { |
270 | | // fill buffer first, transform |
271 | 0 | memcpy(&buffer[index], input, firstpart); |
272 | 0 | transform(buffer); |
273 | | |
274 | | // transform chunks of blocksize (64 bytes) |
275 | 0 | for (i = firstpart; i + blocksize <= length; i += blocksize) |
276 | 0 | transform(&input[i]); |
277 | | |
278 | 0 | index = 0; |
279 | 0 | } |
280 | 0 | else |
281 | 0 | i = 0; |
282 | | |
283 | | // buffer remaining input |
284 | 0 | memcpy(&buffer[index], &input[i], length-i); |
285 | 0 | } |
286 | | |
287 | | ////////////////////////////// |
288 | | |
289 | | // for convenience provide a verson with signed char |
290 | | void MD5::update(const char input[], size_type length) |
291 | 0 | { |
292 | 0 | update((const unsigned char*)input, length); |
293 | 0 | } |
294 | | |
295 | | ////////////////////////////// |
296 | | |
297 | | // MD5 finalization. Ends an MD5 message-digest operation, writing the |
298 | | // the message digest and zeroizing the context. |
299 | | MD5& MD5::finalize() |
300 | 0 | { |
301 | 0 | static unsigned char padding[64] = { |
302 | 0 | 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
303 | 0 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
304 | 0 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 |
305 | 0 | }; |
306 | | |
307 | 0 | if (!finalized) { |
308 | | // Save number of bits |
309 | 0 | unsigned char bits[8]; |
310 | 0 | encode(bits, count, 8); |
311 | | |
312 | | // pad out to 56 mod 64. |
313 | 0 | size_type index = count[0] / 8 % 64; |
314 | 0 | size_type padLen = (index < 56) ? (56 - index) : (120 - index); |
315 | 0 | update(padding, padLen); |
316 | | |
317 | | // Append length (before padding) |
318 | 0 | update(bits, 8); |
319 | | |
320 | | // Store state in digest |
321 | 0 | encode(digest, state, 16); |
322 | | |
323 | | // Zeroize sensitive information. |
324 | 0 | memset(buffer, 0, sizeof buffer); |
325 | 0 | memset(count, 0, sizeof count); |
326 | | |
327 | 0 | finalized=true; |
328 | 0 | } |
329 | | |
330 | 0 | return *this; |
331 | 0 | } |
332 | | |
333 | | ////////////////////////////// |
334 | | |
335 | | // return hex representation of digest as string |
336 | | std::string MD5::hexdigest() const |
337 | 0 | { |
338 | 0 | if (!finalized) |
339 | 0 | return ""; |
340 | | |
341 | 0 | char buf[33]; |
342 | 0 | for (int i=0; i<16; i++) |
343 | 0 | sprintf(buf+i*2, "%02x", digest[i]); |
344 | 0 | buf[32]=0; |
345 | | |
346 | 0 | return std::string(buf); |
347 | 0 | } |
348 | | |
349 | | ////////////////////////////// |
350 | | |
351 | | std::ostream& operator<<(std::ostream& out, MD5 md5) |
352 | 0 | { |
353 | 0 | return out << md5.hexdigest(); |
354 | 0 | } |
355 | | |
356 | | ////////////////////////////// |
357 | | |
358 | | std::string md5(const std::string str) |
359 | 0 | { |
360 | 0 | MD5 md5 = MD5(str); |
361 | | |
362 | 0 | return md5.hexdigest(); |
363 | 0 | } |
364 | | |