Coverage Report

Created: 2022-08-24 06:19

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