Return to md5.c CVS log

Up to [PGP] / pgp / src

Annotation of pgp/src/md5.c, revision 1.1

1.1     ! root        1: /*
        !             2:  ***********************************************************************
        !             3:  ** md5.c -- the source code for MD5 routines                         **
        !             4:  ** RSA Data Security, Inc. MD5 Message-Digest Algorithm              **
        !             5:  ** Created: 2/17/90 RLR                                              **
        !             6:  ** Revised: 1/91 SRD,AJ,BSK,JT Reference C Version                   **
        !             7:  ***********************************************************************
        !             8:  */
        !             9: 
        !            10: /*
        !            11:  ***********************************************************************
        !            12:  ** Copyright (C) 1990, RSA Data Security, Inc. All rights reserved.  **
        !            13:  **                                                                   **
        !            14:  ** License to copy and use this software is granted provided that    **
        !            15:  ** it is identified as the "RSA Data Security, Inc. MD5 Message-     **
        !            16:  ** Digest Algorithm" in all material mentioning or referencing this  **
        !            17:  ** software or this function.                                        **
        !            18:  **                                                                   **
        !            19:  ** License is also granted to make and use derivative works          **
        !            20:  ** provided that such works are identified as "derived from the RSA  **
        !            21:  ** Data Security, Inc. MD5 Message-Digest Algorithm" in all          **
        !            22:  ** material mentioning or referencing the derived work.              **
        !            23:  **                                                                   **
        !            24:  ** RSA Data Security, Inc. makes no representations concerning       **
        !            25:  ** either the merchantability of this software or the suitability    **
        !            26:  ** of this software for any particular purpose.  It is provided "as  **
        !            27:  ** is" 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: #include "md5.h"
        !            35: 
        !            36: /*
        !            37:  ***********************************************************************
        !            38:  **  Message-digest routines:                                         **
        !            39:  **  To form the message digest for a message M                       **
        !            40:  **    (1) Initialize a context buffer mdContext using MD5Init        **
        !            41:  **    (2) Call MD5Update on mdContext and M                          **
        !            42:  **    (3) Call MD5Final on mdContext                                 **
        !            43:  **  The message digest is now in mdContext->digest[0...15]           **
        !            44:  ***********************************************************************
        !            45:  */
        !            46: 
        !            47: /* forward declaration */
        !            48: void Transform(UINT4 *buf,UINT4 *in);
        !            49: 
        !            50: static unsigned char PADDING[64] = {
        !            51:   0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
        !            52:   0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
        !            53:   0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
        !            54:   0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
        !            55:   0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
        !            56:   0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
        !            57:   0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
        !            58:   0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
        !            59: };
        !            60: 
        !            61: /* F, G, H and I are basic MD5 functions */
        !            62: #define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
        !            63: #define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
        !            64: #define H(x, y, z) ((x) ^ (y) ^ (z))
        !            65: #define I(x, y, z) ((y) ^ ((x) | (~z)))
        !            66: 
        !            67: /* ROTATE_LEFT rotates x left n bits */
        !            68: #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
        !            69: 
        !            70: /* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4 */
        !            71: /* Rotation is separate from addition to prevent recomputation */
        !            72: #define FF(a, b, c, d, x, s, ac) \
        !            73:   {(a) += F ((b), (c), (d)) + (x) + (UINT4)(ac); \
        !            74:    (a) = ROTATE_LEFT ((a), (s)); \
        !            75:    (a) += (b); \
        !            76:   }
        !            77: #define GG(a, b, c, d, x, s, ac) \
        !            78:   {(a) += G ((b), (c), (d)) + (x) + (UINT4)(ac); \
        !            79:    (a) = ROTATE_LEFT ((a), (s)); \
        !            80:    (a) += (b); \
        !            81:   }
        !            82: #define HH(a, b, c, d, x, s, ac) \
        !            83:   {(a) += H ((b), (c), (d)) + (x) + (UINT4)(ac); \
        !            84:    (a) = ROTATE_LEFT ((a), (s)); \
        !            85:    (a) += (b); \
        !            86:   }
        !            87: #define II(a, b, c, d, x, s, ac) \
        !            88:   {(a) += I ((b), (c), (d)) + (x) + (UINT4)(ac); \
        !            89:    (a) = ROTATE_LEFT ((a), (s)); \
        !            90:    (a) += (b); \
        !            91:   }
        !            92: 
        !            93: /* The routine MD5Init initializes the message-digest context
        !            94:    mdContext. All fields are set to zero.
        !            95:  */
        !            96: void MD5Init ( MD5_CTX *mdContext)
        !            97: {
        !            98:   mdContext->i[0] = mdContext->i[1] = (UINT4)0;
        !            99: 
        !           100:   /* Load magic initialization constants.
        !           101:    */
        !           102:   mdContext->buf[0] = (UINT4)0x67452301L;
        !           103:   mdContext->buf[1] = (UINT4)0xefcdab89L;
        !           104:   mdContext->buf[2] = (UINT4)0x98badcfeL;
        !           105:   mdContext->buf[3] = (UINT4)0x10325476L;
        !           106: }
        !           107: 
        !           108: /* The routine MD5Update updates the message-digest context to
        !           109:    account for the presence of each of the characters inBuf[0..inLen-1]
        !           110:    in the message whose digest is being computed.
        !           111:  */
        !           112: void MD5Update (register MD5_CTX *mdContext, unsigned char *inBuf,
        !           113:                 unsigned int inLen)
        !           114: {
        !           115:   register int i, ii;
        !           116:   int mdi;
        !           117:   UINT4 in[16];
        !           118: 
        !           119:   /* compute number of bytes mod 64 */
        !           120:   mdi = (int)((mdContext->i[0] >> 3) & 0x3F);
        !           121: 
        !           122:   /* update number of bits */
        !           123:   if ((mdContext->i[0] + ((UINT4)inLen << 3)) < mdContext->i[0])
        !           124:     mdContext->i[1]++;
        !           125:   mdContext->i[0] += ((UINT4)inLen << 3);
        !           126:   mdContext->i[1] += ((UINT4)inLen >> 29);
        !           127: 
        !           128:   while (inLen--) {
        !           129:     /* add new character to buffer, increment mdi */
        !           130:     mdContext->in[mdi++] = *inBuf++;
        !           131: 
        !           132:     /* transform if necessary */
        !           133:     if (mdi == 0x40) {
        !           134:       for (i = 0, ii = 0; i < 16; i++, ii += 4)
        !           135:         in[i] = (((UINT4)mdContext->in[ii+3]) << 24) |
        !           136:                 (((UINT4)mdContext->in[ii+2]) << 16) |
        !           137:                 (((UINT4)mdContext->in[ii+1]) << 8) |
        !           138:                 ((UINT4)mdContext->in[ii]);
        !           139:       Transform (mdContext->buf, in);
        !           140:       mdi = 0;
        !           141:     }
        !           142:   }
        !           143: }
        !           144: 
        !           145: /* The routine MD5Final terminates the message-digest computation and
        !           146:    ends with the desired message digest in mdContext->digest[0...15].
        !           147:  */
        !           148: void MD5Final (MD5_CTX *mdContext)
        !           149: {
        !           150:   UINT4 in[16];
        !           151:   int mdi;
        !           152:   unsigned int i, ii;
        !           153:   unsigned int padLen;
        !           154: 
        !           155:   /* save number of bits */
        !           156:   in[14] = mdContext->i[0];
        !           157:   in[15] = mdContext->i[1];
        !           158: 
        !           159:   /* compute number of bytes mod 64 */
        !           160:   mdi = (int)((mdContext->i[0] >> 3) & 0x3F);
        !           161: 
        !           162:   /* pad out to 56 mod 64 */
        !           163:   padLen = (mdi < 56) ? (56 - mdi) : (120 - mdi);
        !           164:   MD5Update (mdContext, PADDING, padLen);
        !           165: 
        !           166:   /* append length in bits and transform */
        !           167:   for (i = 0, ii = 0; i < 14; i++, ii += 4)
        !           168:     in[i] = (((UINT4)mdContext->in[ii+3]) << 24) |
        !           169:             (((UINT4)mdContext->in[ii+2]) << 16) |
        !           170:             (((UINT4)mdContext->in[ii+1]) << 8) |
        !           171:             ((UINT4)mdContext->in[ii]);
        !           172:   Transform (mdContext->buf, in);
        !           173: 
        !           174:   /* store buffer in digest */
        !           175:   for (i = 0, ii = 0; i < 4; i++, ii += 4) {
        !           176:     mdContext->digest[ii] = (unsigned char)(mdContext->buf[i] & 0xFF);
        !           177:     mdContext->digest[ii+1] =
        !           178:       (unsigned char)((mdContext->buf[i] >> 8) & 0xFF);
        !           179:     mdContext->digest[ii+2] =
        !           180:       (unsigned char)((mdContext->buf[i] >> 16) & 0xFF);
        !           181:     mdContext->digest[ii+3] =
        !           182:       (unsigned char)((mdContext->buf[i] >> 24) & 0xFF);
        !           183:   }
        !           184: }
        !           185: 
        !           186: /* Basic MD5 step. Transforms buf based on in.  Note that if the Mysterious
        !           187:    Constants are arranged backwards in little-endian order and decrypted with
        !           188:    the DES they produce OCCULT MESSAGES!
        !           189:  */
        !           190: void Transform(register UINT4 *buf,register UINT4 *in)
        !           191: {
        !           192:   register UINT4 a = buf[0], b = buf[1], c = buf[2], d = buf[3];
        !           193: 
        !           194:   /* Round 1 */
        !           195: #define S11 7
        !           196: #define S12 12
        !           197: #define S13 17
        !           198: #define S14 22
        !           199:   FF ( a, b, c, d, in[ 0], S11, 0xD76AA478L); /* 1 */
        !           200:   FF ( d, a, b, c, in[ 1], S12, 0xE8C7B756L); /* 2 */
        !           201:   FF ( c, d, a, b, in[ 2], S13, 0x242070DBL); /* 3 */
        !           202:   FF ( b, c, d, a, in[ 3], S14, 0xC1BDCEEEL); /* 4 */
        !           203:   FF ( a, b, c, d, in[ 4], S11, 0xF57C0FAFL); /* 5 */
        !           204:   FF ( d, a, b, c, in[ 5], S12, 0x4787C62AL); /* 6 */
        !           205:   FF ( c, d, a, b, in[ 6], S13, 0xA8304613L); /* 7 */
        !           206:   FF ( b, c, d, a, in[ 7], S14, 0xFD469501L); /* 8 */
        !           207:   FF ( a, b, c, d, in[ 8], S11, 0x698098D8L); /* 9 */
        !           208:   FF ( d, a, b, c, in[ 9], S12, 0x8B44F7AFL); /* 10 */
        !           209:   FF ( c, d, a, b, in[10], S13, 0xFFFF5BB1L); /* 11 */
        !           210:   FF ( b, c, d, a, in[11], S14, 0x895CD7BEL); /* 12 */
        !           211:   FF ( a, b, c, d, in[12], S11, 0x6B901122L); /* 13 */
        !           212:   FF ( d, a, b, c, in[13], S12, 0xFD987193L); /* 14 */
        !           213:   FF ( c, d, a, b, in[14], S13, 0xA679438EL); /* 15 */
        !           214:   FF ( b, c, d, a, in[15], S14, 0x49B40821L); /* 16 */
        !           215: 
        !           216:   /* Round 2 */
        !           217: #define S21 5
        !           218: #define S22 9
        !           219: #define S23 14
        !           220: #define S24 20
        !           221:   GG ( a, b, c, d, in[ 1], S21, 0xF61E2562L); /* 17 */
        !           222:   GG ( d, a, b, c, in[ 6], S22, 0xC040B340L); /* 18 */
        !           223:   GG ( c, d, a, b, in[11], S23, 0x265E5A51L); /* 19 */
        !           224:   GG ( b, c, d, a, in[ 0], S24, 0xE9B6C7AAL); /* 20 */
        !           225:   GG ( a, b, c, d, in[ 5], S21, 0xD62F105DL); /* 21 */
        !           226:   GG ( d, a, b, c, in[10], S22, 0x02441453L); /* 22 */
        !           227:   GG ( c, d, a, b, in[15], S23, 0xD8A1E681L); /* 23 */
        !           228:   GG ( b, c, d, a, in[ 4], S24, 0xE7D3FBC8L); /* 24 */
        !           229:   GG ( a, b, c, d, in[ 9], S21, 0x21E1CDE6L); /* 25 */
        !           230:   GG ( d, a, b, c, in[14], S22, 0xC33707D6L); /* 26 */
        !           231:   GG ( c, d, a, b, in[ 3], S23, 0xF4D50D87L); /* 27 */
        !           232:   GG ( b, c, d, a, in[ 8], S24, 0x455A14EDL); /* 28 */
        !           233:   GG ( a, b, c, d, in[13], S21, 0xA9E3E905L); /* 29 */
        !           234:   GG ( d, a, b, c, in[ 2], S22, 0xFCEFA3F8L); /* 30 */
        !           235:   GG ( c, d, a, b, in[ 7], S23, 0x676F02D9L); /* 31 */
        !           236:   GG ( b, c, d, a, in[12], S24, 0x8D2A4C8AL); /* 32 */
        !           237: 
        !           238:   /* Round 3 */
        !           239: #define S31 4
        !           240: #define S32 11
        !           241: #define S33 16
        !           242: #define S34 23
        !           243:   HH ( a, b, c, d, in[ 5], S31, 0xFFFA3942L); /* 33 */
        !           244:   HH ( d, a, b, c, in[ 8], S32, 0x8771F681L); /* 34 */
        !           245:   HH ( c, d, a, b, in[11], S33, 0x6D9D6122L); /* 35 */
        !           246:   HH ( b, c, d, a, in[14], S34, 0xFDE5380CL); /* 36 */
        !           247:   HH ( a, b, c, d, in[ 1], S31, 0xA4BEEA44L); /* 37 */
        !           248:   HH ( d, a, b, c, in[ 4], S32, 0x4BDECFA9L); /* 38 */
        !           249:   HH ( c, d, a, b, in[ 7], S33, 0xF6BB4B60L); /* 39 */
        !           250:   HH ( b, c, d, a, in[10], S34, 0xBEBFBC70L); /* 40 */
        !           251:   HH ( a, b, c, d, in[13], S31, 0x289B7EC6L); /* 41 */
        !           252:   HH ( d, a, b, c, in[ 0], S32, 0xEAA127FAL); /* 42 */
        !           253:   HH ( c, d, a, b, in[ 3], S33, 0xD4EF3085L); /* 43 */
        !           254:   HH ( b, c, d, a, in[ 6], S34, 0x04881D05L); /* 44 */
        !           255:   HH ( a, b, c, d, in[ 9], S31, 0xD9D4D039L); /* 45 */
        !           256:   HH ( d, a, b, c, in[12], S32, 0xE6DB99E5L); /* 46 */
        !           257:   HH ( c, d, a, b, in[15], S33, 0x1FA27CF8L); /* 47 */
        !           258:   HH ( b, c, d, a, in[ 2], S34, 0xC4AC5665L); /* 48 */
        !           259: 
        !           260:   /* Round 4 */
        !           261: #define S41 6
        !           262: #define S42 10
        !           263: #define S43 15
        !           264: #define S44 21
        !           265:   II ( a, b, c, d, in[ 0], S41, 0xF4292244L); /* 49 */
        !           266:   II ( d, a, b, c, in[ 7], S42, 0x432AFF97L); /* 50 */
        !           267:   II ( c, d, a, b, in[14], S43, 0xAB9423A7L); /* 51 */
        !           268:   II ( b, c, d, a, in[ 5], S44, 0xFC93A039L); /* 52 */
        !           269:   II ( a, b, c, d, in[12], S41, 0x655B59C3L); /* 53 */
        !           270:   II ( d, a, b, c, in[ 3], S42, 0x8F0CCC92L); /* 54 */
        !           271:   II ( c, d, a, b, in[10], S43, 0xFFEFF47DL); /* 55 */
        !           272:   II ( b, c, d, a, in[ 1], S44, 0x85845DD1L); /* 56 */
        !           273:   II ( a, b, c, d, in[ 8], S41, 0x6FA87E4FL); /* 57 */
        !           274:   II ( d, a, b, c, in[15], S42, 0xFE2CE6E0L); /* 58 */
        !           275:   II ( c, d, a, b, in[ 6], S43, 0xA3014314L); /* 59 */
        !           276:   II ( b, c, d, a, in[13], S44, 0x4E0811A1L); /* 60 */
        !           277:   II ( a, b, c, d, in[ 4], S41, 0xF7537E82L); /* 61 */
        !           278:   II ( d, a, b, c, in[11], S42, 0xBD3AF235L); /* 62 */
        !           279:   II ( c, d, a, b, in[ 2], S43, 0x2AD7D2BBL); /* 63 */
        !           280:   II ( b, c, d, a, in[ 9], S44, 0xEB86D391L); /* 64 */
        !           281: 
        !           282:   buf[0] += a;
        !           283:   buf[1] += b;
        !           284:   buf[2] += c;
        !           285:   buf[3] += d;
        !           286: }
        !           287: 

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.