gloox  0.9.9.12
md5.cpp
1 /*
2  Copyright (c) 2006-2008 by Jakob Schroeter <js@camaya.net>
3  This file is part of the gloox library. http://camaya.net/gloox
4 
5  This software is distributed under a license. The full license
6  agreement can be found in the file LICENSE in this distribution.
7  This software may not be copied, modified, sold or distributed
8  other than expressed in the named license agreement.
9 
10  This software is distributed without any warranty.
11 */
12 
13 /*
14  This class is based on a C implementation of the MD5 algorithm written by
15  L. Peter Deutsch.
16  The full notice as shipped with the original verson is included below.
17 */
18 
19 /*
20  Copyright (C) 1999, 2000, 2002 Aladdin Enterprises. All rights reserved.
21 
22  This software is provided 'as-is', without any express or implied
23  warranty. In no event will the authors be held liable for any damages
24  arising from the use of this software.
25 
26  Permission is granted to anyone to use this software for any purpose,
27  including commercial applications, and to alter it and redistribute it
28  freely, subject to the following restrictions:
29 
30  1. The origin of this software must not be misrepresented; you must not
31  claim that you wrote the original software. If you use this software
32  in a product, an acknowledgment in the product documentation would be
33  appreciated but is not required.
34  2. Altered source versions must be plainly marked as such, and must not be
35  misrepresented as being the original software.
36  3. This notice may not be removed or altered from any source distribution.
37 
38  L. Peter Deutsch
39  ghost@aladdin.com
40 
41  */
42 /* $Id: md5.c,v 1.6 2002/04/13 19:20:28 lpd Exp $ */
43 /*
44  Independent implementation of MD5 (RFC 1321).
45 
46  This code implements the MD5 Algorithm defined in RFC 1321, whose
47  text is available at
48  http://www.ietf.org/rfc/rfc1321.txt
49  The code is derived from the text of the RFC, including the test suite
50  (section A.5) but excluding the rest of Appendix A. It does not include
51  any code or documentation that is identified in the RFC as being
52  copyrighted.
53 
54  The original and principal author of md5.c is L. Peter Deutsch
55  <ghost@aladdin.com>. Other authors are noted in the change history
56  that follows (in reverse chronological order):
57 
58  2002-04-13 lpd Clarified derivation from RFC 1321; now handles byte order
59  either statically or dynamically; added missing #include <string.h>
60  in library.
61  2002-03-11 lpd Corrected argument list for main(), and added int return
62  type, in test program and T value program.
63  2002-02-21 lpd Added missing #include <stdio.h> in test program.
64  2000-07-03 lpd Patched to eliminate warnings about "constant is
65  unsigned in ANSI C, signed in traditional"; made test program
66  self-checking.
67  1999-11-04 lpd Edited comments slightly for automatic TOC extraction.
68  1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5).
69  1999-05-03 lpd Original version.
70  */
71 
72 #include "md5.h"
73 
74 #include <cstdio>
75 #include <string.h>
76 
77 namespace gloox
78 {
79 // #undef BYTE_ORDER /* 1 = big-endian, -1 = little-endian, 0 = unknown */
80 // #ifdef ARCH_IS_BIG_ENDIAN
81 // # define BYTE_ORDER (ARCH_IS_BIG_ENDIAN ? 1 : -1)
82 // #else
83 // # define BYTE_ORDER 0
84 // #endif
85 
86 #undef BYTE_ORDER
87 #define BYTE_ORDER 0
88 
89 #define T_MASK ((unsigned int)~0)
90 #define T1 /* 0xd76aa478 */ (T_MASK ^ 0x28955b87)
91 #define T2 /* 0xe8c7b756 */ (T_MASK ^ 0x173848a9)
92 #define T3 0x242070db
93 #define T4 /* 0xc1bdceee */ (T_MASK ^ 0x3e423111)
94 #define T5 /* 0xf57c0faf */ (T_MASK ^ 0x0a83f050)
95 #define T6 0x4787c62a
96 #define T7 /* 0xa8304613 */ (T_MASK ^ 0x57cfb9ec)
97 #define T8 /* 0xfd469501 */ (T_MASK ^ 0x02b96afe)
98 #define T9 0x698098d8
99 #define T10 /* 0x8b44f7af */ (T_MASK ^ 0x74bb0850)
100 #define T11 /* 0xffff5bb1 */ (T_MASK ^ 0x0000a44e)
101 #define T12 /* 0x895cd7be */ (T_MASK ^ 0x76a32841)
102 #define T13 0x6b901122
103 #define T14 /* 0xfd987193 */ (T_MASK ^ 0x02678e6c)
104 #define T15 /* 0xa679438e */ (T_MASK ^ 0x5986bc71)
105 #define T16 0x49b40821
106 #define T17 /* 0xf61e2562 */ (T_MASK ^ 0x09e1da9d)
107 #define T18 /* 0xc040b340 */ (T_MASK ^ 0x3fbf4cbf)
108 #define T19 0x265e5a51
109 #define T20 /* 0xe9b6c7aa */ (T_MASK ^ 0x16493855)
110 #define T21 /* 0xd62f105d */ (T_MASK ^ 0x29d0efa2)
111 #define T22 0x02441453
112 #define T23 /* 0xd8a1e681 */ (T_MASK ^ 0x275e197e)
113 #define T24 /* 0xe7d3fbc8 */ (T_MASK ^ 0x182c0437)
114 #define T25 0x21e1cde6
115 #define T26 /* 0xc33707d6 */ (T_MASK ^ 0x3cc8f829)
116 #define T27 /* 0xf4d50d87 */ (T_MASK ^ 0x0b2af278)
117 #define T28 0x455a14ed
118 #define T29 /* 0xa9e3e905 */ (T_MASK ^ 0x561c16fa)
119 #define T30 /* 0xfcefa3f8 */ (T_MASK ^ 0x03105c07)
120 #define T31 0x676f02d9
121 #define T32 /* 0x8d2a4c8a */ (T_MASK ^ 0x72d5b375)
122 #define T33 /* 0xfffa3942 */ (T_MASK ^ 0x0005c6bd)
123 #define T34 /* 0x8771f681 */ (T_MASK ^ 0x788e097e)
124 #define T35 0x6d9d6122
125 #define T36 /* 0xfde5380c */ (T_MASK ^ 0x021ac7f3)
126 #define T37 /* 0xa4beea44 */ (T_MASK ^ 0x5b4115bb)
127 #define T38 0x4bdecfa9
128 #define T39 /* 0xf6bb4b60 */ (T_MASK ^ 0x0944b49f)
129 #define T40 /* 0xbebfbc70 */ (T_MASK ^ 0x4140438f)
130 #define T41 0x289b7ec6
131 #define T42 /* 0xeaa127fa */ (T_MASK ^ 0x155ed805)
132 #define T43 /* 0xd4ef3085 */ (T_MASK ^ 0x2b10cf7a)
133 #define T44 0x04881d05
134 #define T45 /* 0xd9d4d039 */ (T_MASK ^ 0x262b2fc6)
135 #define T46 /* 0xe6db99e5 */ (T_MASK ^ 0x1924661a)
136 #define T47 0x1fa27cf8
137 #define T48 /* 0xc4ac5665 */ (T_MASK ^ 0x3b53a99a)
138 #define T49 /* 0xf4292244 */ (T_MASK ^ 0x0bd6ddbb)
139 #define T50 0x432aff97
140 #define T51 /* 0xab9423a7 */ (T_MASK ^ 0x546bdc58)
141 #define T52 /* 0xfc93a039 */ (T_MASK ^ 0x036c5fc6)
142 #define T53 0x655b59c3
143 #define T54 /* 0x8f0ccc92 */ (T_MASK ^ 0x70f3336d)
144 #define T55 /* 0xffeff47d */ (T_MASK ^ 0x00100b82)
145 #define T56 /* 0x85845dd1 */ (T_MASK ^ 0x7a7ba22e)
146 #define T57 0x6fa87e4f
147 #define T58 /* 0xfe2ce6e0 */ (T_MASK ^ 0x01d3191f)
148 #define T59 /* 0xa3014314 */ (T_MASK ^ 0x5cfebceb)
149 #define T60 0x4e0811a1
150 #define T61 /* 0xf7537e82 */ (T_MASK ^ 0x08ac817d)
151 #define T62 /* 0xbd3af235 */ (T_MASK ^ 0x42c50dca)
152 #define T63 0x2ad7d2bb
153 #define T64 /* 0xeb86d391 */ (T_MASK ^ 0x14792c6e)
154 
155 
156  const unsigned char MD5::pad[64] =
157  {
158  0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
159  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
160  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
161  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
162  };
163 
165  : m_finished( false )
166  {
167  init();
168  }
169 
171  {
172  }
173 
174  void MD5::process( const unsigned char *data /*[64]*/ )
175  {
176  unsigned int a = m_state.abcd[0];
177  unsigned int b = m_state.abcd[1];
178  unsigned int c = m_state.abcd[2];
179  unsigned int d = m_state.abcd[3];
180  unsigned int t;
181 #if BYTE_ORDER > 0
182  /* Define storage only for big-endian CPUs. */
183  unsigned int X[16];
184 #else
185  /* Define storage for little-endian or both types of CPUs. */
186  unsigned int xbuf[16];
187  const unsigned int *X;
188 #endif
189 
190  {
191 #if BYTE_ORDER == 0
192  /*
193  * Determine dynamically whether this is a big-endian or
194  * little-endian machine, since we can use a more efficient
195  * algorithm on the latter.
196  */
197  static const int w = 1;
198 
199  if( *((const unsigned char *)&w) ) /* dynamic little-endian */
200 #endif
201 #if BYTE_ORDER <= 0 /* little-endian */
202  {
203  /*
204  * On little-endian machines, we can process properly aligned
205  * data without copying it.
206  */
207  if( !((data - (const unsigned char*)0) & 3) )
208  {
209  /* data are properly aligned */
210  X = (const unsigned int*)data;
211  }
212  else
213  {
214  /* not aligned */
215  memcpy( xbuf, data, 64 );
216  X = xbuf;
217  }
218  }
219 #endif
220 #if BYTE_ORDER == 0
221  else // dynamic big-endian
222 #endif
223 #if BYTE_ORDER >= 0 // big-endian
224  {
225  /*
226  * On big-endian machines, we must arrange the bytes in the
227  * right order.
228  */
229  const unsigned char *xp = data;
230  int i;
231 
232 # if BYTE_ORDER == 0
233  X = xbuf; // (dynamic only)
234 # else
235 # define xbuf X /* (static only) */
236 # endif
237  for( i = 0; i < 16; ++i, xp += 4 )
238  xbuf[i] = xp[0] + ( xp[1] << 8 ) + ( xp[2] << 16 ) + ( xp[3] << 24 );
239  }
240 #endif
241  }
242 
243 #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n))))
244 
245  /* Round 1. */
246  /* Let [abcd k s i] denote the operation
247  a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s). */
248 #define F(x, y, z) (((x) & (y)) | (~(x) & (z)))
249 #define SET(a, b, c, d, k, s, Ti)\
250  t = a + F(b,c,d) + X[k] + Ti;\
251  a = ROTATE_LEFT(t, s) + b
252  /* Do the following 16 operations. */
253  SET(a, b, c, d, 0, 7, T1);
254  SET(d, a, b, c, 1, 12, T2);
255  SET(c, d, a, b, 2, 17, T3);
256  SET(b, c, d, a, 3, 22, T4);
257  SET(a, b, c, d, 4, 7, T5);
258  SET(d, a, b, c, 5, 12, T6);
259  SET(c, d, a, b, 6, 17, T7);
260  SET(b, c, d, a, 7, 22, T8);
261  SET(a, b, c, d, 8, 7, T9);
262  SET(d, a, b, c, 9, 12, T10);
263  SET(c, d, a, b, 10, 17, T11);
264  SET(b, c, d, a, 11, 22, T12);
265  SET(a, b, c, d, 12, 7, T13);
266  SET(d, a, b, c, 13, 12, T14);
267  SET(c, d, a, b, 14, 17, T15);
268  SET(b, c, d, a, 15, 22, T16);
269 #undef SET
270 
271  /* Round 2. */
272  /* Let [abcd k s i] denote the operation
273  a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s). */
274 #define G(x, y, z) (((x) & (z)) | ((y) & ~(z)))
275 #define SET(a, b, c, d, k, s, Ti)\
276  t = a + G(b,c,d) + X[k] + Ti;\
277  a = ROTATE_LEFT(t, s) + b
278  /* Do the following 16 operations. */
279  SET(a, b, c, d, 1, 5, T17);
280  SET(d, a, b, c, 6, 9, T18);
281  SET(c, d, a, b, 11, 14, T19);
282  SET(b, c, d, a, 0, 20, T20);
283  SET(a, b, c, d, 5, 5, T21);
284  SET(d, a, b, c, 10, 9, T22);
285  SET(c, d, a, b, 15, 14, T23);
286  SET(b, c, d, a, 4, 20, T24);
287  SET(a, b, c, d, 9, 5, T25);
288  SET(d, a, b, c, 14, 9, T26);
289  SET(c, d, a, b, 3, 14, T27);
290  SET(b, c, d, a, 8, 20, T28);
291  SET(a, b, c, d, 13, 5, T29);
292  SET(d, a, b, c, 2, 9, T30);
293  SET(c, d, a, b, 7, 14, T31);
294  SET(b, c, d, a, 12, 20, T32);
295 #undef SET
296 
297  /* Round 3. */
298  /* Let [abcd k s t] denote the operation
299  a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s). */
300 #define H(x, y, z) ((x) ^ (y) ^ (z))
301 #define SET(a, b, c, d, k, s, Ti)\
302  t = a + H(b,c,d) + X[k] + Ti;\
303  a = ROTATE_LEFT(t, s) + b
304  /* Do the following 16 operations. */
305  SET(a, b, c, d, 5, 4, T33);
306  SET(d, a, b, c, 8, 11, T34);
307  SET(c, d, a, b, 11, 16, T35);
308  SET(b, c, d, a, 14, 23, T36);
309  SET(a, b, c, d, 1, 4, T37);
310  SET(d, a, b, c, 4, 11, T38);
311  SET(c, d, a, b, 7, 16, T39);
312  SET(b, c, d, a, 10, 23, T40);
313  SET(a, b, c, d, 13, 4, T41);
314  SET(d, a, b, c, 0, 11, T42);
315  SET(c, d, a, b, 3, 16, T43);
316  SET(b, c, d, a, 6, 23, T44);
317  SET(a, b, c, d, 9, 4, T45);
318  SET(d, a, b, c, 12, 11, T46);
319  SET(c, d, a, b, 15, 16, T47);
320  SET(b, c, d, a, 2, 23, T48);
321 #undef SET
322 
323  /* Round 4. */
324  /* Let [abcd k s t] denote the operation
325  a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s). */
326 #define I(x, y, z) ((y) ^ ((x) | ~(z)))
327 #define SET(a, b, c, d, k, s, Ti)\
328  t = a + I(b,c,d) + X[k] + Ti;\
329  a = ROTATE_LEFT(t, s) + b
330  /* Do the following 16 operations. */
331  SET(a, b, c, d, 0, 6, T49);
332  SET(d, a, b, c, 7, 10, T50);
333  SET(c, d, a, b, 14, 15, T51);
334  SET(b, c, d, a, 5, 21, T52);
335  SET(a, b, c, d, 12, 6, T53);
336  SET(d, a, b, c, 3, 10, T54);
337  SET(c, d, a, b, 10, 15, T55);
338  SET(b, c, d, a, 1, 21, T56);
339  SET(a, b, c, d, 8, 6, T57);
340  SET(d, a, b, c, 15, 10, T58);
341  SET(c, d, a, b, 6, 15, T59);
342  SET(b, c, d, a, 13, 21, T60);
343  SET(a, b, c, d, 4, 6, T61);
344  SET(d, a, b, c, 11, 10, T62);
345  SET(c, d, a, b, 2, 15, T63);
346  SET(b, c, d, a, 9, 21, T64);
347 #undef SET
348 
349  /* Then perform the following additions. (That is increment each
350  of the four registers by the value it had before this block
351  was started.) */
352  m_state.abcd[0] += a;
353  m_state.abcd[1] += b;
354  m_state.abcd[2] += c;
355  m_state.abcd[3] += d;
356  }
357 
358  void MD5::init()
359  {
360  m_finished = false;
361  m_state.count[0] = 0;
362  m_state.count[1] = 0;
363  m_state.abcd[0] = 0x67452301;
364  m_state.abcd[1] = /*0xefcdab89*/ T_MASK ^ 0x10325476;
365  m_state.abcd[2] = /*0x98badcfe*/ T_MASK ^ 0x67452301;
366  m_state.abcd[3] = 0x10325476;
367  }
368 
369  void MD5::feed( const std::string& data )
370  {
371  feed( (const unsigned char*)data.c_str(), data.length() );
372  }
373 
374  void MD5::feed( const unsigned char *data, int bytes )
375  {
376  const unsigned char *p = data;
377  int left = bytes;
378  int offset = ( m_state.count[0] >> 3 ) & 63;
379  unsigned int nbits = (unsigned int)( bytes << 3 );
380 
381  if( bytes <= 0 )
382  return;
383 
384  /* Update the message length. */
385  m_state.count[1] += bytes >> 29;
386  m_state.count[0] += nbits;
387  if( m_state.count[0] < nbits )
388  m_state.count[1]++;
389 
390  /* Process an initial partial block. */
391  if( offset )
392  {
393  int copy = ( offset + bytes > 64 ? 64 - offset : bytes );
394 
395  memcpy( m_state.buf + offset, p, copy );
396  if( offset + copy < 64 )
397  return;
398  p += copy;
399  left -= copy;
400  process( m_state.buf );
401  }
402 
403  /* Process full blocks. */
404  for( ; left >= 64; p += 64, left -= 64 )
405  process( p );
406 
407  /* Process a final partial block. */
408  if( left )
409  memcpy( m_state.buf, p, left );
410  }
411 
413  {
414  if( m_finished )
415  return;
416 
417  unsigned char data[8];
418  int i;
419 
420  /* Save the length before padding. */
421  for( i = 0; i < 8; ++i )
422  data[i] = (unsigned char)( m_state.count[i >> 2] >> ( ( i & 3 ) << 3 ) );
423 
424  /* Pad to 56 bytes mod 64. */
425  feed( pad, ( ( 55 - ( m_state.count[0] >> 3 ) ) & 63 ) + 1 );
426 
427  /* Append the length. */
428  feed( data, 8 );
429 
430  m_finished = true;
431  }
432 
433  const std::string MD5::hex()
434  {
435  if( !m_finished )
436  finalize();
437 
438  char buf[33];
439 
440  for( int i = 0; i < 16; ++i )
441  sprintf( buf + i * 2, "%02x", (unsigned char)( m_state.abcd[i >> 2] >> ( ( i & 3 ) << 3 ) ) );
442 
443  return buf;
444  }
445 
446  const std::string MD5::binary()
447  {
448  if( !m_finished )
449  finalize();
450 
451  unsigned char digest[16];
452  for( int i = 0; i < 16; ++i )
453  digest[i] = (unsigned char)( m_state.abcd[i >> 2] >> ( ( i & 3 ) << 3 ) );
454 
455  return std::string( (char*)digest, 16 );
456  }
457 
458  void MD5::reset()
459  {
460  init();
461  }
462 
463 }