pred@2142: // MD5.CC - source code for the C++/object oriented translation and 
pred@2142: //          modification of MD5.
pred@2142: 
pred@2142: // Translation and modification (c) 1995 by Mordechai T. Abzug 
pred@2142: 
pred@2142: // This translation/ modification is provided "as is," without express or 
pred@2142: // implied warranty of any kind.
pred@2142: 
pred@2142: // The translator/ modifier does not claim (1) that MD5 will do what you think 
pred@2142: // it does; (2) that this translation/ modification is accurate; or (3) that 
pred@2142: // this software is "merchantible."  (Language for this disclaimer partially 
pred@2142: // copied from the disclaimer below).
pred@2142: 
pred@2142: /* based on:
pred@2142: 
pred@2142:    MD5C.C - RSA Data Security, Inc., MD5 message-digest algorithm
pred@2142:    MDDRIVER.C - test driver for MD2, MD4 and MD5
pred@2142: 
pred@2142: 
pred@2142:    Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
pred@2142: rights reserved.
pred@2142: 
pred@2142: License to copy and use this software is granted provided that it
pred@2142: is identified as the "RSA Data Security, Inc. MD5 Message-Digest
pred@2142: Algorithm" in all material mentioning or referencing this software
pred@2142: or this function.
pred@2142: 
pred@2142: License is also granted to make and use derivative works provided
pred@2142: that such works are identified as "derived from the RSA Data
pred@2142: Security, Inc. MD5 Message-Digest Algorithm" in all material
pred@2142: mentioning or referencing the derived work.
pred@2142: 
pred@2142: RSA Data Security, Inc. makes no representations concerning either
pred@2142: the merchantability of this software or the suitability of this
pred@2142: software for any particular purpose. It is provided "as is"
pred@2142: without express or implied warranty of any kind.
pred@2142: 
pred@2142: These notices must be retained in any copies of any part of this
pred@2142: documentation and/or software.
pred@2142: 
pred@2142:  */
pred@2142: 
pred@2142: #include "md5.h"
pred@2142: 
pred@2142: #include <assert.h>
pred@2142: #include <string.h>
pred@2142: 
pred@2142: // MD5 simple initialization method
pred@2142: 
pred@2142: MD5::MD5(){
pred@2142: 
pred@2142:   init();
pred@2142: 
pred@2142: }
pred@2142: 
pred@2142: 
pred@2142: // MD5 block update operation. Continues an MD5 message-digest
pred@2142: // operation, processing another message block, and updating the
pred@2142: // context.
pred@2142: 
pred@2142: void MD5::update (uint1 *input, uint4 input_length) {
pred@2142: 
pred@2142:   uint4 input_index, buffer_index;
pred@2142:   uint4 buffer_space;                // how much space is left in buffer
pred@2142: 
pred@2142:   if (finalized){  // so we can't update!
pred@2142:     /*cerr << "MD5::update:  Can't update a finalized digest!" << endl;*/
pred@2142:     return;
pred@2142:   }
pred@2142: 
pred@2142:   // Compute number of bytes mod 64
pred@2142:   buffer_index = (unsigned int)((count[0] >> 3) & 0x3F);
pred@2142: 
pred@2142:   // Update number of bits
pred@2142:   if (  (count[0] += ((uint4) input_length << 3))<((uint4) input_length << 3) )
pred@2142:     count[1]++;
pred@2142: 
pred@2142:   count[1] += ((uint4)input_length >> 29);
pred@2142: 
pred@2142: 
pred@2142:   buffer_space = 64 - buffer_index;  // how much space is left in buffer
pred@2142: 
pred@2142:   // Transform as many times as possible.
pred@2142:   if (input_length >= buffer_space) { // ie. we have enough to fill the buffer
pred@2142:     // fill the rest of the buffer and transform
pred@2142:     memcpy (buffer + buffer_index, input, buffer_space);
pred@2142:     transform (buffer);
pred@2142: 
pred@2142:     // now, transform each 64-byte piece of the input, bypassing the buffer
pred@2142:     for (input_index = buffer_space; input_index + 63 < input_length; 
pred@2142: 	 input_index += 64)
pred@2142:       transform (input+input_index);
pred@2142: 
pred@2142:     buffer_index = 0;  // so we can buffer remaining
pred@2142:   }
pred@2142:   else
pred@2142:     input_index=0;     // so we can buffer the whole input
pred@2142: 
pred@2142: 
pred@2142:   // and here we do the buffering:
pred@2142:   memcpy(buffer+buffer_index, input+input_index, input_length-input_index);
pred@2142: }
pred@2142: 
pred@2142: 
pred@2142: 
pred@2142: // MD5 update for files.
pred@2142: // Like above, except that it works on files (and uses above as a primitive.)
pred@2142: 
pred@2142: void MD5::update(FILE *file){
pred@2142: 
pred@2142:   unsigned char buffer[1024];
pred@2142:   int len;
pred@2142: 
pred@2142:   while ((len=fread(buffer, 1, 1024, file)))
pred@2142:     update(buffer, len);
pred@2142: 
pred@2142:   fclose (file);
pred@2142: 
pred@2142: }
pred@2142: 
pred@2142: 
pred@2142: // MD5 finalization. Ends an MD5 message-digest operation, writing the
pred@2142: // the message digest and zeroizing the context.
pred@2142: 
pred@2142: 
pred@2142: void MD5::finalize (){
pred@2142: 
pred@2142:   unsigned char bits[8];
pred@2142:   unsigned int index, padLen;
pred@2142:   static uint1 PADDING[64]={
pred@2142:     0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
pred@2142:     0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
pred@2142:     0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
pred@2142:     };
pred@2142: 
pred@2142:   if (finalized){
pred@2142:    /* cerr << "MD5::finalize:  Already finalized this digest!" << endl;*/
pred@2142:     return;
pred@2142:   }
pred@2142: 
pred@2142:   // Save number of bits
pred@2142:   encode (bits, count, 8);
pred@2142: 
pred@2142:   // Pad out to 56 mod 64.
pred@2142:   index = (uint4) ((count[0] >> 3) & 0x3f);
pred@2142:   padLen = (index < 56) ? (56 - index) : (120 - index);
pred@2142:   update (PADDING, padLen);
pred@2142: 
pred@2142:   // Append length (before padding)
pred@2142:   update (bits, 8);
pred@2142: 
pred@2142:   // Store state in digest
pred@2142:   encode (digest, state, 16);
pred@2142: 
pred@2142:   // Zeroize sensitive information
pred@2142:   memset (buffer, 0, sizeof(*buffer));
pred@2142: 
pred@2142:   finalized=1;
pred@2142: 
pred@2142: }
pred@2142: 
pred@2142: 
pred@2142: 
pred@2142: 
pred@2142: MD5::MD5(FILE *file){
pred@2142: 
pred@2142:   init();  // must be called be all constructors
pred@2142:   update(file);
pred@2142:   finalize ();
pred@2142: }
pred@2142: 
pred@2142: unsigned char *MD5::raw_digest(){
pred@2142: 
pred@2142:   uint1 *s = new uint1[16];
pred@2142: 
pred@2142:   if (!finalized){
pred@2142: /*    cerr << "MD5::raw_digest:  Can't get digest if you haven't "<<
pred@2142:       "finalized the digest!" <<endl;*/
pred@2142:     return ( (unsigned char*) "");
pred@2142:   }
pred@2142: 
pred@2142:   memcpy(s, digest, 16);
pred@2142:   return s;
pred@2142: }
pred@2142: 
pred@2142: unsigned char *MD5::raw_digest(unsigned char buffer[16])
pred@2142: {
pred@2142: 	if (!finalized)
pred@2142: 	{
pred@2142: 		return ( (unsigned char*) "");
pred@2142: 	}
pred@2142: 
pred@2142: 	 memcpy(buffer, digest, 16);
pred@2142: 	 return buffer;
pred@2142: }
pred@2142: 
pred@2142: 
pred@2142: 
pred@2142: char *MD5::hex_digest(){
pred@2142: 
pred@2142:   int i;
pred@2142:   char *s= new char[33];
pred@2142: 
pred@2142:   if (!finalized){
pred@2142: /*    cerr << "MD5::hex_digest:  Can't get digest if you haven't "<<
pred@2142:       "finalized the digest!" <<endl;*/
pred@2142:     return "";
pred@2142:   }
pred@2142: 
pred@2142:   for (i=0; i<16; i++)
pred@2142:     sprintf(s+i*2, "%02x", digest[i]);
pred@2142: 
pred@2142:   s[32]='\0';
pred@2142: 
pred@2142:   return s;
pred@2142: }
pred@2142: 
pred@2142: 
pred@2142: char *MD5::hex_digest(char buffer[33]){
pred@2142: 
pred@2142:   int i;
pred@2142: 
pred@2142:   if (!finalized)
pred@2142:   {
pred@2142: 	 /* cerr << "MD5::hex_digest:  Can't get digest if you haven't "<<
pred@2142:       "finalized the digest!" <<endl;*/
pred@2142:     return "";
pred@2142:   }
pred@2142: 
pred@2142:   for (i=0; i<16; i++)
pred@2142:     sprintf(buffer+i*2, "%02x", digest[i]);
pred@2142: 
pred@2142:   buffer[32]='\0';
pred@2142: 
pred@2142:   return buffer;
pred@2142: }
pred@2142: 
pred@2142: 
pred@2142: // PRIVATE METHODS:
pred@2142: 
pred@2142: 
pred@2142: 
pred@2142: void MD5::init(){
pred@2142:   finalized=0;  // we just started!
pred@2142: 
pred@2142:   // Nothing counted, so count=0
pred@2142:   count[0] = 0;
pred@2142:   count[1] = 0;
pred@2142: 
pred@2142:   // Load magic initialization constants.
pred@2142:   state[0] = 0x67452301;
pred@2142:   state[1] = 0xefcdab89;
pred@2142:   state[2] = 0x98badcfe;
pred@2142:   state[3] = 0x10325476;
pred@2142: }
pred@2142: 
pred@2142: 
pred@2142: 
pred@2142: // Constants for MD5Transform routine.
pred@2142: // Although we could use C++ style constants, defines are actually better,
pred@2142: // since they let us easily evade scope clashes.
pred@2142: 
pred@2142: #define S11 7
pred@2142: #define S12 12
pred@2142: #define S13 17
pred@2142: #define S14 22
pred@2142: #define S21 5
pred@2142: #define S22 9
pred@2142: #define S23 14
pred@2142: #define S24 20
pred@2142: #define S31 4
pred@2142: #define S32 11
pred@2142: #define S33 16
pred@2142: #define S34 23
pred@2142: #define S41 6
pred@2142: #define S42 10
pred@2142: #define S43 15
pred@2142: #define S44 21
pred@2142: 
pred@2142: 
pred@2142: 
pred@2142: 
pred@2142: // MD5 basic transformation. Transforms state based on block.
pred@2142: void MD5::transform (uint1 block[64]){
pred@2142: 
pred@2142:   uint4 a = state[0], b = state[1], c = state[2], d = state[3], x[16];
pred@2142: 
pred@2142:   decode (x, block, 64);
pred@2142: 
pred@2142:   assert(!finalized);  // not just a user error, since the method is private
pred@2142: 
pred@2142:   /* Round 1 */
pred@2142:   FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
pred@2142:   FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
pred@2142:   FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
pred@2142:   FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
pred@2142:   FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
pred@2142:   FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
pred@2142:   FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
pred@2142:   FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
pred@2142:   FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
pred@2142:   FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
pred@2142:   FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
pred@2142:   FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
pred@2142:   FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
pred@2142:   FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
pred@2142:   FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
pred@2142:   FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
pred@2142: 
pred@2142:  /* Round 2 */
pred@2142:   GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
pred@2142:   GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
pred@2142:   GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
pred@2142:   GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
pred@2142:   GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
pred@2142:   GG (d, a, b, c, x[10], S22,  0x2441453); /* 22 */
pred@2142:   GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
pred@2142:   GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
pred@2142:   GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
pred@2142:   GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
pred@2142:   GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
pred@2142:   GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
pred@2142:   GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
pred@2142:   GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
pred@2142:   GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
pred@2142:   GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
pred@2142: 
pred@2142:   /* Round 3 */
pred@2142:   HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
pred@2142:   HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
pred@2142:   HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
pred@2142:   HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
pred@2142:   HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
pred@2142:   HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
pred@2142:   HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
pred@2142:   HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
pred@2142:   HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
pred@2142:   HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
pred@2142:   HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
pred@2142:   HH (b, c, d, a, x[ 6], S34,  0x4881d05); /* 44 */
pred@2142:   HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
pred@2142:   HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
pred@2142:   HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
pred@2142:   HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
pred@2142: 
pred@2142:   /* Round 4 */
pred@2142:   II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
pred@2142:   II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
pred@2142:   II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
pred@2142:   II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
pred@2142:   II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
pred@2142:   II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
pred@2142:   II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
pred@2142:   II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
pred@2142:   II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
pred@2142:   II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
pred@2142:   II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
pred@2142:   II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
pred@2142:   II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
pred@2142:   II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
pred@2142:   II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
pred@2142:   II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
pred@2142: 
pred@2142:   state[0] += a;
pred@2142:   state[1] += b;
pred@2142:   state[2] += c;
pred@2142:   state[3] += d;
pred@2142: 
pred@2142:   // Zeroize sensitive information.
pred@2142:   memset ( (uint1 *) x, 0, sizeof(x));
pred@2142: 
pred@2142: }
pred@2142: 
pred@2142: 
pred@2142: 
pred@2142: // Encodes input (UINT4) into output (unsigned char). Assumes len is
pred@2142: // a multiple of 4.
pred@2142: void MD5::encode (uint1 *output, uint4 *input, uint4 len) {
pred@2142: 
pred@2142:   unsigned int i, j;
pred@2142: 
pred@2142:   for (i = 0, j = 0; j < len; i++, j += 4) {
pred@2142:     output[j]   = (uint1)  (input[i] & 0xff);
pred@2142:     output[j+1] = (uint1) ((input[i] >> 8) & 0xff);
pred@2142:     output[j+2] = (uint1) ((input[i] >> 16) & 0xff);
pred@2142:     output[j+3] = (uint1) ((input[i] >> 24) & 0xff);
pred@2142:   }
pred@2142: }
pred@2142: 
pred@2142: 
pred@2142: 
pred@2142: 
pred@2142: // Decodes input (unsigned char) into output (UINT4). Assumes len is
pred@2142: // a multiple of 4.
pred@2142: void MD5::decode (uint4 *output, uint1 *input, uint4 len){
pred@2142: 
pred@2142:   unsigned int i, j;
pred@2142: 
pred@2142:   for (i = 0, j = 0; j < len; i++, j += 4)
pred@2142:     output[i] = ((uint4)input[j]) | (((uint4)input[j+1]) << 8) |
pred@2142:       (((uint4)input[j+2]) << 16) | (((uint4)input[j+3]) << 24);
pred@2142: }
pred@2142: 
pred@2142: 
pred@2142: 
pred@2142: 
pred@2142: 
pred@2142: // Note: Replace "for loop" with standard memcpy if possible.
pred@2142: void MD5::memcpy (uint1 *output, uint1 *input, uint4 len){
pred@2142: 
pred@2142:   unsigned int i;
pred@2142: 
pred@2142:   for (i = 0; i < len; i++)
pred@2142:     output[i] = input[i];
pred@2142: }
pred@2142: 
pred@2142: 
pred@2142: 
pred@2142: // Note: Replace "for loop" with standard memset if possible.
pred@2142: void MD5::memset (uint1 *output, uint1 value, uint4 len){
pred@2142: 
pred@2142:   unsigned int i;
pred@2142: 
pred@2142:   for (i = 0; i < len; i++)
pred@2142:     output[i] = value;
pred@2142: }
pred@2142: 
pred@2142: 
pred@2142: 
pred@2142: // ROTATE_LEFT rotates x left n bits.
pred@2142: 
pred@2142: inline unsigned int MD5::rotate_left  (uint4 x, uint4 n){
pred@2142:   return (x << n) | (x >> (32-n))  ;
pred@2142: }
pred@2142: 
pred@2142: 
pred@2142: 
pred@2142: 
pred@2142: // F, G, H and I are basic MD5 functions.
pred@2142: 
pred@2142: inline unsigned int MD5::F            (uint4 x, uint4 y, uint4 z){
pred@2142:   return (x & y) | (~x & z);
pred@2142: }
pred@2142: 
pred@2142: inline unsigned int MD5::G            (uint4 x, uint4 y, uint4 z){
pred@2142:   return (x & z) | (y & ~z);
pred@2142: }
pred@2142: 
pred@2142: inline unsigned int MD5::H            (uint4 x, uint4 y, uint4 z){
pred@2142:   return x ^ y ^ z;
pred@2142: }
pred@2142: 
pred@2142: inline unsigned int MD5::I            (uint4 x, uint4 y, uint4 z){
pred@2142:   return y ^ (x | ~z);
pred@2142: }
pred@2142: 
pred@2142: 
pred@2142: 
pred@2142: // FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
pred@2142: // Rotation is separate from addition to prevent recomputation.
pred@2142: 
pred@2142: 
pred@2142: inline void MD5::FF(uint4& a, uint4 b, uint4 c, uint4 d, uint4 x, 
pred@2142: 		    uint4  s, uint4 ac){
pred@2142:  a += F(b, c, d) + x + ac;
pred@2142:  a = rotate_left (a, s) +b;
pred@2142: }
pred@2142: 
pred@2142: inline void MD5::GG(uint4& a, uint4 b, uint4 c, uint4 d, uint4 x, 
pred@2142: 		    uint4 s, uint4 ac){
pred@2142:  a += G(b, c, d) + x + ac;
pred@2142:  a = rotate_left (a, s) +b;
pred@2142: }
pred@2142: 
pred@2142: inline void MD5::HH(uint4& a, uint4 b, uint4 c, uint4 d, uint4 x, 
pred@2142: 		    uint4 s, uint4 ac){
pred@2142:  a += H(b, c, d) + x + ac;
pred@2142:  a = rotate_left (a, s) +b;
pred@2142: }
pred@2142: 
pred@2142: inline void MD5::II(uint4& a, uint4 b, uint4 c, uint4 d, uint4 x, 
pred@2142: 			     uint4 s, uint4 ac){
pred@2142:  a += I(b, c, d) + x + ac;
pred@2142:  a = rotate_left (a, s) +b;
pred@2142: }