md5.c
author Ryan C. Gordon <icculus@icculus.org>
Thu, 02 Feb 2006 07:07:03 +0000
changeset 104 339482f858af
parent 0 31eee864ed5d
permissions -rw-r--r--
Argh, really fix byte order serialization.
icculus@0
     1
/*
icculus@0
     2
  Copyright (C) 1999 Aladdin Enterprises.  All rights reserved.
icculus@0
     3
icculus@0
     4
  This software is provided 'as-is', without any express or implied
icculus@0
     5
  warranty.  In no event will the authors be held liable for any damages
icculus@0
     6
  arising from the use of this software.
icculus@0
     7
icculus@0
     8
  Permission is granted to anyone to use this software for any purpose,
icculus@0
     9
  including commercial applications, and to alter it and redistribute it
icculus@0
    10
  freely, subject to the following restrictions:
icculus@0
    11
icculus@0
    12
  1. The origin of this software must not be misrepresented; you must not
icculus@0
    13
     claim that you wrote the original software. If you use this software
icculus@0
    14
     in a product, an acknowledgment in the product documentation would be
icculus@0
    15
     appreciated but is not required.
icculus@0
    16
  2. Altered source versions must be plainly marked as such, and must not be
icculus@0
    17
     misrepresented as being the original software.
icculus@0
    18
  3. This notice may not be removed or altered from any source distribution.
icculus@0
    19
icculus@0
    20
  L. Peter Deutsch
icculus@0
    21
  ghost@@aladdin.com
icculus@0
    22
icculus@0
    23
 */
icculus@0
    24
/*$Id: md5.c,v 1.1 2004/01/05 18:54:19 icculus Exp $ */
icculus@0
    25
/*
icculus@0
    26
  Independent implementation of MD5 (RFC 1321).
icculus@0
    27
icculus@0
    28
  This code implements the MD5 Algorithm defined in RFC 1321.
icculus@0
    29
  It is derived directly from the text of the RFC and not from the
icculus@0
    30
  reference implementation.
icculus@0
    31
icculus@0
    32
  The original and principal author of md5.c is L. Peter Deutsch
icculus@0
    33
  <ghost@@aladdin.com>.  Other authors are noted in the change history
icculus@0
    34
  that follows (in reverse chronological order):
icculus@0
    35
icculus@0
    36
  1999-11-04 lpd Edited comments slightly for automatic TOC extraction.
icculus@0
    37
  1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5).
icculus@0
    38
  1999-05-03 lpd Original version.
icculus@0
    39
 */
icculus@0
    40
icculus@0
    41
#include "md5.h"
icculus@0
    42
#include <memory.h>
icculus@0
    43
icculus@0
    44
#ifdef TEST
icculus@0
    45
/*
icculus@0
    46
 * Compile with -DTEST to create a self-contained executable test program.
icculus@0
    47
 * The test program should print out the same values as given in section
icculus@0
    48
 * A.5 of RFC 1321, reproduced below.
icculus@0
    49
 */
icculus@0
    50
#include <string.h>
icculus@0
    51
