tiny_md5.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367
  1. /*
  2. * RFC 1321 compliant MD5 implementation
  3. *
  4. * Based on TropicSSL: Copyright (C) 2017 Shanghai Real-Thread Technology Co., Ltd
  5. *
  6. * Based on XySSL: Copyright (C) 2006-2008 Christophe Devine
  7. *
  8. * Copyright (C) 2009 Paul Bakker <polarssl_maintainer at polarssl dot org>
  9. *
  10. * All rights reserved.
  11. *
  12. * Redistribution and use in source and binary forms, with or without
  13. * modification, are permitted provided that the following conditions
  14. * are met:
  15. *
  16. * * Redistributions of source code must retain the above copyright
  17. * notice, this list of conditions and the following disclaimer.
  18. * * Redistributions in binary form must reproduce the above copyright
  19. * notice, this list of conditions and the following disclaimer in the
  20. * documentation and/or other materials provided with the distribution.
  21. * * Neither the names of PolarSSL or XySSL nor the names of its contributors
  22. * may be used to endorse or promote products derived from this software
  23. * without specific prior written permission.
  24. *
  25. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  26. * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  27. * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
  28. * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  29. * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  30. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
  31. * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
  32. * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
  33. * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
  34. * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  35. * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  36. */
  37. /*
  38. * The MD5 algorithm was designed by Ron Rivest in 1991.
  39. *
  40. * http://www.ietf.org/rfc/rfc1321.txt
  41. */
  42. #include "tinycrypt_config.h"
  43. #if defined(TINY_CRYPT_MD5)
  44. #include "tinycrypt.h"
  45. #include <string.h>
  46. #include <stdio.h>
  47. /*
  48. * 32-bit integer manipulation macros (little endian)
  49. */
  50. #ifndef GET_ULONG_LE
  51. #define GET_ULONG_LE(n,b,i) \
  52. { \
  53. (n) = ( (uint32_t) (b)[(i) ] ) \
  54. | ( (uint32_t) (b)[(i) + 1] << 8 ) \
  55. | ( (uint32_t) (b)[(i) + 2] << 16 ) \
  56. | ( (uint32_t) (b)[(i) + 3] << 24 ); \
  57. }
  58. #endif
  59. #ifndef PUT_ULONG_LE
  60. #define PUT_ULONG_LE(n,b,i) \
  61. { \
  62. (b)[(i) ] = (uint8_t) ( (n) ); \
  63. (b)[(i) + 1] = (uint8_t) ( (n) >> 8 ); \
  64. (b)[(i) + 2] = (uint8_t) ( (n) >> 16 ); \
  65. (b)[(i) + 3] = (uint8_t) ( (n) >> 24 ); \
  66. }
  67. #endif
  68. /*
  69. * MD5 context setup
  70. */
  71. void tiny_md5_starts(tiny_md5_context * ctx)
  72. {
  73. ctx->total[0] = 0;
  74. ctx->total[1] = 0;
  75. ctx->state[0] = 0x67452301;
  76. ctx->state[1] = 0xEFCDAB89;
  77. ctx->state[2] = 0x98BADCFE;
  78. ctx->state[3] = 0x10325476;
  79. }
  80. static void md5_process(tiny_md5_context * ctx, uint8_t data[64])
  81. {
  82. uint32_t X[16], A, B, C, D;
  83. GET_ULONG_LE(X[0], data, 0);
  84. GET_ULONG_LE(X[1], data, 4);
  85. GET_ULONG_LE(X[2], data, 8);
  86. GET_ULONG_LE(X[3], data, 12);
  87. GET_ULONG_LE(X[4], data, 16);
  88. GET_ULONG_LE(X[5], data, 20);
  89. GET_ULONG_LE(X[6], data, 24);
  90. GET_ULONG_LE(X[7], data, 28);
  91. GET_ULONG_LE(X[8], data, 32);
  92. GET_ULONG_LE(X[9], data, 36);
  93. GET_ULONG_LE(X[10], data, 40);
  94. GET_ULONG_LE(X[11], data, 44);
  95. GET_ULONG_LE(X[12], data, 48);
  96. GET_ULONG_LE(X[13], data, 52);
  97. GET_ULONG_LE(X[14], data, 56);
  98. GET_ULONG_LE(X[15], data, 60);
  99. #define S(x,n) ((x << n) | ((x & 0xFFFFFFFF) >> (32 - n)))
  100. #define P(a,b,c,d,k,s,t) \
  101. { \
  102. a += F(b,c,d) + X[k] + t; a = S(a,s) + b; \
  103. }
  104. A = ctx->state[0];
  105. B = ctx->state[1];
  106. C = ctx->state[2];
  107. D = ctx->state[3];
  108. #define F(x,y,z) (z ^ (x & (y ^ z)))
  109. P(A, B, C, D, 0, 7, 0xD76AA478);
  110. P(D, A, B, C, 1, 12, 0xE8C7B756);
  111. P(C, D, A, B, 2, 17, 0x242070DB);
  112. P(B, C, D, A, 3, 22, 0xC1BDCEEE);
  113. P(A, B, C, D, 4, 7, 0xF57C0FAF);
  114. P(D, A, B, C, 5, 12, 0x4787C62A);
  115. P(C, D, A, B, 6, 17, 0xA8304613);
  116. P(B, C, D, A, 7, 22, 0xFD469501);
  117. P(A, B, C, D, 8, 7, 0x698098D8);
  118. P(D, A, B, C, 9, 12, 0x8B44F7AF);
  119. P(C, D, A, B, 10, 17, 0xFFFF5BB1);
  120. P(B, C, D, A, 11, 22, 0x895CD7BE);
  121. P(A, B, C, D, 12, 7, 0x6B901122);
  122. P(D, A, B, C, 13, 12, 0xFD987193);
  123. P(C, D, A, B, 14, 17, 0xA679438E);
  124. P(B, C, D, A, 15, 22, 0x49B40821);
  125. #undef F
  126. #define F(x,y,z) (y ^ (z & (x ^ y)))
  127. P(A, B, C, D, 1, 5, 0xF61E2562);
  128. P(D, A, B, C, 6, 9, 0xC040B340);
  129. P(C, D, A, B, 11, 14, 0x265E5A51);
  130. P(B, C, D, A, 0, 20, 0xE9B6C7AA);
  131. P(A, B, C, D, 5, 5, 0xD62F105D);
  132. P(D, A, B, C, 10, 9, 0x02441453);
  133. P(C, D, A, B, 15, 14, 0xD8A1E681);
  134. P(B, C, D, A, 4, 20, 0xE7D3FBC8);
  135. P(A, B, C, D, 9, 5, 0x21E1CDE6);
  136. P(D, A, B, C, 14, 9, 0xC33707D6);
  137. P(C, D, A, B, 3, 14, 0xF4D50D87);
  138. P(B, C, D, A, 8, 20, 0x455A14ED);
  139. P(A, B, C, D, 13, 5, 0xA9E3E905);
  140. P(D, A, B, C, 2, 9, 0xFCEFA3F8);
  141. P(C, D, A, B, 7, 14, 0x676F02D9);
  142. P(B, C, D, A, 12, 20, 0x8D2A4C8A);
  143. #undef F
  144. #define F(x,y,z) (x ^ y ^ z)
  145. P(A, B, C, D, 5, 4, 0xFFFA3942);
  146. P(D, A, B, C, 8, 11, 0x8771F681);
  147. P(C, D, A, B, 11, 16, 0x6D9D6122);
  148. P(B, C, D, A, 14, 23, 0xFDE5380C);
  149. P(A, B, C, D, 1, 4, 0xA4BEEA44);
  150. P(D, A, B, C, 4, 11, 0x4BDECFA9);
  151. P(C, D, A, B, 7, 16, 0xF6BB4B60);
  152. P(B, C, D, A, 10, 23, 0xBEBFBC70);
  153. P(A, B, C, D, 13, 4, 0x289B7EC6);
  154. P(D, A, B, C, 0, 11, 0xEAA127FA);
  155. P(C, D, A, B, 3, 16, 0xD4EF3085);
  156. P(B, C, D, A, 6, 23, 0x04881D05);
  157. P(A, B, C, D, 9, 4, 0xD9D4D039);
  158. P(D, A, B, C, 12, 11, 0xE6DB99E5);
  159. P(C, D, A, B, 15, 16, 0x1FA27CF8);
  160. P(B, C, D, A, 2, 23, 0xC4AC5665);
  161. #undef F
  162. #define F(x,y,z) (y ^ (x | ~z))
  163. P(A, B, C, D, 0, 6, 0xF4292244);
  164. P(D, A, B, C, 7, 10, 0x432AFF97);
  165. P(C, D, A, B, 14, 15, 0xAB9423A7);
  166. P(B, C, D, A, 5, 21, 0xFC93A039);
  167. P(A, B, C, D, 12, 6, 0x655B59C3);
  168. P(D, A, B, C, 3, 10, 0x8F0CCC92);
  169. P(C, D, A, B, 10, 15, 0xFFEFF47D);
  170. P(B, C, D, A, 1, 21, 0x85845DD1);
  171. P(A, B, C, D, 8, 6, 0x6FA87E4F);
  172. P(D, A, B, C, 15, 10, 0xFE2CE6E0);
  173. P(C, D, A, B, 6, 15, 0xA3014314);
  174. P(B, C, D, A, 13, 21, 0x4E0811A1);
  175. P(A, B, C, D, 4, 6, 0xF7537E82);
  176. P(D, A, B, C, 11, 10, 0xBD3AF235);
  177. P(C, D, A, B, 2, 15, 0x2AD7D2BB);
  178. P(B, C, D, A, 9, 21, 0xEB86D391);
  179. #undef F
  180. ctx->state[0] += A;
  181. ctx->state[1] += B;
  182. ctx->state[2] += C;
  183. ctx->state[3] += D;
  184. }
  185. /*
  186. * MD5 process buffer
  187. */
  188. void tiny_md5_update(tiny_md5_context * ctx, uint8_t *input, int ilen)
  189. {
  190. int fill;
  191. uint32_t left;
  192. if (ilen <= 0)
  193. return;
  194. left = ctx->total[0] & 0x3F;
  195. fill = 64 - left;
  196. ctx->total[0] += ilen;
  197. ctx->total[0] &= 0xFFFFFFFF;
  198. if (ctx->total[0] < (uint32_t)ilen)
  199. ctx->total[1]++;
  200. if (left && ilen >= fill) {
  201. memcpy((void *)(ctx->buffer + left), (void *)input, fill);
  202. md5_process(ctx, ctx->buffer);
  203. input += fill;
  204. ilen -= fill;
  205. left = 0;
  206. }
  207. while (ilen >= 64) {
  208. md5_process(ctx, input);
  209. input += 64;
  210. ilen -= 64;
  211. }
  212. if (ilen > 0) {
  213. memcpy((void *)(ctx->buffer + left), (void *)input, ilen);
  214. }
  215. }
  216. static const uint8_t md5_padding[64] = {
  217. 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  218. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  219. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  220. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
  221. };
  222. /*
  223. * MD5 final digest
  224. */
  225. void tiny_md5_finish(tiny_md5_context * ctx, uint8_t output[16])
  226. {
  227. uint32_t last, padn;
  228. uint32_t high, low;
  229. uint8_t msglen[8];
  230. high = (ctx->total[0] >> 29)
  231. | (ctx->total[1] << 3);
  232. low = (ctx->total[0] << 3);
  233. PUT_ULONG_LE(low, msglen, 0);
  234. PUT_ULONG_LE(high, msglen, 4);
  235. last = ctx->total[0] & 0x3F;
  236. padn = (last < 56) ? (56 - last) : (120 - last);
  237. tiny_md5_update(ctx, (uint8_t *)md5_padding, padn);
  238. tiny_md5_update(ctx, msglen, 8);
  239. PUT_ULONG_LE(ctx->state[0], output, 0);
  240. PUT_ULONG_LE(ctx->state[1], output, 4);
  241. PUT_ULONG_LE(ctx->state[2], output, 8);
  242. PUT_ULONG_LE(ctx->state[3], output, 12);
  243. }
  244. /*
  245. * output = MD5( input buffer )
  246. */
  247. void tiny_md5(uint8_t *input, int ilen, uint8_t output[16])
  248. {
  249. tiny_md5_context ctx;
  250. tiny_md5_starts(&ctx);
  251. tiny_md5_update(&ctx, input, ilen);
  252. tiny_md5_finish(&ctx, output);
  253. memset(&ctx, 0, sizeof(tiny_md5_context));
  254. }
  255. /*
  256. * MD5 HMAC context setup
  257. */
  258. void tiny_md5_hmac_starts(tiny_md5_context * ctx, uint8_t *key, int keylen)
  259. {
  260. int i;
  261. uint8_t sum[16];
  262. if (keylen > 64) {
  263. tiny_md5(key, keylen, sum);
  264. keylen = 16;
  265. key = sum;
  266. }
  267. memset(ctx->ipad, 0x36, 64);
  268. memset(ctx->opad, 0x5C, 64);
  269. for (i = 0; i < keylen; i++) {
  270. ctx->ipad[i] = (uint8_t)(ctx->ipad[i] ^ key[i]);
  271. ctx->opad[i] = (uint8_t)(ctx->opad[i] ^ key[i]);
  272. }
  273. tiny_md5_starts(ctx);
  274. tiny_md5_update(ctx, ctx->ipad, 64);
  275. memset(sum, 0, sizeof(sum));
  276. }
  277. /*
  278. * MD5 HMAC process buffer
  279. */
  280. void tiny_md5_hmac_update(tiny_md5_context * ctx, uint8_t *input, int ilen)
  281. {
  282. tiny_md5_update(ctx, input, ilen);
  283. }
  284. /*
  285. * MD5 HMAC final digest
  286. */
  287. void tiny_md5_hmac_finish(tiny_md5_context * ctx, uint8_t output[16])
  288. {
  289. uint8_t tmpbuf[16];
  290. tiny_md5_finish(ctx, tmpbuf);
  291. tiny_md5_starts(ctx);
  292. tiny_md5_update(ctx, ctx->opad, 64);
  293. tiny_md5_update(ctx, tmpbuf, 16);
  294. tiny_md5_finish(ctx, output);
  295. memset(tmpbuf, 0, sizeof(tmpbuf));
  296. }
  297. /*
  298. * output = HMAC-MD5( hmac key, input buffer )
  299. */
  300. void tiny_md5_hmac(uint8_t *key, int keylen, uint8_t *input, int ilen,
  301. uint8_t output[16])
  302. {
  303. tiny_md5_context ctx;
  304. tiny_md5_hmac_starts(&ctx, key, keylen);
  305. tiny_md5_hmac_update(&ctx, input, ilen);
  306. tiny_md5_hmac_finish(&ctx, output);
  307. memset(&ctx, 0, sizeof(tiny_md5_context));
  308. }
  309. #endif