crypto/md/md5_dgst.c

   1 /* crypto/md/md5_dgst.c */
   2 /* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com)
   3  * All rights reserved.
   4  *
   5  * This package is an SSL implementation written
   6  * by Eric Young (eay@cryptsoft.com).
   7  * The implementation was written so as to conform with Netscapes SSL.
   8  *
   9  * This library is free for commercial and non-commercial use as long as
  10  * the following conditions are aheared to.  The following conditions
  11  * apply to all code found in this distribution, be it the RC4, RSA,
  12  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
  13  * included with this distribution is covered by the same copyright terms
  14  * except that the holder is Tim Hudson (tjh@cryptsoft.com).
  15  *
  16  * Copyright remains Eric Young's, and as such any Copyright notices in
  17  * the code are not to be removed.
  18  * If this package is used in a product, Eric Young should be given attribution
  19  * as the author of the parts of the library used.
  20  * This can be in the form of a textual message at program startup or
  21  * in documentation (online or textual) provided with the package.
  22  *
  23  * Redistribution and use in source and binary forms, with or without
  24  * modification, are permitted provided that the following conditions
  25  * are met:
  26  * 1. Redistributions of source code must retain the copyright
  27  *    notice, this list of conditions and the following disclaimer.
  28  * 2. Redistributions in binary form must reproduce the above copyright
  29  *    notice, this list of conditions and the following disclaimer in the
  30  *    documentation and/or other materials provided with the distribution.
  31  * 3. All advertising materials mentioning features or use of this software
  32  *    must display the following acknowledgement:
  33  *    "This product includes cryptographic software written by
  34  *     Eric Young (eay@cryptsoft.com)"
  35  *    The word 'cryptographic' can be left out if the rouines from the library
  36  *    being used are not cryptographic related :-).
  37  * 4. If you include any Windows specific code (or a derivative thereof) from
  38  *    the apps directory (application code) you must include an acknowledgement:
  39  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
  40  *
  41  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
  42  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  43  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  44  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  45  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  46  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  47  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  48  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  49  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  50  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  51  * SUCH DAMAGE.
  52  *
  53  * The licence and distribution terms for any publically available version or
  54  * derivative of this code cannot be changed.  i.e. this code cannot simply be
  55  * copied and put under another distribution licence
  56  * [including the GNU Public Licence.]
  57  */
  58
  59 #include <stdio.h>
  60 #include "md5_locl.h"
  61
  62 char *MD5_version="MD5 part of SSLeay 0.8.1b 29-Jun-1998";
  63
  64 /* Implemented from RFC1321 The MD5 Message-Digest Algorithm
  65  */
  66
  67 #define INIT_DATA_A (unsigned long)0x67452301L
  68 #define INIT_DATA_B (unsigned long)0xefcdab89L
  69 #define INIT_DATA_C (unsigned long)0x98badcfeL
  70 #define INIT_DATA_D (unsigned long)0x10325476L
  71
  72 #ifndef NOPROTO
  73 static void md5_block(MD5_CTX *c, unsigned long *p);
  74 #else
  75 static void md5_block();
  76 #endif
  77
  78 void MD5_Init(c)
  79 MD5_CTX *c;
  80         {
  81         c->A=INIT_DATA_A;
  82         c->B=INIT_DATA_B;
  83         c->C=INIT_DATA_C;
  84         c->D=INIT_DATA_D;
  85         c->Nl=0;
  86         c->Nh=0;
  87         c->num=0;
  88         }
  89
  90 void MD5_Update(c, data, len)
  91 MD5_CTX *c;
  92 register unsigned char *data;
  93 unsigned long len;
  94         {
  95         register ULONG *p;
  96         int sw,sc;
  97         ULONG l;
  98
  99         if (len == 0) return;
 100
 101         l=(c->Nl+(len<<3))&0xffffffffL;
 102         /* 95-05-24 eay Fixed a bug with the overflow handling, thanks to
 103          * Wei Dai <weidai@eskimo.com> for pointing it out. */
 104         if (l < c->Nl) /* overflow */
 105                 c->Nh++;
 106         c->Nh+=(len>>29);
 107         c->Nl=l;
 108
 109         if (c->num != 0)
 110                 {
 111                 p=c->data;
 112                 sw=c->num>>2;
 113                 sc=c->num&0x03;
 114
 115                 if ((c->num+len) >= MD5_CBLOCK)
 116                         {
 117                         l= p[sw];
 118                         p_c2l(data,l,sc);
 119                         p[sw++]=l;
 120                         for (; sw<MD5_LBLOCK; sw++)
 121                                 {
 122                                 c2l(data,l);
 123                                 p[sw]=l;
 124                                 }
 125                         len-=(MD5_CBLOCK-c->num);
 126
 127                         md5_block(c,p);
 128                         c->num=0;
 129                         /* drop through and do the rest */
 130                         }
 131                 else
 132                         {
 133                         int ew,ec;
 134
 135                         c->num+=(int)len;
 136                         if ((sc+len) < 4) /* ugly, add char's to a word */
 137                                 {
 138                                 l= p[sw];
 139                                 p_c2l_p(data,l,sc,len);
 140                                 p[sw]=l;
 141                                 }
 142                         else
 143                                 {
 144                                 ew=(c->num>>2);
 145                                 ec=(c->num&0x03);
 146                                 l= p[sw];
 147                                 p_c2l(data,l,sc);
 148                                 p[sw++]=l;
 149                                 for (; sw < ew; sw++)
 150                                         { c2l(data,l); p[sw]=l; }
 151                                 if (ec)
 152                                         {
 153                                         c2l_p(data,l,ec);
 154                                         p[sw]=l;
 155                                         }
 156                                 }
 157                         return;
 158                         }
 159                 }
 160         /* we now can process the input data in blocks of MD5_CBLOCK
 161          * chars and save the leftovers to c->data. */
 162         p=c->data;
 163         while (len >= MD5_CBLOCK)
 164                 {
 165 #if defined(L_ENDIAN) || defined(B_ENDIAN)
 166                 memcpy(p,data,MD5_CBLOCK);
 167                 data+=MD5_CBLOCK;
 168 #ifdef B_ENDIAN
 169                 for (sw=(MD5_LBLOCK/4); sw; sw--)
 170                         {
 171                         Endian_Reverse32(p[0]);
 172                         Endian_Reverse32(p[1]);
 173                         Endian_Reverse32(p[2]);
 174                         Endian_Reverse32(p[3]);
 175                         p+=4;
 176                         }
 177 #endif
 178 #else
 179                 for (sw=(MD5_LBLOCK/4); sw; sw--)
 180                         {
 181                         c2l(data,l); *(p++)=l;
 182                         c2l(data,l); *(p++)=l;
 183                         c2l(data,l); *(p++)=l;
 184                         c2l(data,l); *(p++)=l;
 185                         }
 186 #endif
 187                 p=c->data;
 188                 md5_block(c,p);
 189                 len-=MD5_CBLOCK;
 190                 }
 191         sc=(int)len;
 192         c->num=sc;
 193         if (sc)
 194                 {
 195                 sw=sc>>2;       /* words to copy */
 196 #ifdef L_ENDIAN
 197                 p[sw]=0;
 198                 memcpy(p,data,sc);
 199 #else
 200                 sc&=0x03;
 201                 for ( ; sw; sw--)
 202                         { c2l(data,l); *(p++)=l; }
 203                 c2l_p(data,l,sc);
 204                 *p=l;
 205 #endif
 206                 }
 207         }
 208
 209 static void md5_block(c, X)
 210 MD5_CTX *c;
 211 register ULONG *X;
 212         {
 213         register ULONG A,B,C,D;
 214
 215         A=c->A;
 216         B=c->B;
 217         C=c->C;
 218         D=c->D;
 219
 220         /* Round 0 */
 221         R0(A,B,C,D,X[ 0], 7,0xd76aa478L);
 222         R0(D,A,B,C,X[ 1],12,0xe8c7b756L);
 223         R0(C,D,A,B,X[ 2],17,0x242070dbL);
 224         R0(B,C,D,A,X[ 3],22,0xc1bdceeeL);
 225         R0(A,B,C,D,X[ 4], 7,0xf57c0fafL);
 226         R0(D,A,B,C,X[ 5],12,0x4787c62aL);
 227         R0(C,D,A,B,X[ 6],17,0xa8304613L);
 228         R0(B,C,D,A,X[ 7],22,0xfd469501L);
 229         R0(A,B,C,D,X[ 8], 7,0x698098d8L);
 230         R0(D,A,B,C,X[ 9],12,0x8b44f7afL);
 231         R0(C,D,A,B,X[10],17,0xffff5bb1L);
 232         R0(B,C,D,A,X[11],22,0x895cd7beL);
 233         R0(A,B,C,D,X[12], 7,0x6b901122L);
 234         R0(D,A,B,C,X[13],12,0xfd987193L);
 235         R0(C,D,A,B,X[14],17,0xa679438eL);
 236         R0(B,C,D,A,X[15],22,0x49b40821L);
 237         /* Round 1 */
 238         R1(A,B,C,D,X[ 1], 5,0xf61e2562L);
 239         R1(D,A,B,C,X[ 6], 9,0xc040b340L);
 240         R1(C,D,A,B,X[11],14,0x265e5a51L);
 241         R1(B,C,D,A,X[ 0],20,0xe9b6c7aaL);
 242         R1(A,B,C,D,X[ 5], 5,0xd62f105dL);
 243         R1(D,A,B,C,X[10], 9,0x02441453L);
 244         R1(C,D,A,B,X[15],14,0xd8a1e681L);
 245         R1(B,C,D,A,X[ 4],20,0xe7d3fbc8L);
 246         R1(A,B,C,D,X[ 9], 5,0x21e1cde6L);
 247         R1(D,A,B,C,X[14], 9,0xc33707d6L);
 248         R1(C,D,A,B,X[ 3],14,0xf4d50d87L);
 249         R1(B,C,D,A,X[ 8],20,0x455a14edL);
 250         R1(A,B,C,D,X[13], 5,0xa9e3e905L);
 251         R1(D,A,B,C,X[ 2], 9,0xfcefa3f8L);
 252         R1(C,D,A,B,X[ 7],14,0x676f02d9L);
 253         R1(B,C,D,A,X[12],20,0x8d2a4c8aL);
 254         /* Round 2 */
 255         R2(A,B,C,D,X[ 5], 4,0xfffa3942L);
 256         R2(D,A,B,C,X[ 8],11,0x8771f681L);
 257         R2(C,D,A,B,X[11],16,0x6d9d6122L);
 258         R2(B,C,D,A,X[14],23,0xfde5380cL);
 259         R2(A,B,C,D,X[ 1], 4,0xa4beea44L);
 260         R2(D,A,B,C,X[ 4],11,0x4bdecfa9L);
 261         R2(C,D,A,B,X[ 7],16,0xf6bb4b60L);
 262         R2(B,C,D,A,X[10],23,0xbebfbc70L);
 263         R2(A,B,C,D,X[13], 4,0x289b7ec6L);
 264         R2(D,A,B,C,X[ 0],11,0xeaa127faL);
 265         R2(C,D,A,B,X[ 3],16,0xd4ef3085L);
 266         R2(B,C,D,A,X[ 6],23,0x04881d05L);
 267         R2(A,B,C,D,X[ 9], 4,0xd9d4d039L);
 268         R2(D,A,B,C,X[12],11,0xe6db99e5L);
 269         R2(C,D,A,B,X[15],16,0x1fa27cf8L);
 270         R2(B,C,D,A,X[ 2],23,0xc4ac5665L);
 271         /* Round 3 */
 272         R3(A,B,C,D,X[ 0], 6,0xf4292244L);
 273         R3(D,A,B,C,X[ 7],10,0x432aff97L);
 274         R3(C,D,A,B,X[14],15,0xab9423a7L);
 275         R3(B,C,D,A,X[ 5],21,0xfc93a039L);
 276         R3(A,B,C,D,X[12], 6,0x655b59c3L);
 277         R3(D,A,B,C,X[ 3],10,0x8f0ccc92L);
 278         R3(C,D,A,B,X[10],15,0xffeff47dL);
 279         R3(B,C,D,A,X[ 1],21,0x85845dd1L);
 280         R3(A,B,C,D,X[ 8], 6,0x6fa87e4fL);
 281         R3(D,A,B,C,X[15],10,0xfe2ce6e0L);
 282         R3(C,D,A,B,X[ 6],15,0xa3014314L);
 283         R3(B,C,D,A,X[13],21,0x4e0811a1L);
 284         R3(A,B,C,D,X[ 4], 6,0xf7537e82L);
 285         R3(D,A,B,C,X[11],10,0xbd3af235L);
 286         R3(C,D,A,B,X[ 2],15,0x2ad7d2bbL);
 287         R3(B,C,D,A,X[ 9],21,0xeb86d391L);
 288
 289         c->A+=A&0xffffffffL;
 290         c->B+=B&0xffffffffL;
 291         c->C+=C&0xffffffffL;
 292         c->D+=D&0xffffffffL;
 293         }
 294
 295 void MD5_Final(md, c)
 296 unsigned char *md;
 297 MD5_CTX *c;
 298         {
 299         register int i,j;
 300         register ULONG l;
 301         register ULONG *p;
 302         static unsigned char end[4]={0x80,0x00,0x00,0x00};
 303         unsigned char *cp=end;
 304
 305         /* c->num should definitly have room for at least one more byte. */
 306         p=c->data;
 307         j=c->num;
 308         i=j>>2;
 309
 310         /* purify often complains about the following line as an
 311          * Uninitialized Memory Read.  While this can be true, the
 312          * following p_c2l macro will reset l when that case is true.
 313          * This is because j&0x03 contains the number of 'valid' bytes
 314          * already in p[i].  If and only if j&0x03 == 0, the UMR will
 315          * occur but this is also the only time p_c2l will do
 316          * l= *(cp++) instead of l|= *(cp++)
 317          * Many thanks to Alex Tang <altitude@cic.net> for pickup this
 318          * 'potential bug' */
 319 #ifdef PURIFY
 320         if ((j&0x03) == 0) p[i]=0;
 321 #endif
 322         l=p[i];
 323         p_c2l(cp,l,j&0x03);
 324         p[i]=l;
 325         i++;
 326         /* i is the next 'undefined word' */
 327         if (c->num >= MD5_LAST_BLOCK)
 328                 {
 329                 for (; i<MD5_LBLOCK; i++)
 330                         p[i]=0;
 331                 md5_block(c,p);
 332                 i=0;
 333                 }
 334         for (; i<(MD5_LBLOCK-2); i++)
 335                 p[i]=0;
 336         p[MD5_LBLOCK-2]=c->Nl;
 337         p[MD5_LBLOCK-1]=c->Nh;
 338         md5_block(c,p);
 339         cp=md;
 340         l=c->A; l2c(l,cp);
 341         l=c->B; l2c(l,cp);
 342         l=c->C; l2c(l,cp);
 343         l=c->D; l2c(l,cp);
 344
 345         /* clear stuff, md5_block may be leaving some stuff on the stack
 346          * but I'm not worried :-) */
 347         c->num=0;
 348 /*      memset((char *)&c,0,sizeof(c));*/
 349         }
 350
 351 #ifdef undef
 352 int printit(l)
 353 unsigned long *l;
 354         {
 355         int i,ii;
 356
 357         for (i=0; i<2; i++)
 358                 {
 359                 for (ii=0; ii<8; ii++)
 360                         {
 361                         fprintf(stderr,"%08lx ",l[i*8+ii]);
 362                         }
 363                 fprintf(stderr,"\n");
 364                 }
 365         }
 366 #endif