lib/md5.c

   1 /*
   2  * RFC 1321 compliant MD5 implementation
   3  *
   4  * Copyright (C) 2001-2003 Christophe Devine
   5  * Copyright (C) 2007-2022 Wayne Davison
   6  *
   7  * This program is free software; you can redistribute it and/or modify
   8  * it under the terms of the GNU General Public License as published by
   9  * the Free Software Foundation; either version 3 of the License, or
  10  * (at your option) any later version.
  11  *
  12  * This program is distributed in the hope that it will be useful,
  13  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15  * GNU General Public License for more details.
  16  *
  17  * You should have received a copy of the GNU General Public License along
  18  * with this program; if not, visit the http://fsf.org website.
  19  */
  20
  21 #include "rsync.h"
  22
  23 void md5_begin(md_context *ctx)
  24 {
  25         ctx->A = 0x67452301;
  26         ctx->B = 0xEFCDAB89;
  27         ctx->C = 0x98BADCFE;
  28         ctx->D = 0x10325476;
  29
  30         ctx->totalN = ctx->totalN2 = 0;
  31 }
  32
  33 static void md5_process(md_context *ctx, const uchar data[CSUM_CHUNK])
  34 {
  35         uint32 X[16], A, B, C, D;
  36
  37         A = ctx->A;
  38         B = ctx->B;
  39         C = ctx->C;
  40         D = ctx->D;
  41
  42         X[0] = IVALu(data, 0);
  43         X[1] = IVALu(data, 4);
  44         X[2] = IVALu(data, 8);
  45         X[3] = IVALu(data, 12);
  46         X[4] = IVALu(data, 16);
  47         X[5] = IVALu(data, 20);
  48         X[6] = IVALu(data, 24);
  49         X[7] = IVALu(data, 28);
  50         X[8] = IVALu(data, 32);
  51         X[9] = IVALu(data, 36);
  52         X[10] = IVALu(data, 40);
  53         X[11] = IVALu(data, 44);
  54         X[12] = IVALu(data, 48);
  55         X[13] = IVALu(data, 52);
  56         X[14] = IVALu(data, 56);
  57         X[15] = IVALu(data, 60);
  58
  59 #define S(x,n) ((x << n) | ((x & 0xFFFFFFFF) >> (32 - n)))
  60
  61 #define P(a,b,c,d,k,s,t) a += F(b,c,d) + X[k] + t, a = S(a,s) + b
  62
  63 #define F(x,y,z) (z ^ (x & (y ^ z)))
  64
  65         P(A, B, C, D,  0,  7, 0xD76AA478);
  66         P(D, A, B, C,  1, 12, 0xE8C7B756);
  67         P(C, D, A, B,  2, 17, 0x242070DB);
  68         P(B, C, D, A,  3, 22, 0xC1BDCEEE);
  69         P(A, B, C, D,  4,  7, 0xF57C0FAF);
  70         P(D, A, B, C,  5, 12, 0x4787C62A);
  71         P(C, D, A, B,  6, 17, 0xA8304613);
  72         P(B, C, D, A,  7, 22, 0xFD469501);
  73         P(A, B, C, D,  8,  7, 0x698098D8);
  74         P(D, A, B, C,  9, 12, 0x8B44F7AF);
  75         P(C, D, A, B, 10, 17, 0xFFFF5BB1);
  76         P(B, C, D, A, 11, 22, 0x895CD7BE);
  77         P(A, B, C, D, 12,  7, 0x6B901122);
  78         P(D, A, B, C, 13, 12, 0xFD987193);
  79         P(C, D, A, B, 14, 17, 0xA679438E);
  80         P(B, C, D, A, 15, 22, 0x49B40821);
  81
  82 #undef F
  83 #define F(x,y,z) (y ^ (z & (x ^ y)))
  84
  85         P(A, B, C, D,  1,  5, 0xF61E2562);
  86         P(D, A, B, C,  6,  9, 0xC040B340);
  87         P(C, D, A, B, 11, 14, 0x265E5A51);
  88         P(B, C, D, A,  0, 20, 0xE9B6C7AA);
  89         P(A, B, C, D,  5,  5, 0xD62F105D);
  90         P(D, A, B, C, 10,  9, 0x02441453);
  91         P(C, D, A, B, 15, 14, 0xD8A1E681);
  92         P(B, C, D, A,  4, 20, 0xE7D3FBC8);
  93         P(A, B, C, D,  9,  5, 0x21E1CDE6);
  94         P(D, A, B, C, 14,  9, 0xC33707D6);
  95         P(C, D, A, B,  3, 14, 0xF4D50D87);
  96         P(B, C, D, A,  8, 20, 0x455A14ED);
  97         P(A, B, C, D, 13,  5, 0xA9E3E905);
  98         P(D, A, B, C,  2,  9, 0xFCEFA3F8);
  99         P(C, D, A, B,  7, 14, 0x676F02D9);
 100         P(B, C, D, A, 12, 20, 0x8D2A4C8A);
 101
 102 #undef F
 103 #define F(x,y,z) (x ^ y ^ z)
 104
 105         P(A, B, C, D,  5,  4, 0xFFFA3942);
 106         P(D, A, B, C,  8, 11, 0x8771F681);
 107         P(C, D, A, B, 11, 16, 0x6D9D6122);
 108         P(B, C, D, A, 14, 23, 0xFDE5380C);
 109         P(A, B, C, D,  1,  4, 0xA4BEEA44);
 110         P(D, A, B, C,  4, 11, 0x4BDECFA9);
 111         P(C, D, A, B,  7, 16, 0xF6BB4B60);
 112         P(B, C, D, A, 10, 23, 0xBEBFBC70);
 113         P(A, B, C, D, 13,  4, 0x289B7EC6);
 114         P(D, A, B, C,  0, 11, 0xEAA127FA);
 115         P(C, D, A, B,  3, 16, 0xD4EF3085);
 116         P(B, C, D, A,  6, 23, 0x04881D05);
 117         P(A, B, C, D,  9,  4, 0xD9D4D039);
 118         P(D, A, B, C, 12, 11, 0xE6DB99E5);
 119         P(C, D, A, B, 15, 16, 0x1FA27CF8);
 120         P(B, C, D, A,  2, 23, 0xC4AC5665);
 121
 122 #undef F
 123 #define F(x,y,z) (y ^ (x | ~z))
 124
 125         P(A, B, C, D,  0,  6, 0xF4292244);
 126         P(D, A, B, C,  7, 10, 0x432AFF97);
 127         P(C, D, A, B, 14, 15, 0xAB9423A7);
 128         P(B, C, D, A,  5, 21, 0xFC93A039);
 129         P(A, B, C, D, 12,  6, 0x655B59C3);
 130         P(D, A, B, C,  3, 10, 0x8F0CCC92);
 131         P(C, D, A, B, 10, 15, 0xFFEFF47D);
 132         P(B, C, D, A,  1, 21, 0x85845DD1);
 133         P(A, B, C, D,  8,  6, 0x6FA87E4F);
 134         P(D, A, B, C, 15, 10, 0xFE2CE6E0);
 135         P(C, D, A, B,  6, 15, 0xA3014314);
 136         P(B, C, D, A, 13, 21, 0x4E0811A1);
 137         P(A, B, C, D,  4,  6, 0xF7537E82);
 138         P(D, A, B, C, 11, 10, 0xBD3AF235);
 139         P(C, D, A, B,  2, 15, 0x2AD7D2BB);
 140         P(B, C, D, A,  9, 21, 0xEB86D391);
 141
 142 #undef F
 143
 144         ctx->A += A;
 145         ctx->B += B;
 146         ctx->C += C;
 147         ctx->D += D;
 148 }
 149
 150 #ifdef USE_MD5_ASM
 151 #if CSUM_CHUNK != 64
 152 #error The MD5 ASM code does not support CSUM_CHUNK != 64
 153 #endif
 154 extern void md5_process_asm(md_context *ctx, const void *data, size_t num);
 155 #endif
 156
 157 void md5_update(md_context *ctx, const uchar *input, uint32 length)
 158 {
 159         uint32 left, fill;
 160
 161         if (!length)
 162                 return;
 163
 164         left = ctx->totalN & 0x3F;
 165         fill = CSUM_CHUNK - left;
 166
 167         ctx->totalN += length;
 168         ctx->totalN &= 0xFFFFFFFF;
 169
 170         if (ctx->totalN < length)
 171                 ctx->totalN2++;
 172
 173         if (left && length >= fill) {
 174                 memcpy(ctx->buffer + left, input, fill);
 175                 md5_process(ctx, ctx->buffer);
 176                 length -= fill;
 177                 input  += fill;
 178                 left = 0;
 179         }
 180
 181 #ifdef USE_MD5_ASM /* { */
 182         if (length >= CSUM_CHUNK) {
 183                 uint32 chunks = length / CSUM_CHUNK;
 184                 md5_process_asm(ctx, input, chunks);
 185                 length -= chunks * CSUM_CHUNK;
 186                 input += chunks * CSUM_CHUNK;
 187         }
 188 #else /* } { */
 189         while (length >= CSUM_CHUNK) {
 190                 md5_process(ctx, input);
 191                 length -= CSUM_CHUNK;
 192                 input  += CSUM_CHUNK;
 193         }
 194 #endif /* } */
 195
 196         if (length)
 197                 memcpy(ctx->buffer + left, input, length);
 198 }
 199
 200 static uchar md5_padding[CSUM_CHUNK] = { 0x80 };
 201
 202 void md5_result(md_context *ctx, uchar digest[MD5_DIGEST_LEN])
 203 {
 204         uint32 last, padn;
 205         uint32 high, low;
 206         uchar msglen[8];
 207
 208         high = (ctx->totalN >> 29)
 209              | (ctx->totalN2 <<  3);
 210         low  = (ctx->totalN <<  3);
 211
 212         SIVALu(msglen, 0, low);
 213         SIVALu(msglen, 4, high);
 214
 215         last = ctx->totalN & 0x3F;
 216         padn = last < 56 ? 56 - last : 120 - last;
 217
 218         md5_update(ctx, md5_padding, padn);
 219         md5_update(ctx, msglen, 8);
 220
 221         SIVALu(digest, 0, ctx->A);
 222         SIVALu(digest, 4, ctx->B);
 223         SIVALu(digest, 8, ctx->C);
 224         SIVALu(digest, 12, ctx->D);
 225 }
 226
 227 #ifdef TEST_MD5 /* { */
 228
 229 void get_md5(uchar *out, const uchar *input, int n)
 230 {
 231         md_context ctx;
 232         md5_begin(&ctx);
 233         md5_update(&ctx, input, n);
 234         md5_result(&ctx, out);
 235 }
 236
 237 #include <stdlib.h>
 238 #include <stdio.h>
 239
 240 /*
 241  * those are the standard RFC 1321 test vectors
 242  */
 243
 244 static struct {
 245     char *str, *md5;
 246 } tests[] = {
 247  { "",
 248    "d41d8cd98f00b204e9800998ecf8427e" },
 249  { "a",
 250    "0cc175b9c0f1b6a831c399e269772661" },
 251  { "abc",
 252    "900150983cd24fb0d6963f7d28e17f72" },
 253  { "message digest",
 254    "f96b697d7cb7938d525a2f31aaf161d0" },
 255  { "abcdefghijklmnopqrstuvwxyz",
 256    "c3fcd3d76192e4007dfb496cca67e13b" },
 257  { "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789",
 258    "d174ab98d277d9f5a5611c2c9f419d9f" },
 259  { "12345678901234567890123456789012345678901234567890123456789012345678901234567890",
 260    "57edf4a22be3c955ac49da2e2107b67a" },
 261  { NULL, NULL }
 262 };
 263
 264 int main(int argc, char *argv[])
 265 {
 266         FILE *f;
 267         int i, j;
 268         char output[33];
 269         md_context ctx;
 270         uchar buf[1000];
 271         uchar md5sum[MD5_DIGEST_LEN];
 272
 273         if (argc < 2) {
 274                 printf("\nMD5 Validation Tests:\n\n");
 275
 276                 for (i = 0; tests[i].str; i++) {
 277                         char *str = tests[i].str;
 278                         char *chk = tests[i].md5;
 279
 280                         printf("  Test %d ", i + 1);
 281
 282                         get_md5(md5sum, str, strlen(str));
 283
 284                         for (j = 0; j < MD5_DIGEST_LEN; j++)
 285                                 sprintf(output + j * 2, "%02x", md5sum[j]);
 286
 287                         if (memcmp(output, chk, 32)) {
 288                                 printf("failed!\n");
 289                                 return 1;
 290                         }
 291
 292                         printf("passed.\n");
 293                 }
 294
 295                 printf("\n");
 296                 return 0;
 297         }
 298
 299         while (--argc) {
 300                 if (!(f = fopen(*++argv, "rb"))) {
 301                         perror("fopen");
 302                         return 1;
 303                 }
 304
 305                 md5_begin(&ctx);
 306
 307                 while ((i = fread(buf, 1, sizeof buf, f)) > 0)
 308                         md5_update(&ctx, buf, i);
 309
 310                 md5_result(&ctx, md5sum);
 311
 312                 for (j = 0; j < MD5_DIGEST_LEN; j++)
 313                         printf("%02x", md5sum[j]);
 314
 315                 printf("  %s\n", *argv);
 316         }
 317
 318         return 0;
 319 }
 320
 321 #endif /* } */