2
0

md5_dgst.c 9.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292
  1. /* crypto/md5/md5_dgst.c */
  2. /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
  3. * All rights reserved.
  4. *
  5. * This package is an SSL implementation written
  6. * by Eric Young (eay@cryptsoft.com).
  7. * The implementation was written so as to conform with Netscapes SSL.
  8. *
  9. * This library is free for commercial and non-commercial use as long as
  10. * the following conditions are aheared to. The following conditions
  11. * apply to all code found in this distribution, be it the RC4, RSA,
  12. * lhash, DES, etc., code; not just the SSL code. The SSL documentation
  13. * included with this distribution is covered by the same copyright terms
  14. * except that the holder is Tim Hudson (tjh@cryptsoft.com).
  15. *
  16. * Copyright remains Eric Young's, and as such any Copyright notices in
  17. * the code are not to be removed.
  18. * If this package is used in a product, Eric Young should be given attribution
  19. * as the author of the parts of the library used.
  20. * This can be in the form of a textual message at program startup or
  21. * in documentation (online or textual) provided with the package.
  22. *
  23. * Redistribution and use in source and binary forms, with or without
  24. * modification, are permitted provided that the following conditions
  25. * are met:
  26. * 1. Redistributions of source code must retain the copyright
  27. * notice, this list of conditions and the following disclaimer.
  28. * 2. Redistributions in binary form must reproduce the above copyright
  29. * notice, this list of conditions and the following disclaimer in the
  30. * documentation and/or other materials provided with the distribution.
  31. * 3. All advertising materials mentioning features or use of this software
  32. * must display the following acknowledgement:
  33. * "This product includes cryptographic software written by
  34. * Eric Young (eay@cryptsoft.com)"
  35. * The word 'cryptographic' can be left out if the rouines from the library
  36. * being used are not cryptographic related :-).
  37. * 4. If you include any Windows specific code (or a derivative thereof) from
  38. * the apps directory (application code) you must include an acknowledgement:
  39. * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
  40. *
  41. * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
  42. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  43. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  44. * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  45. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  46. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  47. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  48. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  49. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  50. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  51. * SUCH DAMAGE.
  52. *
  53. * The licence and distribution terms for any publically available version or
  54. * derivative of this code cannot be changed. i.e. this code cannot simply be
  55. * copied and put under another distribution licence
  56. * [including the GNU Public Licence.]
  57. */
  58. #include <stdio.h>
  59. #include "md5_locl.h"
  60. #include <openssl/opensslv.h>
  61. const char *MD5_version="MD5" OPENSSL_VERSION_PTEXT;
  62. /* Implemented from RFC1321 The MD5 Message-Digest Algorithm
  63. */
  64. #define INIT_DATA_A (unsigned long)0x67452301L
  65. #define INIT_DATA_B (unsigned long)0xefcdab89L
  66. #define INIT_DATA_C (unsigned long)0x98badcfeL
  67. #define INIT_DATA_D (unsigned long)0x10325476L
  68. int MD5_Init(MD5_CTX *c)
  69. {
  70. c->A=INIT_DATA_A;
  71. c->B=INIT_DATA_B;
  72. c->C=INIT_DATA_C;
  73. c->D=INIT_DATA_D;
  74. c->Nl=0;
  75. c->Nh=0;
  76. c->num=0;
  77. return 1;
  78. }
  79. #ifndef md5_block_host_order
  80. void md5_block_host_order (MD5_CTX *c, const void *data, size_t num)
  81. {
  82. const MD5_LONG *X=data;
  83. register unsigned MD32_REG_T A,B,C,D;
  84. A=c->A;
  85. B=c->B;
  86. C=c->C;
  87. D=c->D;
  88. for (;num--;X+=HASH_LBLOCK)
  89. {
  90. /* Round 0 */
  91. R0(A,B,C,D,X[ 0], 7,0xd76aa478L);
  92. R0(D,A,B,C,X[ 1],12,0xe8c7b756L);
  93. R0(C,D,A,B,X[ 2],17,0x242070dbL);
  94. R0(B,C,D,A,X[ 3],22,0xc1bdceeeL);
  95. R0(A,B,C,D,X[ 4], 7,0xf57c0fafL);
  96. R0(D,A,B,C,X[ 5],12,0x4787c62aL);
  97. R0(C,D,A,B,X[ 6],17,0xa8304613L);
  98. R0(B,C,D,A,X[ 7],22,0xfd469501L);
  99. R0(A,B,C,D,X[ 8], 7,0x698098d8L);
  100. R0(D,A,B,C,X[ 9],12,0x8b44f7afL);
  101. R0(C,D,A,B,X[10],17,0xffff5bb1L);
  102. R0(B,C,D,A,X[11],22,0x895cd7beL);
  103. R0(A,B,C,D,X[12], 7,0x6b901122L);
  104. R0(D,A,B,C,X[13],12,0xfd987193L);
  105. R0(C,D,A,B,X[14],17,0xa679438eL);
  106. R0(B,C,D,A,X[15],22,0x49b40821L);
  107. /* Round 1 */
  108. R1(A,B,C,D,X[ 1], 5,0xf61e2562L);
  109. R1(D,A,B,C,X[ 6], 9,0xc040b340L);
  110. R1(C,D,A,B,X[11],14,0x265e5a51L);
  111. R1(B,C,D,A,X[ 0],20,0xe9b6c7aaL);
  112. R1(A,B,C,D,X[ 5], 5,0xd62f105dL);
  113. R1(D,A,B,C,X[10], 9,0x02441453L);
  114. R1(C,D,A,B,X[15],14,0xd8a1e681L);
  115. R1(B,C,D,A,X[ 4],20,0xe7d3fbc8L);
  116. R1(A,B,C,D,X[ 9], 5,0x21e1cde6L);
  117. R1(D,A,B,C,X[14], 9,0xc33707d6L);
  118. R1(C,D,A,B,X[ 3],14,0xf4d50d87L);
  119. R1(B,C,D,A,X[ 8],20,0x455a14edL);
  120. R1(A,B,C,D,X[13], 5,0xa9e3e905L);
  121. R1(D,A,B,C,X[ 2], 9,0xfcefa3f8L);
  122. R1(C,D,A,B,X[ 7],14,0x676f02d9L);
  123. R1(B,C,D,A,X[12],20,0x8d2a4c8aL);
  124. /* Round 2 */
  125. R2(A,B,C,D,X[ 5], 4,0xfffa3942L);
  126. R2(D,A,B,C,X[ 8],11,0x8771f681L);
  127. R2(C,D,A,B,X[11],16,0x6d9d6122L);
  128. R2(B,C,D,A,X[14],23,0xfde5380cL);
  129. R2(A,B,C,D,X[ 1], 4,0xa4beea44L);
  130. R2(D,A,B,C,X[ 4],11,0x4bdecfa9L);
  131. R2(C,D,A,B,X[ 7],16,0xf6bb4b60L);
  132. R2(B,C,D,A,X[10],23,0xbebfbc70L);
  133. R2(A,B,C,D,X[13], 4,0x289b7ec6L);
  134. R2(D,A,B,C,X[ 0],11,0xeaa127faL);
  135. R2(C,D,A,B,X[ 3],16,0xd4ef3085L);
  136. R2(B,C,D,A,X[ 6],23,0x04881d05L);
  137. R2(A,B,C,D,X[ 9], 4,0xd9d4d039L);
  138. R2(D,A,B,C,X[12],11,0xe6db99e5L);
  139. R2(C,D,A,B,X[15],16,0x1fa27cf8L);
  140. R2(B,C,D,A,X[ 2],23,0xc4ac5665L);
  141. /* Round 3 */
  142. R3(A,B,C,D,X[ 0], 6,0xf4292244L);
  143. R3(D,A,B,C,X[ 7],10,0x432aff97L);
  144. R3(C,D,A,B,X[14],15,0xab9423a7L);
  145. R3(B,C,D,A,X[ 5],21,0xfc93a039L);
  146. R3(A,B,C,D,X[12], 6,0x655b59c3L);
  147. R3(D,A,B,C,X[ 3],10,0x8f0ccc92L);
  148. R3(C,D,A,B,X[10],15,0xffeff47dL);
  149. R3(B,C,D,A,X[ 1],21,0x85845dd1L);
  150. R3(A,B,C,D,X[ 8], 6,0x6fa87e4fL);
  151. R3(D,A,B,C,X[15],10,0xfe2ce6e0L);
  152. R3(C,D,A,B,X[ 6],15,0xa3014314L);
  153. R3(B,C,D,A,X[13],21,0x4e0811a1L);
  154. R3(A,B,C,D,X[ 4], 6,0xf7537e82L);
  155. R3(D,A,B,C,X[11],10,0xbd3af235L);
  156. R3(C,D,A,B,X[ 2],15,0x2ad7d2bbL);
  157. R3(B,C,D,A,X[ 9],21,0xeb86d391L);
  158. A = c->A += A;
  159. B = c->B += B;
  160. C = c->C += C;
  161. D = c->D += D;
  162. }
  163. }
  164. #endif
  165. #ifndef md5_block_data_order
  166. #ifdef X
  167. #undef X
  168. #endif
  169. void md5_block_data_order (MD5_CTX *c, const void *data_, size_t num)
  170. {
  171. const unsigned char *data=data_;
  172. register unsigned MD32_REG_T A,B,C,D,l;
  173. #ifndef MD32_XARRAY
  174. /* See comment in crypto/sha/sha_locl.h for details. */
  175. unsigned MD32_REG_T XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,
  176. XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15;
  177. # define X(i) XX##i
  178. #else
  179. MD5_LONG XX[MD5_LBLOCK];
  180. # define X(i) XX[i]
  181. #endif
  182. A=c->A;
  183. B=c->B;
  184. C=c->C;
  185. D=c->D;
  186. for (;num--;)
  187. {
  188. HOST_c2l(data,l); X( 0)=l; HOST_c2l(data,l); X( 1)=l;
  189. /* Round 0 */
  190. R0(A,B,C,D,X( 0), 7,0xd76aa478L); HOST_c2l(data,l); X( 2)=l;
  191. R0(D,A,B,C,X( 1),12,0xe8c7b756L); HOST_c2l(data,l); X( 3)=l;
  192. R0(C,D,A,B,X( 2),17,0x242070dbL); HOST_c2l(data,l); X( 4)=l;
  193. R0(B,C,D,A,X( 3),22,0xc1bdceeeL); HOST_c2l(data,l); X( 5)=l;
  194. R0(A,B,C,D,X( 4), 7,0xf57c0fafL); HOST_c2l(data,l); X( 6)=l;
  195. R0(D,A,B,C,X( 5),12,0x4787c62aL); HOST_c2l(data,l); X( 7)=l;
  196. R0(C,D,A,B,X( 6),17,0xa8304613L); HOST_c2l(data,l); X( 8)=l;
  197. R0(B,C,D,A,X( 7),22,0xfd469501L); HOST_c2l(data,l); X( 9)=l;
  198. R0(A,B,C,D,X( 8), 7,0x698098d8L); HOST_c2l(data,l); X(10)=l;
  199. R0(D,A,B,C,X( 9),12,0x8b44f7afL); HOST_c2l(data,l); X(11)=l;
  200. R0(C,D,A,B,X(10),17,0xffff5bb1L); HOST_c2l(data,l); X(12)=l;
  201. R0(B,C,D,A,X(11),22,0x895cd7beL); HOST_c2l(data,l); X(13)=l;
  202. R0(A,B,C,D,X(12), 7,0x6b901122L); HOST_c2l(data,l); X(14)=l;
  203. R0(D,A,B,C,X(13),12,0xfd987193L); HOST_c2l(data,l); X(15)=l;
  204. R0(C,D,A,B,X(14),17,0xa679438eL);
  205. R0(B,C,D,A,X(15),22,0x49b40821L);
  206. /* Round 1 */
  207. R1(A,B,C,D,X( 1), 5,0xf61e2562L);
  208. R1(D,A,B,C,X( 6), 9,0xc040b340L);
  209. R1(C,D,A,B,X(11),14,0x265e5a51L);
  210. R1(B,C,D,A,X( 0),20,0xe9b6c7aaL);
  211. R1(A,B,C,D,X( 5), 5,0xd62f105dL);
  212. R1(D,A,B,C,X(10), 9,0x02441453L);
  213. R1(C,D,A,B,X(15),14,0xd8a1e681L);
  214. R1(B,C,D,A,X( 4),20,0xe7d3fbc8L);
  215. R1(A,B,C,D,X( 9), 5,0x21e1cde6L);
  216. R1(D,A,B,C,X(14), 9,0xc33707d6L);
  217. R1(C,D,A,B,X( 3),14,0xf4d50d87L);
  218. R1(B,C,D,A,X( 8),20,0x455a14edL);
  219. R1(A,B,C,D,X(13), 5,0xa9e3e905L);
  220. R1(D,A,B,C,X( 2), 9,0xfcefa3f8L);
  221. R1(C,D,A,B,X( 7),14,0x676f02d9L);
  222. R1(B,C,D,A,X(12),20,0x8d2a4c8aL);
  223. /* Round 2 */
  224. R2(A,B,C,D,X( 5), 4,0xfffa3942L);
  225. R2(D,A,B,C,X( 8),11,0x8771f681L);
  226. R2(C,D,A,B,X(11),16,0x6d9d6122L);
  227. R2(B,C,D,A,X(14),23,0xfde5380cL);
  228. R2(A,B,C,D,X( 1), 4,0xa4beea44L);
  229. R2(D,A,B,C,X( 4),11,0x4bdecfa9L);
  230. R2(C,D,A,B,X( 7),16,0xf6bb4b60L);
  231. R2(B,C,D,A,X(10),23,0xbebfbc70L);
  232. R2(A,B,C,D,X(13), 4,0x289b7ec6L);
  233. R2(D,A,B,C,X( 0),11,0xeaa127faL);
  234. R2(C,D,A,B,X( 3),16,0xd4ef3085L);
  235. R2(B,C,D,A,X( 6),23,0x04881d05L);
  236. R2(A,B,C,D,X( 9), 4,0xd9d4d039L);
  237. R2(D,A,B,C,X(12),11,0xe6db99e5L);
  238. R2(C,D,A,B,X(15),16,0x1fa27cf8L);
  239. R2(B,C,D,A,X( 2),23,0xc4ac5665L);
  240. /* Round 3 */
  241. R3(A,B,C,D,X( 0), 6,0xf4292244L);
  242. R3(D,A,B,C,X( 7),10,0x432aff97L);
  243. R3(C,D,A,B,X(14),15,0xab9423a7L);
  244. R3(B,C,D,A,X( 5),21,0xfc93a039L);
  245. R3(A,B,C,D,X(12), 6,0x655b59c3L);
  246. R3(D,A,B,C,X( 3),10,0x8f0ccc92L);
  247. R3(C,D,A,B,X(10),15,0xffeff47dL);
  248. R3(B,C,D,A,X( 1),21,0x85845dd1L);
  249. R3(A,B,C,D,X( 8), 6,0x6fa87e4fL);
  250. R3(D,A,B,C,X(15),10,0xfe2ce6e0L);
  251. R3(C,D,A,B,X( 6),15,0xa3014314L);
  252. R3(B,C,D,A,X(13),21,0x4e0811a1L);
  253. R3(A,B,C,D,X( 4), 6,0xf7537e82L);
  254. R3(D,A,B,C,X(11),10,0xbd3af235L);
  255. R3(C,D,A,B,X( 2),15,0x2ad7d2bbL);
  256. R3(B,C,D,A,X( 9),21,0xeb86d391L);
  257. A = c->A += A;
  258. B = c->B += B;
  259. C = c->C += C;
  260. D = c->D += D;
  261. }
  262. }
  263. #endif
  264. #ifdef undef
  265. int printit(unsigned long *l)
  266. {
  267. int i,ii;
  268. for (i=0; i<2; i++)
  269. {
  270. for (ii=0; ii<8; ii++)
  271. {
  272. fprintf(stderr,"%08lx ",l[i*8+ii]);
  273. }
  274. fprintf(stderr,"\n");
  275. }
  276. }
  277. #endif