main()
icculus@0
    52
{
icculus@0
    53
    static const char *const test[7] = {
icculus@0
    54
	"", /*d41d8cd98f00b204e9800998ecf8427e*/
icculus@0
    55
	"a", /*0cc175b9c0f1b6a831c399e269772661*/
icculus@0
    56
	"abc", /*900150983cd24fb0d6963f7d28e17f72*/
icculus@0
    57
	"message digest", /*f96b697d7cb7938d525a2f31aaf161d0*/
icculus@0
    58
	"abcdefghijklmnopqrstuvwxyz", /*c3fcd3d76192e4007dfb496cca67e13b*/
icculus@0
    59
	"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789",
icculus@0
    60
				/*d174ab98d277d9f5a5611c2c9f419d9f*/
icculus@0
    61
	"12345678901234567890123456789012345678901234567890123456789012345678901234567890" /*57edf4a22be3c955ac49da2e2107b67a*/
icculus@0
    62
    };
icculus@0
    63
    int i;
icculus@0
    64
icculus@0
    65
    for (i = 0; i < 7; ++i) {
icculus@0
    66
	md5_state_t state;
icculus@0
    67
	md5_byte_t digest[16];
icculus@0
    68
	int di;
icculus@0
    69
icculus@0
    70
	md5_init(&state);
icculus@0
    71
	md5_append(&state, (const md5_byte_t *)test[i], strlen(test[i]));
icculus@0
    72
	md5_finish(&state, digest);
icculus@0
    73
	printf("MD5 (\"%s\") = ", test[i]);
icculus@0
    74
	for (di = 0; di < 16; ++di)
icculus@0
    75
	    printf("%02x", digest[di]);
icculus@0
    76
	printf("\n");
icculus@0
    77
    }
icculus@0
    78
    return 0;
icculus@0
    79
}
icculus@0
    80
#endif /* TEST */
icculus@0
    81
icculus@0
    82
icculus@0
    83
/*
icculus@0
    84
 * For reference, here is the program that computed the T values.
icculus@0
    85
 */
icculus@0
    86
#if 0
icculus@0
    87
#include <math.h>
icculus@0
    88
main()
icculus@0
    89
{
icculus@0
    90
    int i;
icculus@0
    91
    for (i = 1; i <= 64; ++i) {
icculus@0
    92
	unsigned long v = (unsigned long)(4294967296.0 * fabs(sin((double)i)));
icculus@0
    93
	printf("#define T%d 0x%08lx\n", i, v);
icculus@0
    94
    }
icculus@0
    95
    return 0;
icculus@0
    96
}
icculus@0
    97
#endif
icculus@0
    98
/*
icculus@0
    99
 * End of T computation program.
icculus@0
   100
 */
icculus@0
   101
#define T1 0xd76aa478
icculus@0
   102
#define T2 0xe8c7b756
icculus@0
   103
#define T3 0x242070db
icculus@0
   104
#define T4 0xc1bdceee
icculus@0
   105
#define T5 0xf57c0faf
icculus@0
   106
#define T6 0x4787c62a
icculus@0
   107
#define T7 0xa8304613
icculus@0
   108
#define T8 0xfd469501
icculus@0
   109
#define T9 0x698098d8
icculus@0
   110
#define T10 0x8b44f7af
icculus@0
   111
#define T11 0xffff5bb1
icculus@0
   112
#define T12 0x895cd7be
icculus@0
   113
#define T13 0x6b901122
icculus@0
   114
#define T14 0xfd987193
icculus@0
   115
#define T15 0xa679438e
icculus@0
   116
#define T16 0x49b40821
icculus@0
   117
#define T17 0xf61e2562
icculus@0
   118
#define T18 0xc040b340
icculus@0
   119
#define T19 0x265e5a51
icculus@0
   120
#define T20 0xe9b6c7aa
icculus@0
   121
#define T21 0xd62f105d
icculus@0
   122
#define T22 0x02441453
icculus@0
   123
#define T23 0xd8a1e681
icculus@0
   124
#define T24 0xe7d3fbc8
icculus@0
   125
#define T25 0x21e1cde6
icculus@0
   126
#define T26 0xc33707d6
icculus@0
   127
#define T27 0xf4d50d87
icculus@0
   128
#define T28 0x455a14ed
icculus@0
   129
#define T29 0xa9e3e905
icculus@0
   130
#define T30 0xfcefa3f8
icculus@0
   131
#define T31 0x676f02d9
icculus@0
   132
#define T32 0x8d2a4c8a
icculus@0
   133
#define T33 0xfffa3942
icculus@0
   134
#define T34 0x8771f681
icculus@0
   135
#define T35 0x6d9d6122
icculus@0
   136
#define T36 0xfde5380c
icculus@0
   137
