md5.c 9.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293
  1. /*
  2. * Copyright (c) 2007, Cameron Rich
  3. *
  4. * All rights reserved.
  5. *
  6. * Redistribution and use in source and binary forms, with or without
  7. * modification, are permitted provided that the following conditions are met:
  8. *
  9. * * Redistributions of source code must retain the above copyright notice,
  10. * this list of conditions and the following disclaimer.
  11. * * Redistributions in binary form must reproduce the above copyright notice,
  12. * this list of conditions and the following disclaimer in the documentation
  13. * and/or other materials provided with the distribution.
  14. * * Neither the name of the axTLS project nor the names of its contributors
  15. * may be used to endorse or promote products derived from this software
  16. * without specific prior written permission.
  17. *
  18. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  19. * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  20. * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  21. * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
  22. * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
  23. * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
  24. * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
  25. * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
  26. * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
  27. * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  28. * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  29. */
  30. /**
  31. * This file implements the MD5 algorithm as defined in RFC1321
  32. */
  33. #include <string.h>
  34. #include "crypto.h"
  35. /* Constants for MD5Transform routine.
  36. */
  37. #define S11 7
  38. #define S12 12
  39. #define S13 17
  40. #define S14 22
  41. #define S21 5
  42. #define S22 9
  43. #define S23 14
  44. #define S24 20
  45. #define S31 4
  46. #define S32 11
  47. #define S33 16
  48. #define S34 23
  49. #define S41 6
  50. #define S42 10
  51. #define S43 15
  52. #define S44 21
  53. /* ----- static functions ----- */
  54. static void MD5Transform(uint32_t state[4], const uint8_t block[64]);
  55. static void Encode(uint8_t *output, uint32_t *input, uint32_t len);
  56. static void Decode(uint32_t *output, const uint8_t *input, uint32_t len);
  57. static const uint8_t PADDING[64] =
  58. {
  59. 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  60. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  61. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
  62. };
  63. /* F, G, H and I are basic MD5 functions.
  64. */
  65. #define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
  66. #define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
  67. #define H(x, y, z) ((x) ^ (y) ^ (z))
  68. #define I(x, y, z) ((y) ^ ((x) | (~z)))
  69. /* ROTATE_LEFT rotates x left n bits. */
  70. #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
  71. /* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
  72. Rotation is separate from addition to prevent recomputation. */
  73. #define FF(a, b, c, d, x, s, ac) { \
  74. (a) += F ((b), (c), (d)) + (x) + (uint32_t)(ac); \
  75. (a) = ROTATE_LEFT ((a), (s)); \
  76. (a) += (b); \
  77. }
  78. #define GG(a, b, c, d, x, s, ac) { \
  79. (a) += G ((b), (c), (d)) + (x) + (uint32_t)(ac); \
  80. (a) = ROTATE_LEFT ((a), (s)); \
  81. (a) += (b); \
  82. }
  83. #define HH(a, b, c, d, x, s, ac) { \
  84. (a) += H ((b), (c), (d)) + (x) + (uint32_t)(ac); \
  85. (a) = ROTATE_LEFT ((a), (s)); \
  86. (a) += (b); \
  87. }
  88. #define II(a, b, c, d, x, s, ac) { \
  89. (a) += I ((b), (c), (d)) + (x) + (uint32_t)(ac); \
  90. (a) = ROTATE_LEFT ((a), (s)); \
  91. (a) += (b); \
  92. }
  93. /**
  94. * MD5 initialization - begins an MD5 operation, writing a new ctx.
  95. */
  96. EXP_FUNC void STDCALL MD5_Init(MD5_CTX *ctx)
  97. {
  98. ctx->count[0] = ctx->count[1] = 0;
  99. /* Load magic initialization constants.
  100. */
  101. ctx->state[0] = 0x67452301;
  102. ctx->state[1] = 0xefcdab89;
  103. ctx->state[2] = 0x98badcfe;
  104. ctx->state[3] = 0x10325476;
  105. }
  106. /**
  107. * Accepts an array of octets as the next portion of the message.
  108. */
  109. EXP_FUNC void STDCALL MD5_Update(MD5_CTX *ctx, const uint8_t * msg, int len)
  110. {
  111. uint32_t x;
  112. int i, partLen;
  113. /* Compute number of bytes mod 64 */
  114. x = (uint32_t)((ctx->count[0] >> 3) & 0x3F);
  115. /* Update number of bits */
  116. if ((ctx->count[0] += ((uint32_t)len << 3)) < ((uint32_t)len << 3))
  117. ctx->count[1]++;
  118. ctx->count[1] += ((uint32_t)len >> 29);
  119. partLen = 64 - x;
  120. /* Transform as many times as possible. */
  121. if (len >= partLen)
  122. {
  123. memcpy(&ctx->buffer[x], msg, partLen);
  124. MD5Transform(ctx->state, ctx->buffer);
  125. for (i = partLen; i + 63 < len; i += 64)
  126. MD5Transform(ctx->state, &msg[i]);
  127. x = 0;
  128. }
  129. else
  130. i = 0;
  131. /* Buffer remaining input */
  132. memcpy(&ctx->buffer[x], &msg[i], len-i);
  133. }
  134. /**
  135. * Return the 128-bit message digest into the user's array
  136. */
  137. EXP_FUNC void STDCALL MD5_Final(uint8_t *digest, MD5_CTX *ctx)
  138. {
  139. uint8_t bits[8];
  140. uint32_t x, padLen;
  141. /* Save number of bits */
  142. Encode(bits, ctx->count, 8);
  143. /* Pad out to 56 mod 64.
  144. */
  145. x = (uint32_t)((ctx->count[0] >> 3) & 0x3f);
  146. padLen = (x < 56) ? (56 - x) : (120 - x);
  147. MD5_Update(ctx, PADDING, padLen);
  148. /* Append length (before padding) */
  149. MD5_Update(ctx, bits, 8);
  150. /* Store state in digest */
  151. Encode(digest, ctx->state, MD5_SIZE);
  152. }
  153. /**
  154. * MD5 basic transformation. Transforms state based on block.
  155. */
  156. static void MD5Transform(uint32_t state[4], const uint8_t block[64])
  157. {
  158. uint32_t a = state[0], b = state[1], c = state[2],
  159. d = state[3], x[MD5_SIZE];
  160. Decode(x, block, 64);
  161. /* Round 1 */
  162. FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
  163. FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
  164. FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
  165. FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
  166. FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
  167. FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
  168. FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
  169. FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
  170. FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
  171. FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
  172. FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
  173. FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
  174. FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
  175. FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
  176. FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
  177. FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
  178. /* Round 2 */
  179. GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
  180. GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
  181. GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
  182. GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
  183. GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
  184. GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */
  185. GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
  186. GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
  187. GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
  188. GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
  189. GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
  190. GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
  191. GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
  192. GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
  193. GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
  194. GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
  195. /* Round 3 */
  196. HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
  197. HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
  198. HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
  199. HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
  200. HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
  201. HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
  202. HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
  203. HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
  204. HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
  205. HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
  206. HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
  207. HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */
  208. HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
  209. HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
  210. HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
  211. HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
  212. /* Round 4 */
  213. II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
  214. II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
  215. II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
  216. II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
  217. II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
  218. II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
  219. II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
  220. II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
  221. II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
  222. II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
  223. II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
  224. II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
  225. II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
  226. II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
  227. II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
  228. II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
  229. state[0] += a;
  230. state[1] += b;
  231. state[2] += c;
  232. state[3] += d;
  233. }
  234. /**
  235. * Encodes input (uint32_t) into output (uint8_t). Assumes len is
  236. * a multiple of 4.
  237. */
  238. static void Encode(uint8_t *output, uint32_t *input, uint32_t len)
  239. {
  240. uint32_t i, j;
  241. for (i = 0, j = 0; j < len; i++, j += 4)
  242. {
  243. output[j] = (uint8_t)(input[i] & 0xff);
  244. output[j+1] = (uint8_t)((input[i] >> 8) & 0xff);
  245. output[j+2] = (uint8_t)((input[i] >> 16) & 0xff);
  246. output[j+3] = (uint8_t)((input[i] >> 24) & 0xff);
  247. }
  248. }
  249. /**
  250. * Decodes input (uint8_t) into output (uint32_t). Assumes len is
  251. * a multiple of 4.
  252. */
  253. static void Decode(uint32_t *output, const uint8_t *input, uint32_t len)
  254. {
  255. uint32_t i, j;
  256. for (i = 0, j = 0; j < len; i++, j += 4)
  257. output[i] = ((uint32_t)input[j]) | (((uint32_t)input[j+1]) << 8) |
  258. (((uint32_t)input[j+2]) << 16) | (((uint32_t)input[j+3]) << 24);
  259. }