libavutil/md5.c

   1 /*
   2  * Copyright (C) 2006 Michael Niedermayer (michaelni@gmx.at)
   3  * Copyright (C) 2003-2005 by Christopher R. Hertel (crh@ubiqx.mn.org)
   4  *
   5  * References:
   6  *  IETF RFC 1321: The MD5 Message-Digest Algorithm
   7  *       Ron Rivest. IETF, April, 1992
   8  *
   9  * based on http://ubiqx.org/libcifs/source/Auth/MD5.c
  10  *          from Christopher R. Hertel (crh@ubiqx.mn.org)
  11  * Simplified, cleaned and IMO redundant comments removed by michael.
  12  *
  13  * If you use gcc, then version 4.1 or later and -fomit-frame-pointer is
  14  * strongly recommended.
  15  *
  16  * This file is part of Libav.
  17  *
  18  * Libav is free software; you can redistribute it and/or
  19  * modify it under the terms of the GNU Lesser General Public
  20  * License as published by the Free Software Foundation; either
  21  * version 2.1 of the License, or (at your option) any later version.
  22  *
  23  * Libav is distributed in the hope that it will be useful,
  24  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  25  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  26  * Lesser General Public License for more details.
  27  *
  28  * You should have received a copy of the GNU Lesser General Public
  29  * License along with Libav; if not, write to the Free Software
  30  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  31  */
  32
  33 #include <stdint.h>
  34 #include "bswap.h"
  35 #include "intreadwrite.h"
  36 #include "md5.h"
  37 #include "mem.h"
  38
  39 typedef struct AVMD5{
  40     uint64_t len;
  41     uint8_t  block[64];
  42     uint32_t ABCD[4];
  43 } AVMD5;
  44
  45 #if FF_API_CONTEXT_SIZE
  46 const int av_md5_size = sizeof(AVMD5);
  47 #endif
  48
  49 struct AVMD5 *av_md5_alloc(void)
  50 {
  51     return av_mallocz(sizeof(struct AVMD5));
  52 }
  53
  54 static const uint8_t S[4][4] = {
  55     { 7, 12, 17, 22 },  /* round 1 */
  56     { 5,  9, 14, 20 },  /* round 2 */
  57     { 4, 11, 16, 23 },  /* round 3 */
  58     { 6, 10, 15, 21 }   /* round 4 */
  59 };
  60
  61 static const uint32_t T[64] = { // T[i]= fabs(sin(i+1)<<32)
  62     0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee,   /* round 1 */
  63     0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
  64     0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
  65     0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
  66
  67     0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa,   /* round 2 */
  68     0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
  69     0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
  70     0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
  71
  72     0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c,   /* round 3 */
  73     0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
  74     0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05,
  75     0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
  76
  77     0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039,   /* round 4 */
  78     0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
  79     0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
  80     0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391,
  81 };
  82
  83 #define CORE(i, a, b, c, d) do {                                        \
  84         t = S[i >> 4][i & 3];                                           \
  85         a += T[i];                                                      \
  86                                                                         \
  87         if (i < 32) {                                                   \
  88             if (i < 16) a += (d ^ (b & (c ^ d))) + X[       i  & 15];   \
  89             else        a += (c ^ (d & (c ^ b))) + X[(1 + 5*i) & 15];   \
  90         } else {                                                        \
  91             if (i < 48) a += (b ^ c ^ d)         + X[(5 + 3*i) & 15];   \
  92             else        a += (c ^ (b | ~d))      + X[(    7*i) & 15];   \
  93         }                                                               \
  94         a = b + (a << t | a >> (32 - t));                               \
  95     } while (0)
  96
  97 static void body(uint32_t ABCD[4], uint32_t X[16])
  98 {
  99     int t;
 100     int i av_unused;
 101     unsigned int a = ABCD[3];
 102     unsigned int b = ABCD[2];
 103     unsigned int c = ABCD[1];
 104     unsigned int d = ABCD[0];
 105
 106 #if HAVE_BIGENDIAN
 107     for (i = 0; i < 16; i++)
 108         X[i] = av_bswap32(X[i]);
 109 #endif
 110
 111 #if CONFIG_SMALL
 112     for (i = 0; i < 64; i++) {
 113         CORE(i, a, b, c, d);
 114         t = d;
 115         d = c;
 116         c = b;
 117         b = a;
 118         a = t;
 119     }
 120 #else
 121 #define CORE2(i)                                                        \
 122     CORE( i,   a,b,c,d); CORE((i+1),d,a,b,c);                           \
 123     CORE((i+2),c,d,a,b); CORE((i+3),b,c,d,a)
 124 #define CORE4(i) CORE2(i); CORE2((i+4)); CORE2((i+8)); CORE2((i+12))
 125     CORE4(0); CORE4(16); CORE4(32); CORE4(48);
 126 #endif
 127
 128     ABCD[0] += d;
 129     ABCD[1] += c;
 130     ABCD[2] += b;
 131     ABCD[3] += a;
 132 }
 133
 134 void av_md5_init(AVMD5 *ctx)
 135 {
 136     ctx->len     = 0;
 137
 138     ctx->ABCD[0] = 0x10325476;
 139     ctx->ABCD[1] = 0x98badcfe;
 140     ctx->ABCD[2] = 0xefcdab89;
 141     ctx->ABCD[3] = 0x67452301;
 142 }
 143
 144 void av_md5_update(AVMD5 *ctx, const uint8_t *src, const int len)
 145 {
 146     int i, j;
 147
 148     j = ctx->len & 63;
 149     ctx->len += len;
 150
 151     for (i = 0; i < len; i++) {
 152         ctx->block[j++] = src[i];
 153         if (j == 64) {
 154             body(ctx->ABCD, (uint32_t *) ctx->block);
 155             j = 0;
 156         }
 157     }
 158 }
 159
 160 void av_md5_final(AVMD5 *ctx, uint8_t *dst)
 161 {
 162     int i;
 163     uint64_t finalcount = av_le2ne64(ctx->len << 3);
 164
 165     av_md5_update(ctx, "\200", 1);
 166     while ((ctx->len & 63) != 56)
 167         av_md5_update(ctx, "", 1);
 168
 169     av_md5_update(ctx, (uint8_t *)&finalcount, 8);
 170
 171     for (i = 0; i < 4; i++)
 172         AV_WL32(dst + 4*i, ctx->ABCD[3 - i]);
 173 }
 174
 175 void av_md5_sum(uint8_t *dst, const uint8_t *src, const int len)
 176 {
 177     AVMD5 ctx;
 178
 179     av_md5_init(&ctx);
 180     av_md5_update(&ctx, src, len);
 181     av_md5_final(&ctx, dst);
 182 }
 183
 184 #ifdef TEST
 185 #include <stdio.h>
 186
 187 static void print_md5(uint8_t *md5)
 188 {
 189     int i;
 190     for (i = 0; i < 16; i++)
 191         printf("%02x", md5[i]);
 192     printf("\n");
 193 }
 194
 195 int main(void){
 196     uint8_t md5val[16];
 197     int i;
 198     uint8_t in[1000];
 199
 200     for (i = 0; i < 1000; i++)
 201         in[i] = i * i;
 202     av_md5_sum(md5val, in, 1000); print_md5(md5val);
 203     av_md5_sum(md5val, in,   63); print_md5(md5val);
 204     av_md5_sum(md5val, in,   64); print_md5(md5val);
 205     av_md5_sum(md5val, in,   65); print_md5(md5val);
 206     for (i = 0; i < 1000; i++)
 207         in[i] = i % 127;
 208     av_md5_sum(md5val, in,  999); print_md5(md5val);
 209
 210     return 0;
 211 }
 212 #endif