#define T37 0xa4beea44
icculus@0
   138
#define T38 0x4bdecfa9
icculus@0
   139
#define T39 0xf6bb4b60
icculus@0
   140
#define T40 0xbebfbc70
icculus@0
   141
#define T41 0x289b7ec6
icculus@0
   142
#define T42 0xeaa127fa
icculus@0
   143
#define T43 0xd4ef3085
icculus@0
   144
#define T44 0x04881d05
icculus@0
   145
#define T45 0xd9d4d039
icculus@0
   146
#define T46 0xe6db99e5
icculus@0
   147
#define T47 0x1fa27cf8
icculus@0
   148
#define T48 0xc4ac5665
icculus@0
   149
#define T49 0xf4292244
icculus@0
   150
#define T50 0x432aff97
icculus@0
   151
#define T51 0xab9423a7
icculus@0
   152
#define T52 0xfc93a039
icculus@0
   153
#define T53 0x655b59c3
icculus@0
   154
#define T54 0x8f0ccc92
icculus@0
   155
#define T55 0xffeff47d
icculus@0
   156
#define T56 0x85845dd1
icculus@0
   157
#define T57 0x6fa87e4f
icculus@0
   158
#define T58 0xfe2ce6e0
icculus@0
   159
#define T59 0xa3014314
icculus@0
   160
#define T60 0x4e0811a1
icculus@0
   161
#define T61 0xf7537e82
icculus@0
   162
#define T62 0xbd3af235
icculus@0
   163
#define T63 0x2ad7d2bb
icculus@0
   164
#define T64 0xeb86d391
icculus@0
   165
icculus@0
   166
static void
icculus@0
   167
