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

Cache object: 47274aa3ba35d2bcbf9693ea93a60672


[ 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.