The Design and Implementation of the FreeBSD Operating System, Second Edition
Now available: The Design and Implementation of the FreeBSD Operating System (Second Edition)


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]

FreeBSD/Linux Kernel Cross Reference
sys/kern/md5c.c

Version: -  FREEBSD  -  FREEBSD-12-STABLE  -  FREEBSD-12-0  -  FREEBSD-11-STABLE  -  FREEBSD-11-2  -  FREEBSD-11-1  -  FREEBSD-11-0  -  FREEBSD-10-STABLE  -  FREEBSD-10-4  -  FREEBSD-10-3  -  FREEBSD-10-2  -  FREEBSD-10-1  -  FREEBSD-10-0  -  FREEBSD-9-STABLE  -  FREEBSD-9-3  -  FREEBSD-9-2  -  FREEBSD-9-1  -  FREEBSD-9-0  -  FREEBSD-8-STABLE  -  FREEBSD-8-4  -  FREEBSD-8-3  -  FREEBSD-8-2  -  FREEBSD-8-1  -  FREEBSD-8-0  -  FREEBSD-7-STABLE  -  FREEBSD-7-4  -  FREEBSD-7-3  -  FREEBSD-7-2  -  FREEBSD-7-1  -  FREEBSD-7-0  -  FREEBSD-6-STABLE  -  FREEBSD-6-4  -  FREEBSD-6-3  -  FREEBSD-6-2  -  FREEBSD-6-1  -  FREEBSD-6-0  -  FREEBSD-5-STABLE  -  FREEBSD-5-5  -  FREEBSD-5-4  -  FREEBSD-5-3  -  FREEBSD-5-2  -  FREEBSD-5-1  -  FREEBSD-5-0  -  FREEBSD-4-STABLE  -  FREEBSD-3-STABLE  -  FREEBSD22  -  linux-2.6  -  linux-2.4.22  -  MK83  -  MK84  -  PLAN9  -  DFBSD  -  NETBSD  -  NETBSD5  -  NETBSD4  -  NETBSD3  -  NETBSD20  -  OPENBSD  -  xnu-517  -  xnu-792  -  xnu-792.6.70  -  xnu-1228  -  xnu-1456.1.26  -  xnu-1699.24.8  -  xnu-2050.18.24  -  OPENSOLARIS  -  minix-3-1-1 
SearchContext: -  none  -  3  -  10 

    1 /*
    2  * MD5C.C - RSA Data Security, Inc., MD5 message-digest algorithm
    3  *
    4  * Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
    5  * rights reserved.
    6  *
    7  * License to copy and use this software is granted provided that it
    8  * is identified as the "RSA Data Security, Inc. MD5 Message-Digest
    9  * Algorithm" in all material mentioning or referencing this software
   10  * or this function.
   11  *
   12  * License is also granted to make and use derivative works provided
   13  * that such works are identified as "derived from the RSA Data
   14  * Security, Inc. MD5 Message-Digest Algorithm" in all material
   15  * mentioning or referencing the derived work.
   16  *
   17  * RSA Data Security, Inc. makes no representations concerning either
   18  * the merchantability of this software or the suitability of this
   19  * software for any particular purpose. It is provided "as is"
   20  * without express or implied warranty of any kind.
   21  *
   22  * These notices must be retained in any copies of any part of this
   23  * documentation and/or software.
   24  *
   25  * $FreeBSD: src/sys/kern/md5c.c,v 1.6.2.1 1999/09/05 08:15:09 peter Exp $
   26  *
   27  * This code is the same as the code published by RSA Inc.  It has been
   28  * edited for clarity and style only.
   29  */
   30 
   31 #include <sys/types.h>
   32 
   33 #ifdef KERNEL
   34 #include <sys/param.h>
   35 #include <sys/systm.h>
   36 #else
   37 #include <string.h>
   38 #endif
   39 
   40 #include <sys/md5.h>
   41 
   42 static void MD5Transform __P((u_int32_t [4], const unsigned char [64]));
   43 
   44 #ifdef KERNEL
   45 #define memset(x,y,z)   bzero(x,z);
   46 #define memcpy(x,y,z)   bcopy(y, x, z)
   47 #endif
   48 
   49 #ifdef i386
   50 #define Encode memcpy
   51 #define Decode memcpy
   52 #else /* i386 */
   53 
   54 /*
   55  * Encodes input (u_int32_t) into output (unsigned char). Assumes len is
   56  * a multiple of 4.
   57  */
   58 
   59 static void
   60 Encode (output, input, len)
   61         unsigned char *output;
   62         u_int32_t *input;
   63         unsigned int len;
   64 {
   65         unsigned int i, j;
   66 
   67         for (i = 0, j = 0; j < len; i++, j += 4) {
   68                 output[j] = (unsigned char)(input[i] & 0xff);
   69                 output[j+1] = (unsigned char)((input[i] >> 8) & 0xff);
   70                 output[j+2] = (unsigned char)((input[i] >> 16) & 0xff);
   71                 output[j+3] = (unsigned char)((input[i] >> 24) & 0xff);
   72         }
   73 }
   74 
   75 /*
   76  * Decodes input (unsigned char) into output (u_int32_t). Assumes len is
   77  * a multiple of 4.
   78  */
   79 
   80 static void
   81 Decode (output, input, len)
   82         u_int32_t *output;
   83         const unsigned char *input;
   84         unsigned int len;
   85 {
   86         unsigned int i, j;
   87 
   88         for (i = 0, j = 0; j < len; i++, j += 4)
   89                 output[i] = ((u_int32_t)input[j]) | (((u_int32_t)input[j+1]) << 8) |
   90                     (((u_int32_t)input[j+2]) << 16) | (((u_int32_t)input[j+3]) << 24);
   91 }
   92 #endif /* i386 */
   93 
   94 static unsigned char PADDING[64] = {
   95   0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
   96   0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
   97   0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
   98 };
   99 
  100 /* F, G, H and I are basic MD5 functions. */
  101 #define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
  102 #define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
  103 #define H(x, y, z) ((x) ^ (y) ^ (z))
  104 #define I(x, y, z) ((y) ^ ((x) | (~z)))
  105 
  106 /* ROTATE_LEFT rotates x left n bits. */
  107 #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
  108 
  109 /*
  110  * FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
  111  * Rotation is separate from addition to prevent recomputation.
  112  */
  113 #define FF(a, b, c, d, x, s, ac) { \
  114         (a) += F ((b), (c), (d)) + (x) + (u_int32_t)(ac); \
  115         (a) = ROTATE_LEFT ((a), (s)); \
  116         (a) += (b); \
  117         }
  118 #define GG(a, b, c, d, x, s, ac) { \
  119         (a) += G ((b), (c), (d)) + (x) + (u_int32_t)(ac); \
  120         (a) = ROTATE_LEFT ((a), (s)); \
  121         (a) += (b); \
  122         }
  123 #define HH(a, b, c, d, x, s, ac) { \
  124         (a) += H ((b), (c), (d)) + (x) + (u_int32_t)(ac); \
  125         (a) = ROTATE_LEFT ((a), (s)); \
  126         (a) += (b); \
  127         }
  128 #define II(a, b, c, d, x, s, ac) { \
  129         (a) += I ((b), (c), (d)) + (x) + (u_int32_t)(ac); \
  130         (a) = ROTATE_LEFT ((a), (s)); \
  131         (a) += (b); \
  132         }
  133 
  134 /* MD5 initialization. Begins an MD5 operation, writing a new context. */
  135 
  136 void
  137 MD5Init (context)
  138         MD5_CTX *context;
  139 {
  140 
  141         context->count[0] = context->count[1] = 0;
  142 
  143         /* Load magic initialization constants.  */
  144         context->state[0] = 0x67452301;
  145         context->state[1] = 0xefcdab89;
  146         context->state[2] = 0x98badcfe;
  147         context->state[3] = 0x10325476;
  148 }
  149 
  150 /* 
  151  * MD5 block update operation. Continues an MD5 message-digest
  152  * operation, processing another message block, and updating the
  153  * context.
  154  */
  155 
  156 void
  157 MD5Update (context, input, inputLen)
  158         MD5_CTX *context;
  159         const unsigned char *input;
  160         unsigned int inputLen;
  161 {
  162         unsigned int i, index, partLen;
  163 
  164         /* Compute number of bytes mod 64 */
  165         index = (unsigned int)((context->count[0] >> 3) & 0x3F);
  166 
  167         /* Update number of bits */
  168         if ((context->count[0] += ((u_int32_t)inputLen << 3))
  169             < ((u_int32_t)inputLen << 3))
  170                 context->count[1]++;
  171         context->count[1] += ((u_int32_t)inputLen >> 29);
  172 
  173         partLen = 64 - index;
  174 
  175         /* Transform as many times as possible. */
  176         if (inputLen >= partLen) {
  177                 memcpy((void *)&context->buffer[index], (void *)input,
  178                     partLen);
  179                 MD5Transform (context->state, context->buffer);
  180 
  181                 for (i = partLen; i + 63 < inputLen; i += 64)
  182                         MD5Transform (context->state, &input[i]);
  183 
  184                 index = 0;
  185         }
  186         else
  187                 i = 0;
  188 
  189         /* Buffer remaining input */
  190         memcpy ((void *)&context->buffer[index], (void *)&input[i],
  191             inputLen-i);
  192 }
  193 
  194 /*
  195  * MD5 finalization. Ends an MD5 message-digest operation, writing the
  196  * the message digest and zeroizing the context.
  197  */
  198 
  199 void
  200 MD5Final (digest, context)
  201         unsigned char digest[16];
  202         MD5_CTX *context;
  203 {
  204         unsigned char bits[8];
  205         unsigned int index, padLen;
  206 
  207         /* Save number of bits */
  208         Encode (bits, context->count, 8);
  209 
  210         /* Pad out to 56 mod 64. */
  211         index = (unsigned int)((context->count[0] >> 3) & 0x3f);
  212         padLen = (index < 56) ? (56 - index) : (120 - index);
  213         MD5Update (context, PADDING, padLen);
  214 
  215         /* Append length (before padding) */
  216         MD5Update (context, bits, 8);
  217 
  218         /* Store state in digest */
  219         Encode (digest, context->state, 16);
  220 
  221         /* Zeroize sensitive information. */
  222         memset ((void *)context, 0, sizeof (*context));
  223 }
  224 
  225 /* MD5 basic transformation. Transforms state based on block. */
  226 
  227 static void
  228 MD5Transform (state, block)
  229         u_int32_t state[4];
  230         const unsigned char block[64];
  231 {
  232         u_int32_t a = state[0], b = state[1], c = state[2], d = state[3], x[16];
  233 
  234         Decode (x, block, 64);
  235 
  236         /* Round 1 */
  237 #define S11 7
  238 #define S12 12
  239 #define S13 17
  240 #define S14 22
  241         FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
  242         FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
  243         FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
  244         FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
  245         FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
  246         FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
  247         FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
  248         FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
  249         FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
  250         FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
  251         FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
  252         FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
  253         FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
  254         FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
  255         FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
  256         FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
  257 
  258         /* Round 2 */
  259 #define S21 5
  260 #define S22 9
  261 #define S23 14
  262 #define S24 20
  263         GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
  264         GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
  265         GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
  266         GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
  267         GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
  268         GG (d, a, b, c, x[10], S22,  0x2441453); /* 22 */
  269         GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
  270         GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
  271         GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
  272         GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
  273         GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
  274         GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
  275         GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
  276         GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
  277         GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
  278         GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
  279 
  280         /* Round 3 */
  281 #define S31 4
  282 #define S32 11
  283 #define S33 16
  284 #define S34 23
  285         HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
  286         HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
  287         HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
  288         HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
  289         HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
  290         HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
  291         HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
  292         HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
  293         HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
  294         HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
  295         HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
  296         HH (b, c, d, a, x[ 6], S34,  0x4881d05); /* 44 */
  297         HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
  298         HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
  299         HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
  300         HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
  301 
  302         /* Round 4 */
  303 #define S41 6
  304 #define S42 10
  305 #define S43 15
  306 #define S44 21
  307         II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
  308         II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
  309         II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
  310         II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
  311         II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
  312         II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
  313         II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
  314         II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
  315         II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
  316         II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
  317         II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
  318         II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
  319         II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
  320         II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
  321         II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
  322         II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
  323 
  324         state[0] += a;
  325         state[1] += b;
  326         state[2] += c;
  327         state[3] += d;
  328 
  329         /* Zeroize sensitive information. */
  330         memset ((void *)x, 0, sizeof (x));
  331 }

Cache object: 31e5c27a8ad1912f7144b93176ffb343


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]


This page is part of the FreeBSD/Linux Linux Kernel Cross-Reference, and was automatically generated using a modified version of the LXR engine.