md5_process(md5_state_t *pms, const md5_byte_t *data /*[64]*/)
icculus@0
   168
{
icculus@0
   169
    md5_word_t
icculus@0
   170
	a = pms->abcd[0], b = pms->abcd[1],
icculus@0
   171
	c = pms->abcd[2], d = pms->abcd[3];
icculus@0
   172
    md5_word_t t;
icculus@0
   173
icculus@0
   174
#ifndef ARCH_IS_BIG_ENDIAN
icculus@0
   175
# define ARCH_IS_BIG_ENDIAN 1	/* slower, default implementation */
icculus@0
   176
#endif
icculus@0
   177
#if ARCH_IS_BIG_ENDIAN
icculus@0
   178
icculus@0
   179
    /*
icculus@0
   180
     * On big-endian machines, we must arrange the bytes in the right
icculus@0
   181
     * order.  (This also works on machines of unknown byte order.)
icculus@0
   182
     */
icculus@0
   183
    md5_word_t X[16];
icculus@0
   184
    const md5_byte_t *xp = data;
icculus@0
   185
    int i;
icculus@0
   186
icculus@0
   187
    for (i = 0; i < 16; ++i, xp += 4)
icculus@0
   188
	X[i] = xp[0] + (xp[1] << 8) + (xp[2] << 16) + (xp[3] << 24);
icculus@0
   189
icculus@0
   190
#else  /* !ARCH_IS_BIG_ENDIAN */
icculus@0
   191
icculus@0
   192
    /*
icculus@0
   193
     * On little-endian machines, we can process properly aligned data
icculus@0
   194
     * without copying it.
icculus@0
   195
     */
icculus@0
   196
    md5_word_t xbuf[16];
icculus@0
   197
    const md5_word_t *X;
icculus@0
   198
icculus@0
   199
    if (!((data - (const md5_byte_t *)0) & 3)) {
icculus@0
   200
	/* data are properly aligned */
icculus@0
   201
	X = (const md5_word_t *)data;
icculus@0
   202
    } else {
icculus@0
   203
	/* not aligned */
icculus@0
   204
	memcpy(xbuf, data, 64);
icculus@0
   205
	X = xbuf;
icculus@0
   206
    }
icculus@0
   207
#endif
icculus@0
   208
icculus@0
   209
#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n))))
icculus@0
   210
icculus@0
   211
    /* Round 1. */
icculus@0
   212
    /* Let [abcd k s i] denote the operation
icculus@0
   213
       a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s). */
icculus@0
   214
#define F(x, y, z) (((x) & (y)) | (~(x) & (z)))
icculus@0
   215
#define SET(a, b, c, d, k, s, Ti)\
icculus@0
   216
  t = a + F(b,c,d) + X[k] + Ti;\
icculus@0
   217
  a = ROTATE_LEFT(t, s) + b
icculus@0
   218
    /* Do the following 16 operations. */
icculus@0
   219
    SET(a, b, c, d,  0,  7,  T1);
icculus@0
   220
    SET(d, a, b, c,  1, 12,  T2);
icculus@0
   221
    SET(c, d, a, b,  2, 17,  T3);
icculus@0
   222
    SET(b, c, d, a,  3, 22,  T4);
icculus@0
   223
    SET(a, b, c, d,  4,  7,  T5);
icculus@0
   224
    SET(d, a, b, c,  5, 12,  T6);
icculus@0
   225
    SET(c, d, a, b,  6, 17,  T7);
icculus@0
   226
    SET(b, c, d, a,  7, 22,  T8);
icculus@0
   227
    SET(a, b, c, d,  8,  7,  T9);
icculus@0
   228
    SET(d, a, b, c,  9, 12, T10);
icculus@0
   229
    SET(c, d, a, b, 10, 17, T11);
icculus@0
   230
    SET(b, c, d, a, 11, 22, T12);
icculus@0
   231
    SET(a, b, c, d, 12,  7, T13);
icculus@0
   232
    SET(d, a, b, c, 13, 12, T14);
icculus@0
   233
    SET(c, d, a, b, 14, 17, T15);
icculus@0
   234
    SET(b, c, d, a, 15, 22, T16);
icculus@0
   235
#undef SET
icculus@0
   236
icculus@0
   237
     /* Round 2. */
icculus@0
   238
     /* Let [abcd k s i] denote the operation
icculus@0
   239
          a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s). */
icculus@0
   240
#define G(x, y, z) (((x) & (z)) | ((y) & ~(z)))
icculus@0
   241
#define SET(a, b, c, d, k, s, Ti)\
icculus@0
   242
  t = a + G(b,c,d) + X[k] + Ti;\
icculus@0
   243
  a = ROTATE_LEFT(t, s) + b
icculus@0
   244
     /* Do the following 16 operations. */
icculus@0
   245
    SET(a, b, c, d,  1,  5, T17);
icculus@0
   246
    SET(d, a, b, c,  6,  9, T18);
icculus@0
   247
    SET(c, d, a, b, 11, 14, T19);
icculus@0
   248
    SET(b, c, d, a,  0, 20, T20);
icculus@0
   249
    SET(a, b, c, d,  5,  5, T21);
icculus@0
   250
    SET(d, a, b, c, 10,  9, T22);
icculus@0
   251
    SET(c, d, a, b, 15, 14, T23);
icculus@0
   252
    SET(b, c, d, a,  4, 20, T24);
icculus@0
   253
    SET(a, b, c, d,  9,  5, T25);
icculus@0
   254
    SET(d, a, b, c, 14,  9, T26);
icculus@0
   255
    SET(c, d, a, b,  3, 14, T27);
icculus@0
   256
    SET(b, c, d, a,  8, 20, T28);
icculus@0
   257
    SET(a, b, c, d, 13,  5, T29);
icculus@0
   258
    SET(d, a, b, c,  2,  9, T30);
icculus@0
   259
    SET(c, d, a, b,  7, 14, T31);
icculus@0
   260
    SET(b, c, d, a, 12, 20, T32);
icculus@0
   261
#undef SET
icculus@0
   262
icculus@0
   263
     /* Round 3. */
icculus@0
   264
     /* Let [abcd k s t] denote the operation
icculus@0
   265
          a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s). */
icculus@0
   266
#define H(x, y, z) ((x) ^ (y) ^ (z))
icculus@0
   267
#define SET(a, b, c, d, k, s, Ti)\
icculus@0
   268
  t = a + H(b,c,d) + X[k] + Ti;\
icculus@0
   269
  a = ROTATE_LEFT(t, s) + b
icculus@0
   270
     /* Do the following 16 operations. */
icculus@0
   271
    SET(a, b, c, d,  5,  4, T33);
icculus@0
   272
    SET(d, a, b, c,  8, 11, T34);
icculus@0
   273
    SET(c, d, a, b, 11, 16, T35);
icculus@0
   274
    SET(b, c, d, a, 14, 23, T36);
icculus@0
   275
    SET(a, b, c, d,  1,  4, T37);
icculus@0
   276
    SET(d, a, b, c,  4, 11, T38);
icculus@0
   277
    SET(c, d, a, b,  7, 16, T39);
icculus@0
   278
    SET(b, c, d, a, 10, 23, T40);
icculus@0
   279
    SET(a, b, c, d, 13,  4, T41);
icculus@0
   280
    SET(d, a, b, c,  0, 11, T42);
icculus@0
   281
    SET(c, d, a, b,  3, 16, T43);
icculus@0
   282
    SET(b, c, d, a,  6, 23, T44);
icculus@0
   283
    SET(a, b, c, d,  9,  4, T45);
icculus@0
   284
    SET(d, a, b, c, 12, 11, T46);
icculus@0
   285
    SET(c, d, a, b, 15, 16, T47);
icculus@0
   286
    SET(b, c, d, a,  2, 23, T48);
icculus@0
   287
#undef SET
icculus@0
   288
icculus@0
   289
     /* Round 4. */
icculus@0
   290
     /* Let [abcd k s t] denote the operation
icculus@0
   291
          a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s). */
icculus@0
   292
#define I(x, y, z) ((y) ^ ((x) | ~(z)))
icculus@0
   293
#define SET(a, b, c, d, k, s, Ti)\
icculus@0
   294
  t = a + I(b,c,d) + X[k] + Ti;\
icculus@0
   295
  a = ROTATE_LEFT(t, s) + b
icculus@0
   296
     /* Do the following 16 operations. */
icculus@0
   297
    SET(a, b, c, d,  0,  6, T49);
icculus@0
   298
    SET(d, a, b, c,  7, 10, T50);
icculus@0
   299
    SET(c, d, a, b, 14, 15, T51);
icculus@0
   300
    SET(b, c, d, a,  5, 21, T52);
icculus@0
   301
    SET(a, b, c, d, 12,  6, T53);
icculus@0
   302
    SET(d, a, b, c,  3, 10, T54);
icculus@0
   303
    SET(c, d, a, b, 10, 15, T55);
icculus@0
   304
    SET(b, c, d, a,  1, 21, T56);
icculus@0
   305
    SET(a, b, c, d,  8,  6, T57);
icculus@0
   306
    SET(d, a, b, c, 15, 10, T58);
icculus@0
   307
    SET(c, d, a, b,  6, 15, T59);
icculus@0
   308
    SET(b, c, d, a, 13, 21, T60);
icculus@0
   309
    SET(a, b, c, d,  4,  6, T61);
icculus@0
   310
    SET(d, a, b, c, 11, 10, T62);
icculus@0
   311
    SET(c, d, a, b,  2, 15, T63);
icculus@0
   312
    SET(b, c, d, a,  9, 21, T64);
icculus@0
   313
#undef SET
icculus@0
   314
icculus@0
   315
     /* Then perform the following additions. (That is increment each
icculus@0
   316
        of the four registers by the value it had before this block
icculus@0
   317
        was started.) */
icculus@0
   318
    pms->abcd[0] += a;
icculus@0
   319
    pms->abcd[1] += b;
icculus@0
   320
    pms->abcd[2] += c;
icculus@0
   321
    pms->abcd[3] += d;
icculus@0
   322
}
icculus@0
   323
