1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/os/ossrv/stdlibs/libcrypt/src/libmd/md5c.c Fri Jun 15 03:10:57 2012 +0200
1.3 @@ -0,0 +1,399 @@
1.4 +/*
1.5 + * © Portions copyright (c) 2005-2006 Nokia Corporation.
1.6 + * All rights reserved.
1.7 + *
1.8 + * MD5C.C - RSA Data Security, Inc., MD5 message-digest algorithm
1.9 + *
1.10 + * Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
1.11 + * rights reserved.
1.12 + *
1.13 + * License to copy and use this software is granted provided that it
1.14 + * is identified as the "RSA Data Security, Inc. MD5 Message-Digest
1.15 + * Algorithm" in all material mentioning or referencing this software
1.16 + * or this function.
1.17 + *
1.18 + * License is also granted to make and use derivative works provided
1.19 + * that such works are identified as "derived from the RSA Data
1.20 + * Security, Inc. MD5 Message-Digest Algorithm" in all material
1.21 + * mentioning or referencing the derived work.
1.22 + *
1.23 + * RSA Data Security, Inc. makes no representations concerning either
1.24 + * the merchantability of this software or the suitability of this
1.25 + * software for any particular purpose. It is provided "as is"
1.26 + * without express or implied warranty of any kind.
1.27 + *
1.28 + * These notices must be retained in any copies of any part of this
1.29 + * documentation and/or software.
1.30 + *
1.31 + * This code is the same as the code published by RSA Inc. It has been
1.32 + * edited for clarity and style only.
1.33 + */
1.34 +
1.35 +#ifndef EMULATOR
1.36 +#define EMULATOR ((defined(__WINS__) || defined(__WINSCW__)))
1.37 +#endif
1.38 +
1.39 +#ifdef SYMBIAN
1.40 +#include <sys/types.h>
1.41 +#include <string.h>
1.42 +#include <arpa/inet.h>
1.43 +#include <sys/md5.h>
1.44 +
1.45 +#else
1.46 +
1.47 +#include <sys/cdefs.h>
1.48 +__FBSDID("$FreeBSD: src/lib/libmd/md5c.c,v 1.16 2003/06/05 13:17:32 markm Exp $");
1.49 +
1.50 +#include <sys/types.h>
1.51 +
1.52 +#ifdef _KERNEL
1.53 +#include <sys/systm.h>
1.54 +#else
1.55 +#include <string.h>
1.56 +#endif
1.57 +
1.58 +#include <machine/endian.h>
1.59 +#include <sys/endian.h>
1.60 +#include <sys/md5.h>
1.61 +
1.62 +#endif /* end ifdef SYMBIAN */
1.63 +
1.64 +static void MD5Transform(u_int32_t [4], const unsigned char [64]);
1.65 +
1.66 +#ifndef SYMBIAN
1.67 +
1.68 +#ifdef _KERNEL
1.69 +#define memset(x,y,z) bzero(x,z);
1.70 +#define memcpy(x,y,z) bcopy(y, x, z)
1.71 +#endif
1.72 +
1.73 +#endif /* end ifndef SYMBIAN */
1.74 +
1.75 +#ifdef SYMBIAN
1.76 +
1.77 +/* Since EPOC32 is little-endian, Encode and Decode are defined to be
1.78 + * memcpy()
1.79 + */
1.80 +#define Encode memcpy
1.81 +#define Decode memcpy
1.82 +#else
1.83 +
1.84 +#if (BYTE_ORDER == LITTLE_ENDIAN)
1.85 +#define Encode memcpy
1.86 +#define Decode memcpy
1.87 +#else
1.88 +
1.89 +/*
1.90 + * Encodes input (u_int32_t) into output (unsigned char). Assumes len is
1.91 + * a multiple of 4.
1.92 + */
1.93 +
1.94 +static void
1.95 +Encode (unsigned char *output, u_int32_t *input, unsigned int len)
1.96 +{
1.97 + unsigned int i;
1.98 + u_int32_t *op = (u_int32_t *)output;
1.99 +
1.100 + for (i = 0; i < len / 4; i++)
1.101 + op[i] = htole32(input[i]);
1.102 +}
1.103 +
1.104 +/*
1.105 + * Decodes input (unsigned char) into output (u_int32_t). Assumes len is
1.106 + * a multiple of 4.
1.107 + */
1.108 +
1.109 +static void
1.110 +Decode (u_int32_t *output, const unsigned char *input, unsigned int len)
1.111 +{
1.112 + unsigned int i;
1.113 + const u_int32_t *ip = (const u_int32_t *)input;
1.114 +
1.115 + for (i = 0; i < len / 4; i++)
1.116 + output[i] = le32toh(ip[i]);
1.117 +}
1.118 +#endif
1.119 +
1.120 +#endif /* ifdef SYMBIAN */
1.121 +
1.122 +#if !EMULATOR
1.123 +static unsigned char PADDING[64] = {
1.124 + 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
1.125 + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
1.126 + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
1.127 +};
1.128 +#else
1.129 +const unsigned char PADDING[64] = {
1.130 + 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
1.131 + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
1.132 + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
1.133 +};
1.134 +#endif
1.135 +
1.136 +/* F, G, H and I are basic MD5 functions. */
1.137 +#define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
1.138 +#define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
1.139 +#define H(x, y, z) ((x) ^ (y) ^ (z))
1.140 +#define I(x, y, z) ((y) ^ ((x) | (~z)))
1.141 +
1.142 +/* ROTATE_LEFT rotates x left n bits. */
1.143 +#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
1.144 +
1.145 +/*
1.146 + * FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
1.147 + * Rotation is separate from addition to prevent recomputation.
1.148 + */
1.149 +#define FF(a, b, c, d, x, s, ac) { \
1.150 + (a) += F ((b), (c), (d)) + (x) + (u_int32_t)(ac); \
1.151 + (a) = ROTATE_LEFT ((a), (s)); \
1.152 + (a) += (b); \
1.153 + }
1.154 +#define GG(a, b, c, d, x, s, ac) { \
1.155 + (a) += G ((b), (c), (d)) + (x) + (u_int32_t)(ac); \
1.156 + (a) = ROTATE_LEFT ((a), (s)); \
1.157 + (a) += (b); \
1.158 + }
1.159 +#define HH(a, b, c, d, x, s, ac) { \
1.160 + (a) += H ((b), (c), (d)) + (x) + (u_int32_t)(ac); \
1.161 + (a) = ROTATE_LEFT ((a), (s)); \
1.162 + (a) += (b); \
1.163 + }
1.164 +#define II(a, b, c, d, x, s, ac) { \
1.165 + (a) += I ((b), (c), (d)) + (x) + (u_int32_t)(ac); \
1.166 + (a) = ROTATE_LEFT ((a), (s)); \
1.167 + (a) += (b); \
1.168 + }
1.169 +
1.170 +/* MD5 initialization. Begins an MD5 operation, writing a new context. */
1.171 +#ifdef SYMBIAN
1.172 +void MD5Init (MD5_CTX *context)
1.173 +{
1.174 +#else
1.175 +void
1.176 +MD5Init (context)
1.177 + MD5_CTX *context;
1.178 +{
1.179 +#endif
1.180 +
1.181 + context->count[0] = context->count[1] = 0;
1.182 +
1.183 + /* Load magic initialization constants. */
1.184 + context->state[0] = 0x67452301;
1.185 + context->state[1] = 0xefcdab89;
1.186 + context->state[2] = 0x98badcfe;
1.187 + context->state[3] = 0x10325476;
1.188 +}
1.189 +
1.190 +/*
1.191 + * MD5 block update operation. Continues an MD5 message-digest
1.192 + * operation, processing another message block, and updating the
1.193 + * context.
1.194 + */
1.195 +#ifdef SYMBIAN
1.196 +void MD5Update(MD5_CTX *context, const unsigned char *input, unsigned int inputLen)
1.197 +{
1.198 +#else
1.199 +void
1.200 +MD5Update (context, input, inputLen)
1.201 + MD5_CTX *context;
1.202 + const unsigned char *input;
1.203 + unsigned int inputLen;
1.204 +{
1.205 +#endif
1.206 + unsigned int i, idx, partLen;
1.207 +
1.208 + /* Compute number of bytes mod 64 */
1.209 + idx = (unsigned int)((context->count[0] >> 3) & 0x3F);
1.210 +
1.211 + /* Update number of bits */
1.212 + if ((context->count[0] += ((u_int32_t)inputLen << 3))
1.213 + < ((u_int32_t)inputLen << 3))
1.214 + context->count[1]++;
1.215 + context->count[1] += ((u_int32_t)inputLen >> 29);
1.216 +
1.217 + partLen = 64 - idx;
1.218 +
1.219 + /* Transform as many times as possible. */
1.220 + if (inputLen >= partLen) {
1.221 + memcpy((void *)&context->buffer[idx], (const void *)input,
1.222 + partLen);
1.223 + MD5Transform (context->state, context->buffer);
1.224 +
1.225 + for (i = partLen; i + 63 < inputLen; i += 64)
1.226 + MD5Transform (context->state, &input[i]);
1.227 +
1.228 + idx = 0;
1.229 + }
1.230 + else
1.231 + i = 0;
1.232 +
1.233 + /* Buffer remaining input */
1.234 + memcpy ((void *)&context->buffer[idx], (const void *)&input[i],
1.235 + inputLen-i);
1.236 +}
1.237 +
1.238 +/*
1.239 + * MD5 padding. Adds padding followed by original length.
1.240 + */
1.241 +
1.242 +#ifdef SYMBIAN
1.243 +void MD5Pad (MD5_CTX *context)
1.244 +{
1.245 +#else
1.246 +void
1.247 +MD5Pad (context)
1.248 + MD5_CTX *context;
1.249 +{
1.250 +#endif
1.251 +
1.252 + unsigned char bits[8];
1.253 + unsigned int idx, padLen;
1.254 +
1.255 + /* Save number of bits */
1.256 + Encode (bits, context->count, 8);
1.257 +
1.258 + /* Pad out to 56 mod 64. */
1.259 + idx = (unsigned int)((context->count[0] >> 3) & 0x3f);
1.260 + padLen = (idx < 56) ? (56 - idx) : (120 - idx);
1.261 + MD5Update (context, PADDING, padLen);
1.262 +
1.263 + /* Append length (before padding) */
1.264 + MD5Update (context, bits, 8);
1.265 +}
1.266 +
1.267 +/*
1.268 + * MD5 finalization. Ends an MD5 message-digest operation, writing the
1.269 + * the message digest and zeroizing the context.
1.270 + */
1.271 +#ifdef SYMBIAN
1.272 +void MD5Final (unsigned char digest[16], MD5_CTX *context)
1.273 +{
1.274 +#else
1.275 +void
1.276 +MD5Final (digest, context)
1.277 + unsigned char digest[16];
1.278 + MD5_CTX *context;
1.279 +{
1.280 +#endif
1.281 + /* Do padding. */
1.282 + MD5Pad (context);
1.283 +
1.284 + /* Store state in digest */
1.285 + Encode (digest, context->state, 16);
1.286 +
1.287 + /* Zeroize sensitive information. */
1.288 + memset ((void *)context, 0, sizeof (*context));
1.289 +}
1.290 +
1.291 +/* MD5 basic transformation. Transforms state based on block. */
1.292 +
1.293 +#ifdef SYMBIAN
1.294 +static void MD5Transform ( u_int32_t state[4], const unsigned char block[64])
1.295 +{
1.296 +#else
1.297 +static void
1.298 +MD5Transform (state, block)
1.299 + u_int32_t state[4];
1.300 + const unsigned char block[64];
1.301 +{
1.302 +#endif
1.303 + u_int32_t a = state[0], b = state[1], c = state[2], d = state[3], x[16];
1.304 +
1.305 + Decode (x, block, 64);
1.306 +
1.307 + /* Round 1 */
1.308 +#define S11 7
1.309 +#define S12 12
1.310 +#define S13 17
1.311 +#define S14 22
1.312 + FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
1.313 + FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
1.314 + FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
1.315 + FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
1.316 + FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
1.317 + FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
1.318 + FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
1.319 + FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
1.320 + FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
1.321 + FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
1.322 + FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
1.323 + FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
1.324 + FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
1.325 + FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
1.326 + FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
1.327 + FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
1.328 +
1.329 + /* Round 2 */
1.330 +#define S21 5
1.331 +#define S22 9
1.332 +#define S23 14
1.333 +#define S24 20
1.334 + GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
1.335 + GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
1.336 + GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
1.337 + GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
1.338 + GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
1.339 + GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */
1.340 + GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
1.341 + GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
1.342 + GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
1.343 + GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
1.344 + GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
1.345 + GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
1.346 + GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
1.347 + GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
1.348 + GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
1.349 + GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
1.350 +
1.351 + /* Round 3 */
1.352 +#define S31 4
1.353 +#define S32 11
1.354 +#define S33 16
1.355 +#define S34 23
1.356 + HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
1.357 + HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
1.358 + HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
1.359 + HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
1.360 + HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
1.361 + HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
1.362 + HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
1.363 + HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
1.364 + HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
1.365 + HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
1.366 + HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
1.367 + HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */
1.368 + HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
1.369 + HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
1.370 + HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
1.371 + HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
1.372 +
1.373 + /* Round 4 */
1.374 +#define S41 6
1.375 +#define S42 10
1.376 +#define S43 15
1.377 +#define S44 21
1.378 + II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
1.379 + II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
1.380 + II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
1.381 + II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
1.382 + II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
1.383 + II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
1.384 + II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
1.385 + II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
1.386 + II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
1.387 + II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
1.388 + II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
1.389 + II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
1.390 + II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
1.391 + II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
1.392 + II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
1.393 + II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
1.394 +
1.395 + state[0] += a;
1.396 + state[1] += b;
1.397 + state[2] += c;
1.398 + state[3] += d;
1.399 +
1.400 + /* Zeroize sensitive information. */
1.401 + memset ((void *)x, 0, sizeof (x));
1.402 +}