crypto/md5/md5_dgst.c

   1 /* crypto/md5/md5_dgst.c */
   2 /* Copyright (C) 1995-1998 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 OpenSSL 0.9.2 31-Dec-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 #  ifdef MD5_ASM
  74      void md5_block_x86(MD5_CTX *c, unsigned long *p,int num);
  75 #    define md5_block md5_block_x86
  76 #  else
  77      static void md5_block(MD5_CTX *c, unsigned long *p,int num);
  78 #  endif
  79 #else
  80 #  ifdef MD5_ASM
  81      void md5_block_x86();
  82 #    define md5_block md5_block_x86
  83 #  else
  84      static void md5_block();
  85 #  endif
  86 #endif
  87
  88 void MD5_Init(c)
  89 MD5_CTX *c;
  90         {
  91         c->A=INIT_DATA_A;
  92         c->B=INIT_DATA_B;
  93         c->C=INIT_DATA_C;
  94         c->D=INIT_DATA_D;
  95         c->Nl=0;
  96         c->Nh=0;
  97         c->num=0;
  98         }
  99
 100 void MD5_Update(c, _data, len)
 101 MD5_CTX *c;
 102 const void *_data;
 103 unsigned long len;
 104         {
 105         register const unsigned char *data=_data;
 106         register ULONG *p;
 107         int sw,sc;
 108         ULONG l;
 109
 110         if (len == 0) return;
 111
 112         l=(c->Nl+(len<<3))&0xffffffffL;
 113         /* 95-05-24 eay Fixed a bug with the overflow handling, thanks to
 114          * Wei Dai <weidai@eskimo.com> for pointing it out. */
 115         if (l < c->Nl) /* overflow */
 116                 c->Nh++;
 117         c->Nh+=(len>>29);
 118         c->Nl=l;
 119
 120         if (c->num != 0)
 121                 {
 122                 p=c->data;
 123                 sw=c->num>>2;
 124                 sc=c->num&0x03;
 125
 126                 if ((c->num+len) >= MD5_CBLOCK)
 127                         {
 128                         l= p[sw];
 129                         p_c2l(data,l,sc);
 130                         p[sw++]=l;
 131                         for (; sw<MD5_LBLOCK; sw++)
 132                                 {
 133                                 c2l(data,l);
 134                                 p[sw]=l;
 135                                 }
 136                         len-=(MD5_CBLOCK-c->num);
 137
 138                         md5_block(c,p,64);
 139                         c->num=0;
 140                         /* drop through and do the rest */
 141                         }
 142                 else
 143                         {
 144                         int ew,ec;
 145
 146                         c->num+=(int)len;
 147                         if ((sc+len) < 4) /* ugly, add char's to a word */
 148                                 {
 149                                 l= p[sw];
 150                                 p_c2l_p(data,l,sc,len);
 151                                 p[sw]=l;
 152                                 }
 153                         else
 154                                 {
 155                                 ew=(c->num>>2);
 156                                 ec=(c->num&0x03);
 157                                 l= p[sw];
 158                                 p_c2l(data,l,sc);
 159                                 p[sw++]=l;
 160                                 for (; sw < ew; sw++)
 161                                         { c2l(data,l); p[sw]=l; }
 162                                 if (ec)
 163                                         {
 164                                         c2l_p(data,l,ec);
 165                                         p[sw]=l;
 166                                         }
 167                                 }
 168                         return;
 169                         }
 170                 }
 171         /* we now can process the input data in blocks of MD5_CBLOCK
 172          * chars and save the leftovers to c->data. */
 173 #ifdef L_ENDIAN
 174         if ((((unsigned long)data)%sizeof(ULONG)) == 0)
 175                 {
 176                 sw=(int)len/MD5_CBLOCK;
 177                 if (sw > 0)
 178                         {
 179                         sw*=MD5_CBLOCK;
 180                         md5_block(c,(ULONG *)data,sw);
 181                         data+=sw;
 182                         len-=sw;
 183                         }
 184                 }
 185 #endif
 186         p=c->data;
 187         while (len >= MD5_CBLOCK)
 188                 {
 189 #if defined(L_ENDIAN) || defined(B_ENDIAN)
 190                 if (p != (unsigned long *)data)
 191                         memcpy(p,data,MD5_CBLOCK);
 192                 data+=MD5_CBLOCK;
 193 #ifdef B_ENDIAN
 194                 for (sw=(MD5_LBLOCK/4); sw; sw--)
 195                         {
 196                         Endian_Reverse32(p[0]);
 197                         Endian_Reverse32(p[1]);
 198                         Endian_Reverse32(p[2]);
 199                         Endian_Reverse32(p[3]);
 200                         p+=4;
 201                         }
 202 #endif
 203 #else
 204                 for (sw=(MD5_LBLOCK/4); sw; sw--)
 205                         {
 206                         c2l(data,l); *(p++)=l;
 207                         c2l(data,l); *(p++)=l;
 208                         c2l(data,l); *(p++)=l;
 209                         c2l(data,l); *(p++)=l;
 210                         }
 211 #endif
 212                 p=c->data;
 213                 md5_block(c,p,64);
 214                 len-=MD5_CBLOCK;
 215                 }
 216         sc=(int)len;
 217         c->num=sc;
 218         if (sc)
 219                 {
 220                 sw=sc>>2;       /* words to copy */
 221 #ifdef L_ENDIAN
 222                 p[sw]=0;
 223                 memcpy(p,data,sc);
 224 #else
 225                 sc&=0x03;
 226                 for ( ; sw; sw--)
 227                         { c2l(data,l); *(p++)=l; }
 228                 c2l_p(data,l,sc);
 229                 *p=l;
 230 #endif
 231                 }
 232         }
 233
 234 void MD5_Transform(c,b)
 235 MD5_CTX *c;
 236 unsigned char *b;
 237         {
 238         ULONG p[16];
 239 #if !defined(L_ENDIAN)
 240         ULONG *q;
 241         int i;
 242 #endif
 243
 244 #if defined(B_ENDIAN) || defined(L_ENDIAN)
 245         memcpy(p,b,64);
 246 #ifdef B_ENDIAN
 247         q=p;
 248         for (i=(MD5_LBLOCK/4); i; i--)
 249                 {
 250                 Endian_Reverse32(q[0]);
 251                 Endian_Reverse32(q[1]);
 252                 Endian_Reverse32(q[2]);
 253                 Endian_Reverse32(q[3]);
 254                 q+=4;
 255                 }
 256 #endif
 257 #else
 258         q=p;
 259         for (i=(MD5_LBLOCK/4); i; i--)
 260                 {
 261                 ULONG l;
 262                 c2l(b,l); *(q++)=l;
 263                 c2l(b,l); *(q++)=l;
 264                 c2l(b,l); *(q++)=l;
 265                 c2l(b,l); *(q++)=l;
 266                 }
 267 #endif
 268         md5_block(c,p,64);
 269         }
 270
 271 #ifndef MD5_ASM
 272
 273 static void md5_block(c, X, num)
 274 MD5_CTX *c;
 275 register ULONG *X;
 276 int num;
 277         {
 278         register ULONG A,B,C,D;
 279
 280         A=c->A;
 281         B=c->B;
 282         C=c->C;
 283         D=c->D;
 284         for (;;)
 285                 {
 286         /* Round 0 */
 287         R0(A,B,C,D,X[ 0], 7,0xd76aa478L);
 288         R0(D,A,B,C,X[ 1],12,0xe8c7b756L);
 289         R0(C,D,A,B,X[ 2],17,0x242070dbL);
 290         R0(B,C,D,A,X[ 3],22,0xc1bdceeeL);
 291         R0(A,B,C,D,X[ 4], 7,0xf57c0fafL);
 292         R0(D,A,B,C,X[ 5],12,0x4787c62aL);
 293         R0(C,D,A,B,X[ 6],17,0xa8304613L);
 294         R0(B,C,D,A,X[ 7],22,0xfd469501L);
 295         R0(A,B,C,D,X[ 8], 7,0x698098d8L);
 296         R0(D,A,B,C,X[ 9],12,0x8b44f7afL);
 297         R0(C,D,A,B,X[10],17,0xffff5bb1L);
 298         R0(B,C,D,A,X[11],22,0x895cd7beL);
 299         R0(A,B,C,D,X[12], 7,0x6b901122L);
 300         R0(D,A,B,C,X[13],12,0xfd987193L);
 301         R0(C,D,A,B,X[14],17,0xa679438eL);
 302         R0(B,C,D,A,X[15],22,0x49b40821L);
 303         /* Round 1 */
 304         R1(A,B,C,D,X[ 1], 5,0xf61e2562L);
 305         R1(D,A,B,C,X[ 6], 9,0xc040b340L);
 306         R1(C,D,A,B,X[11],14,0x265e5a51L);
 307         R1(B,C,D,A,X[ 0],20,0xe9b6c7aaL);
 308         R1(A,B,C,D,X[ 5], 5,0xd62f105dL);
 309         R1(D,A,B,C,X[10], 9,0x02441453L);
 310         R1(C,D,A,B,X[15],14,0xd8a1e681L);
 311         R1(B,C,D,A,X[ 4],20,0xe7d3fbc8L);
 312         R1(A,B,C,D,X[ 9], 5,0x21e1cde6L);
 313         R1(D,A,B,C,X[14], 9,0xc33707d6L);
 314         R1(C,D,A,B,X[ 3],14,0xf4d50d87L);
 315         R1(B,C,D,A,X[ 8],20,0x455a14edL);
 316         R1(A,B,C,D,X[13], 5,0xa9e3e905L);
 317         R1(D,A,B,C,X[ 2], 9,0xfcefa3f8L);
 318         R1(C,D,A,B,X[ 7],14,0x676f02d9L);
 319         R1(B,C,D,A,X[12],20,0x8d2a4c8aL);
 320         /* Round 2 */
 321         R2(A,B,C,D,X[ 5], 4,0xfffa3942L);
 322         R2(D,A,B,C,X[ 8],11,0x8771f681L);
 323         R2(C,D,A,B,X[11],16,0x6d9d6122L);
 324         R2(B,C,D,A,X[14],23,0xfde5380cL);
 325         R2(A,B,C,D,X[ 1], 4,0xa4beea44L);
 326         R2(D,A,B,C,X[ 4],11,0x4bdecfa9L);
 327         R2(C,D,A,B,X[ 7],16,0xf6bb4b60L);
 328         R2(B,C,D,A,X[10],23,0xbebfbc70L);
 329         R2(A,B,C,D,X[13], 4,0x289b7ec6L);
 330         R2(D,A,B,C,X[ 0],11,0xeaa127faL);
 331         R2(C,D,A,B,X[ 3],16,0xd4ef3085L);
 332         R2(B,C,D,A,X[ 6],23,0x04881d05L);
 333         R2(A,B,C,D,X[ 9], 4,0xd9d4d039L);
 334         R2(D,A,B,C,X[12],11,0xe6db99e5L);
 335         R2(C,D,A,B,X[15],16,0x1fa27cf8L);
 336         R2(B,C,D,A,X[ 2],23,0xc4ac5665L);
 337         /* Round 3 */
 338         R3(A,B,C,D,X[ 0], 6,0xf4292244L);
 339         R3(D,A,B,C,X[ 7],10,0x432aff97L);
 340         R3(C,D,A,B,X[14],15,0xab9423a7L);
 341         R3(B,C,D,A,X[ 5],21,0xfc93a039L);
 342         R3(A,B,C,D,X[12], 6,0x655b59c3L);
 343         R3(D,A,B,C,X[ 3],10,0x8f0ccc92L);
 344         R3(C,D,A,B,X[10],15,0xffeff47dL);
 345         R3(B,C,D,A,X[ 1],21,0x85845dd1L);
 346         R3(A,B,C,D,X[ 8], 6,0x6fa87e4fL);
 347         R3(D,A,B,C,X[15],10,0xfe2ce6e0L);
 348         R3(C,D,A,B,X[ 6],15,0xa3014314L);
 349         R3(B,C,D,A,X[13],21,0x4e0811a1L);
 350         R3(A,B,C,D,X[ 4], 6,0xf7537e82L);
 351         R3(D,A,B,C,X[11],10,0xbd3af235L);
 352         R3(C,D,A,B,X[ 2],15,0x2ad7d2bbL);
 353         R3(B,C,D,A,X[ 9],21,0xeb86d391L);
 354
 355         A+=c->A&0xffffffffL;
 356         B+=c->B&0xffffffffL;
 357         c->A=A;
 358         c->B=B;
 359         C+=c->C&0xffffffffL;
 360         D+=c->D&0xffffffffL;
 361         c->C=C;
 362         c->D=D;
 363         X+=16;
 364         num-=64;
 365         if (num <= 0) break;
 366                 }
 367         }
 368 #endif
 369
 370 void MD5_Final(md, c)
 371 unsigned char *md;
 372 MD5_CTX *c;
 373         {
 374         register int i,j;
 375         register ULONG l;
 376         register ULONG *p;
 377         static unsigned char end[4]={0x80,0x00,0x00,0x00};
 378         unsigned char *cp=end;
 379
 380         /* c->num should definitly have room for at least one more byte. */
 381         p=c->data;
 382         j=c->num;
 383         i=j>>2;
 384
 385         /* purify often complains about the following line as an
 386          * Uninitialized Memory Read.  While this can be true, the
 387          * following p_c2l macro will reset l when that case is true.
 388          * This is because j&0x03 contains the number of 'valid' bytes
 389          * already in p[i].  If and only if j&0x03 == 0, the UMR will
 390          * occur but this is also the only time p_c2l will do
 391          * l= *(cp++) instead of l|= *(cp++)
 392          * Many thanks to Alex Tang <altitude@cic.net> for pickup this
 393          * 'potential bug' */
 394 #ifdef PURIFY
 395         if ((j&0x03) == 0) p[i]=0;
 396 #endif
 397         l=p[i];
 398         p_c2l(cp,l,j&0x03);
 399         p[i]=l;
 400         i++;
 401         /* i is the next 'undefined word' */
 402         if (c->num >= MD5_LAST_BLOCK)
 403                 {
 404                 for (; i<MD5_LBLOCK; i++)
 405                         p[i]=0;
 406                 md5_block(c,p,64);
 407                 i=0;
 408                 }
 409         for (; i<(MD5_LBLOCK-2); i++)
 410                 p[i]=0;
 411         p[MD5_LBLOCK-2]=c->Nl;
 412         p[MD5_LBLOCK-1]=c->Nh;
 413         md5_block(c,p,64);
 414         cp=md;
 415         l=c->A; l2c(l,cp);
 416         l=c->B; l2c(l,cp);
 417         l=c->C; l2c(l,cp);
 418         l=c->D; l2c(l,cp);
 419
 420         /* clear stuff, md5_block may be leaving some stuff on the stack
 421          * but I'm not worried :-) */
 422         c->num=0;
 423 /*      memset((char *)&c,0,sizeof(c));*/
 424         }
 425
 426 #ifdef undef
 427 int printit(l)
 428 unsigned long *l;
 429         {
 430         int i,ii;
 431
 432         for (i=0; i<2; i++)
 433                 {
 434                 for (ii=0; ii<8; ii++)
 435                         {
 436                         fprintf(stderr,"%08lx ",l[i*8+ii]);
 437                         }
 438                 fprintf(stderr,"\n");
 439                 }
 440         }
 441 #endif