icculus@0
   324
void
icculus@0
   325
md5_init(md5_state_t *pms)
icculus@0
   326
{
icculus@0
   327
    pms->count[0] = pms->count[1] = 0;
icculus@0
   328
    pms->abcd[0] = 0x67452301;
icculus@0
   329
    pms->abcd[1] = 0xefcdab89;
icculus@0
   330
    pms->abcd[2] = 0x98badcfe;
icculus@0
   331
    pms->abcd[3] = 0x10325476;
icculus@0
   332
}
icculus@0
   333
icculus@0
   334
void
icculus@0
   335
md5_append(md5_state_t *pms, const md5_byte_t *data, int nbytes)
icculus@0
   336
{
icculus@0
   337
    const md5_byte_t *p = data;
icculus@0
   338
    int left = nbytes;
icculus@0
   339
    int offset = (pms->count[0] >> 3) & 63;
icculus@0
   340
    md5_word_t nbits = (md5_word_t)(nbytes << 3);
icculus@0
   341
icculus@0
   342
    if (nbytes <= 0)
icculus@0
   343
	return;
icculus@0
   344
icculus@0
   345
    /* Update the message length. */
icculus@0
   346
    pms->count[1] += nbytes >> 29;
icculus@0
   347
    pms->count[0] += nbits;
icculus@0
   348
    if (pms->count[0] < nbits)
icculus@0
   349
	pms->count[1]++;
icculus@0
   350
icculus@0
   351
    /* Process an initial partial block. */
icculus@0
   352
    if (offset) {
icculus@0
   353
	int copy = (offset + nbytes > 64 ? 64 - offset : nbytes);
icculus@0
   354
icculus@0
   355
	memcpy(pms->buf + offset, p, copy);
icculus@0
   356
	if (offset + copy < 64)
icculus@0
   357
	    return;
icculus@0
   358
	p += copy;
icculus@0
   359
	left -= copy;
icculus@0
   360
	md5_process(pms, pms->buf);
icculus@0
   361
    }
icculus@0
   362
icculus@0
   363
    /* Process full blocks. */
icculus@0
   364
    for (; left >= 64; p += 64, left -= 64)
icculus@0
   365
	md5_process(pms, p);
icculus@0
   366
icculus@0
   367
    /* Process a final partial block. */
icculus@0
   368
    if (left)
icculus@0
   369
	memcpy(pms->buf, p, left);
icculus@0
   370
}
icculus@0
   371
