md5.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308
  1. /* $KAME: md5.c,v 1.5 2000/11/08 06:13:08 itojun Exp $ */
  2. /*
  3. * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
  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
  8. * are met:
  9. * 1. Redistributions of source code must retain the above copyright
  10. * notice, this list of conditions and the following disclaimer.
  11. * 2. Redistributions in binary form must reproduce the above copyright
  12. * notice, this list of conditions and the following disclaimer in the
  13. * documentation and/or other materials provided with the distribution.
  14. * 3. Neither the name of the 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 PROJECT AND CONTRIBUTORS ``AS IS'' AND
  19. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  20. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  21. * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
  22. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  23. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  24. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  25. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  26. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  27. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  28. * SUCH DAMAGE.
  29. */
  30. #if 0
  31. #include <sys/cdefs.h>
  32. __FBSDID("$FreeBSD: src/sys/crypto/md5.c,v 1.9 2004/01/27 19:49:19 des Exp $");
  33. #include <sys/types.h>
  34. #include <sys/cdefs.h>
  35. #include <sys/time.h>
  36. #include <sys/systm.h>
  37. #include <crypto/md5.h>
  38. #endif
  39. #define SHIFT(X, s) (((X) << (s)) | ((X) >> (32 - (s))))
  40. #define F(X, Y, Z) (((X) & (Y)) | ((~X) & (Z)))
  41. #define G(X, Y, Z) (((X) & (Z)) | ((Y) & (~Z)))
  42. #define H(X, Y, Z) ((X) ^ (Y) ^ (Z))
  43. #define I(X, Y, Z) ((Y) ^ ((X) | (~Z)))
  44. #define ROUND1(a, b, c, d, k, s, i) { \
  45. (a) = (a) + F((b), (c), (d)) + X[(k)] + T[(i)]; \
  46. (a) = SHIFT((a), (s)); \
  47. (a) = (b) + (a); \
  48. }
  49. #define ROUND2(a, b, c, d, k, s, i) { \
  50. (a) = (a) + G((b), (c), (d)) + X[(k)] + T[(i)]; \
  51. (a) = SHIFT((a), (s)); \
  52. (a) = (b) + (a); \
  53. }
  54. #define ROUND3(a, b, c, d, k, s, i) { \
  55. (a) = (a) + H((b), (c), (d)) + X[(k)] + T[(i)]; \
  56. (a) = SHIFT((a), (s)); \
  57. (a) = (b) + (a); \
  58. }
  59. #define ROUND4(a, b, c, d, k, s, i) { \
  60. (a) = (a) + I((b), (c), (d)) + X[(k)] + T[(i)]; \
  61. (a) = SHIFT((a), (s)); \
  62. (a) = (b) + (a); \
  63. }
  64. #define Sa 7
  65. #define Sb 12
  66. #define Sc 17
  67. #define Sd 22
  68. #define Se 5
  69. #define Sf 9
  70. #define Sg 14
  71. #define Sh 20
  72. #define Si 4
  73. #define Sj 11
  74. #define Sk 16
  75. #define Sl 23
  76. #define Sm 6
  77. #define Sn 10
  78. #define So 15
  79. #define Sp 21
  80. #define MD5_A0 0x67452301
  81. #define MD5_B0 0xefcdab89
  82. #define MD5_C0 0x98badcfe
  83. #define MD5_D0 0x10325476
  84. /* Integer part of 4294967296 times abs(sin(i)), where i is in radians. */
  85. static const u_int32_t T[65] = {
  86. 0,
  87. 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee,
  88. 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
  89. 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
  90. 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
  91. 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa,
  92. 0xd62f105d, 0x2441453, 0xd8a1e681, 0xe7d3fbc8,
  93. 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
  94. 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
  95. 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c,
  96. 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
  97. 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x4881d05,
  98. 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
  99. 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039,
  100. 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
  101. 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
  102. 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391,
  103. };
  104. static const u_int8_t md5_paddat[MD5_BUFLEN] = {
  105. 0x80, 0, 0, 0, 0, 0, 0, 0,
  106. 0, 0, 0, 0, 0, 0, 0, 0,
  107. 0, 0, 0, 0, 0, 0, 0, 0,
  108. 0, 0, 0, 0, 0, 0, 0, 0,
  109. 0, 0, 0, 0, 0, 0, 0, 0,
  110. 0, 0, 0, 0, 0, 0, 0, 0,
  111. 0, 0, 0, 0, 0, 0, 0, 0,
  112. 0, 0, 0, 0, 0, 0, 0, 0,
  113. };
  114. static void md5_calc(u_int8_t *, md5_ctxt *);
  115. void md5_init(ctxt)
  116. md5_ctxt *ctxt;
  117. {
  118. ctxt->md5_n = 0;
  119. ctxt->md5_i = 0;
  120. ctxt->md5_sta = MD5_A0;
  121. ctxt->md5_stb = MD5_B0;
  122. ctxt->md5_stc = MD5_C0;
  123. ctxt->md5_std = MD5_D0;
  124. bzero(ctxt->md5_buf, sizeof(ctxt->md5_buf));
  125. }
  126. void md5_loop(ctxt, input, len)
  127. md5_ctxt *ctxt;
  128. u_int8_t *input;
  129. u_int len; /* number of bytes */
  130. {
  131. u_int gap, i;
  132. ctxt->md5_n += len * 8; /* byte to bit */
  133. gap = MD5_BUFLEN - ctxt->md5_i;
  134. if (len >= gap) {
  135. bcopy((void *)input, (void *)(ctxt->md5_buf + ctxt->md5_i),
  136. gap);
  137. md5_calc(ctxt->md5_buf, ctxt);
  138. for (i = gap; i + MD5_BUFLEN <= len; i += MD5_BUFLEN) {
  139. md5_calc((u_int8_t *)(input + i), ctxt);
  140. }
  141. ctxt->md5_i = len - i;
  142. bcopy((void *)(input + i), (void *)ctxt->md5_buf, ctxt->md5_i);
  143. } else {
  144. bcopy((void *)input, (void *)(ctxt->md5_buf + ctxt->md5_i),
  145. len);
  146. ctxt->md5_i += len;
  147. }
  148. }
  149. void md5_pad(ctxt)
  150. md5_ctxt *ctxt;
  151. {
  152. u_int gap;
  153. /* Don't count up padding. Keep md5_n. */
  154. gap = MD5_BUFLEN - ctxt->md5_i;
  155. if (gap > 8) {
  156. bcopy(md5_paddat,
  157. (void *)(ctxt->md5_buf + ctxt->md5_i),
  158. gap - sizeof(ctxt->md5_n));
  159. } else {
  160. /* including gap == 8 */
  161. bcopy(md5_paddat, (void *)(ctxt->md5_buf + ctxt->md5_i),
  162. gap);
  163. md5_calc(ctxt->md5_buf, ctxt);
  164. bcopy((md5_paddat + gap),
  165. (void *)ctxt->md5_buf,
  166. MD5_BUFLEN - sizeof(ctxt->md5_n));
  167. }
  168. /* 8 byte word */
  169. #if BYTE_ORDER == LITTLE_ENDIAN
  170. bcopy(&ctxt->md5_n8[0], &ctxt->md5_buf[56], 8);
  171. #endif
  172. #if BYTE_ORDER == BIG_ENDIAN
  173. ctxt->md5_buf[56] = ctxt->md5_n8[7];
  174. ctxt->md5_buf[57] = ctxt->md5_n8[6];
  175. ctxt->md5_buf[58] = ctxt->md5_n8[5];
  176. ctxt->md5_buf[59] = ctxt->md5_n8[4];
  177. ctxt->md5_buf[60] = ctxt->md5_n8[3];
  178. ctxt->md5_buf[61] = ctxt->md5_n8[2];
  179. ctxt->md5_buf[62] = ctxt->md5_n8[1];
  180. ctxt->md5_buf[63] = ctxt->md5_n8[0];
  181. #endif
  182. md5_calc(ctxt->md5_buf, ctxt);
  183. }
  184. void md5_result(digest, ctxt)
  185. u_int8_t *digest;
  186. md5_ctxt *ctxt;
  187. {
  188. /* 4 byte words */
  189. #if BYTE_ORDER == LITTLE_ENDIAN
  190. bcopy(&ctxt->md5_st8[0], digest, 16);
  191. #endif
  192. #if BYTE_ORDER == BIG_ENDIAN
  193. digest[ 0] = ctxt->md5_st8[ 3]; digest[ 1] = ctxt->md5_st8[ 2];
  194. digest[ 2] = ctxt->md5_st8[ 1]; digest[ 3] = ctxt->md5_st8[ 0];
  195. digest[ 4] = ctxt->md5_st8[ 7]; digest[ 5] = ctxt->md5_st8[ 6];
  196. digest[ 6] = ctxt->md5_st8[ 5]; digest[ 7] = ctxt->md5_st8[ 4];
  197. digest[ 8] = ctxt->md5_st8[11]; digest[ 9] = ctxt->md5_st8[10];
  198. digest[10] = ctxt->md5_st8[ 9]; digest[11] = ctxt->md5_st8[ 8];
  199. digest[12] = ctxt->md5_st8[15]; digest[13] = ctxt->md5_st8[14];
  200. digest[14] = ctxt->md5_st8[13]; digest[15] = ctxt->md5_st8[12];
  201. #endif
  202. }
  203. static void md5_calc(b64, ctxt)
  204. u_int8_t *b64;
  205. md5_ctxt *ctxt;
  206. {
  207. u_int32_t A = ctxt->md5_sta;
  208. u_int32_t B = ctxt->md5_stb;
  209. u_int32_t C = ctxt->md5_stc;
  210. u_int32_t D = ctxt->md5_std;
  211. #if BYTE_ORDER == LITTLE_ENDIAN
  212. u_int32_t *X = (u_int32_t *)b64;
  213. #endif
  214. #if BYTE_ORDER == BIG_ENDIAN
  215. /* 4 byte words */
  216. /* what a brute force but fast! */
  217. u_int32_t X[16];
  218. u_int8_t *y = (u_int8_t *)X;
  219. y[ 0] = b64[ 3]; y[ 1] = b64[ 2]; y[ 2] = b64[ 1]; y[ 3] = b64[ 0];
  220. y[ 4] = b64[ 7]; y[ 5] = b64[ 6]; y[ 6] = b64[ 5]; y[ 7] = b64[ 4];
  221. y[ 8] = b64[11]; y[ 9] = b64[10]; y[10] = b64[ 9]; y[11] = b64[ 8];
  222. y[12] = b64[15]; y[13] = b64[14]; y[14] = b64[13]; y[15] = b64[12];
  223. y[16] = b64[19]; y[17] = b64[18]; y[18] = b64[17]; y[19] = b64[16];
  224. y[20] = b64[23]; y[21] = b64[22]; y[22] = b64[21]; y[23] = b64[20];
  225. y[24] = b64[27]; y[25] = b64[26]; y[26] = b64[25]; y[27] = b64[24];
  226. y[28] = b64[31]; y[29] = b64[30]; y[30] = b64[29]; y[31] = b64[28];
  227. y[32] = b64[35]; y[33] = b64[34]; y[34] = b64[33]; y[35] = b64[32];
  228. y[36] = b64[39]; y[37] = b64[38]; y[38] = b64[37]; y[39] = b64[36];
  229. y[40] = b64[43]; y[41] = b64[42]; y[42] = b64[41]; y[43] = b64[40];
  230. y[44] = b64[47]; y[45] = b64[46]; y[46] = b64[45]; y[47] = b64[44];
  231. y[48] = b64[51]; y[49] = b64[50]; y[50] = b64[49]; y[51] = b64[48];
  232. y[52] = b64[55]; y[53] = b64[54]; y[54] = b64[53]; y[55] = b64[52];
  233. y[56] = b64[59]; y[57] = b64[58]; y[58] = b64[57]; y[59] = b64[56];
  234. y[60] = b64[63]; y[61] = b64[62]; y[62] = b64[61]; y[63] = b64[60];
  235. #endif
  236. ROUND1(A, B, C, D, 0, Sa, 1); ROUND1(D, A, B, C, 1, Sb, 2);
  237. ROUND1(C, D, A, B, 2, Sc, 3); ROUND1(B, C, D, A, 3, Sd, 4);
  238. ROUND1(A, B, C, D, 4, Sa, 5); ROUND1(D, A, B, C, 5, Sb, 6);
  239. ROUND1(C, D, A, B, 6, Sc, 7); ROUND1(B, C, D, A, 7, Sd, 8);
  240. ROUND1(A, B, C, D, 8, Sa, 9); ROUND1(D, A, B, C, 9, Sb, 10);
  241. ROUND1(C, D, A, B, 10, Sc, 11); ROUND1(B, C, D, A, 11, Sd, 12);
  242. ROUND1(A, B, C, D, 12, Sa, 13); ROUND1(D, A, B, C, 13, Sb, 14);
  243. ROUND1(C, D, A, B, 14, Sc, 15); ROUND1(B, C, D, A, 15, Sd, 16);
  244. ROUND2(A, B, C, D, 1, Se, 17); ROUND2(D, A, B, C, 6, Sf, 18);
  245. ROUND2(C, D, A, B, 11, Sg, 19); ROUND2(B, C, D, A, 0, Sh, 20);
  246. ROUND2(A, B, C, D, 5, Se, 21); ROUND2(D, A, B, C, 10, Sf, 22);
  247. ROUND2(C, D, A, B, 15, Sg, 23); ROUND2(B, C, D, A, 4, Sh, 24);
  248. ROUND2(A, B, C, D, 9, Se, 25); ROUND2(D, A, B, C, 14, Sf, 26);
  249. ROUND2(C, D, A, B, 3, Sg, 27); ROUND2(B, C, D, A, 8, Sh, 28);
  250. ROUND2(A, B, C, D, 13, Se, 29); ROUND2(D, A, B, C, 2, Sf, 30);
  251. ROUND2(C, D, A, B, 7, Sg, 31); ROUND2(B, C, D, A, 12, Sh, 32);
  252. ROUND3(A, B, C, D, 5, Si, 33); ROUND3(D, A, B, C, 8, Sj, 34);
  253. ROUND3(C, D, A, B, 11, Sk, 35); ROUND3(B, C, D, A, 14, Sl, 36);
  254. ROUND3(A, B, C, D, 1, Si, 37); ROUND3(D, A, B, C, 4, Sj, 38);
  255. ROUND3(C, D, A, B, 7, Sk, 39); ROUND3(B, C, D, A, 10, Sl, 40);
  256. ROUND3(A, B, C, D, 13, Si, 41); ROUND3(D, A, B, C, 0, Sj, 42);
  257. ROUND3(C, D, A, B, 3, Sk, 43); ROUND3(B, C, D, A, 6, Sl, 44);
  258. ROUND3(A, B, C, D, 9, Si, 45); ROUND3(D, A, B, C, 12, Sj, 46);
  259. ROUND3(C, D, A, B, 15, Sk, 47); ROUND3(B, C, D, A, 2, Sl, 48);
  260. ROUND4(A, B, C, D, 0, Sm, 49); ROUND4(D, A, B, C, 7, Sn, 50);
  261. ROUND4(C, D, A, B, 14, So, 51); ROUND4(B, C, D, A, 5, Sp, 52);
  262. ROUND4(A, B, C, D, 12, Sm, 53); ROUND4(D, A, B, C, 3, Sn, 54);
  263. ROUND4(C, D, A, B, 10, So, 55); ROUND4(B, C, D, A, 1, Sp, 56);
  264. ROUND4(A, B, C, D, 8, Sm, 57); ROUND4(D, A, B, C, 15, Sn, 58);
  265. ROUND4(C, D, A, B, 6, So, 59); ROUND4(B, C, D, A, 13, Sp, 60);
  266. ROUND4(A, B, C, D, 4, Sm, 61); ROUND4(D, A, B, C, 11, Sn, 62);
  267. ROUND4(C, D, A, B, 2, So, 63); ROUND4(B, C, D, A, 9, Sp, 64);
  268. ctxt->md5_sta += A;
  269. ctxt->md5_stb += B;
  270. ctxt->md5_stc += C;
  271. ctxt->md5_std += D;
  272. }