icculus@0
   372
void
icculus@0
   373
md5_finish(md5_state_t *pms, md5_byte_t digest[16])
icculus@0
   374
{
icculus@0
   375
    static const md5_byte_t pad[64] = {
icculus@0
   376
	0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
icculus@0
   377
	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
icculus@0
   378
	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
icculus@0
   379
	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
icculus@0
   380
    };
icculus@0
   381
    md5_byte_t data[8];
icculus@0
   382
    int i;
icculus@0
   383
icculus@0
   384
    /* Save the length before padding. */
icculus@0
   385
    for (i = 0; i < 8; ++i)
icculus@0
   386
	data[i] = (md5_byte_t)(pms->count[i >> 2] >> ((i & 3) << 3));
icculus@0
   387
    /* Pad to 56 bytes mod 64. */
icculus@0
   388
    md5_append(pms, pad, ((55 - (pms->count[0] >> 3)) & 63) + 1);
icculus@0
   389
    /* Append the length. */
icculus@0
   390
    md5_append(pms, data, 8);
icculus@0
   391
    for (i = 0; i < 16; ++i)
icculus@0
   392
	digest[i] = (md5_byte_t)(pms->abcd[i >> 2] >> ((i & 3) << 3));
icculus@0
   393
}
icculus@0
   394