md5_dgst.c 8.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217
  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. #include <openssl/crypto.h>
  62. const char MD5_version[] = "MD5" OPENSSL_VERSION_PTEXT;
  63. /*
  64. * Implemented from RFC1321 The MD5 Message-Digest Algorithm
  65. */
  66. #define INIT_DATA_A (unsigned long)0x67452301L
  67. #define INIT_DATA_B (unsigned long)0xefcdab89L
  68. #define INIT_DATA_C (unsigned long)0x98badcfeL
  69. #define INIT_DATA_D (unsigned long)0x10325476L
  70. fips_md_init(MD5)
  71. {
  72. memset(c, 0, sizeof(*c));
  73. c->A = INIT_DATA_A;
  74. c->B = INIT_DATA_B;
  75. c->C = INIT_DATA_C;
  76. c->D = INIT_DATA_D;
  77. return 1;
  78. }
  79. #ifndef md5_block_data_order
  80. # ifdef X
  81. # undef X
  82. # endif
  83. void md5_block_data_order(MD5_CTX *c, const void *data_, size_t num)
  84. {
  85. const unsigned char *data = data_;
  86. register unsigned MD32_REG_T A, B, C, D, l;
  87. # ifndef MD32_XARRAY
  88. /* See comment in crypto/sha/sha_locl.h for details. */
  89. unsigned MD32_REG_T XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,
  90. XX8, XX9, XX10, XX11, XX12, XX13, XX14, XX15;
  91. # define X(i) XX##i
  92. # else
  93. MD5_LONG XX[MD5_LBLOCK];
  94. # define X(i) XX[i]
  95. # endif
  96. A = c->A;
  97. B = c->B;
  98. C = c->C;
  99. D = c->D;
  100. for (; num--;) {
  101. HOST_c2l(data, l);
  102. X(0) = l;
  103. HOST_c2l(data, l);
  104. X(1) = l;
  105. /* Round 0 */
  106. R0(A, B, C, D, X(0), 7, 0xd76aa478L);
  107. HOST_c2l(data, l);
  108. X(2) = l;
  109. R0(D, A, B, C, X(1), 12, 0xe8c7b756L);
  110. HOST_c2l(data, l);
  111. X(3) = l;
  112. R0(C, D, A, B, X(2), 17, 0x242070dbL);
  113. HOST_c2l(data, l);
  114. X(4) = l;
  115. R0(B, C, D, A, X(3), 22, 0xc1bdceeeL);
  116. HOST_c2l(data, l);
  117. X(5) = l;
  118. R0(A, B, C, D, X(4), 7, 0xf57c0fafL);
  119. HOST_c2l(data, l);
  120. X(6) = l;
  121. R0(D, A, B, C, X(5), 12, 0x4787c62aL);
  122. HOST_c2l(data, l);
  123. X(7) = l;
  124. R0(C, D, A, B, X(6), 17, 0xa8304613L);
  125. HOST_c2l(data, l);
  126. X(8) = l;
  127. R0(B, C, D, A, X(7), 22, 0xfd469501L);
  128. HOST_c2l(data, l);
  129. X(9) = l;
  130. R0(A, B, C, D, X(8), 7, 0x698098d8L);
  131. HOST_c2l(data, l);
  132. X(10) = l;
  133. R0(D, A, B, C, X(9), 12, 0x8b44f7afL);
  134. HOST_c2l(data, l);
  135. X(11) = l;
  136. R0(C, D, A, B, X(10), 17, 0xffff5bb1L);
  137. HOST_c2l(data, l);
  138. X(12) = l;
  139. R0(B, C, D, A, X(11), 22, 0x895cd7beL);
  140. HOST_c2l(data, l);
  141. X(13) = l;
  142. R0(A, B, C, D, X(12), 7, 0x6b901122L);
  143. HOST_c2l(data, l);
  144. X(14) = l;
  145. R0(D, A, B, C, X(13), 12, 0xfd987193L);
  146. HOST_c2l(data, l);
  147. X(15) = l;
  148. R0(C, D, A, B, X(14), 17, 0xa679438eL);
  149. R0(B, C, D, A, X(15), 22, 0x49b40821L);
  150. /* Round 1 */
  151. R1(A, B, C, D, X(1), 5, 0xf61e2562L);
  152. R1(D, A, B, C, X(6), 9, 0xc040b340L);
  153. R1(C, D, A, B, X(11), 14, 0x265e5a51L);
  154. R1(B, C, D, A, X(0), 20, 0xe9b6c7aaL);
  155. R1(A, B, C, D, X(5), 5, 0xd62f105dL);
  156. R1(D, A, B, C, X(10), 9, 0x02441453L);
  157. R1(C, D, A, B, X(15), 14, 0xd8a1e681L);
  158. R1(B, C, D, A, X(4), 20, 0xe7d3fbc8L);
  159. R1(A, B, C, D, X(9), 5, 0x21e1cde6L);
  160. R1(D, A, B, C, X(14), 9, 0xc33707d6L);
  161. R1(C, D, A, B, X(3), 14, 0xf4d50d87L);
  162. R1(B, C, D, A, X(8), 20, 0x455a14edL);
  163. R1(A, B, C, D, X(13), 5, 0xa9e3e905L);
  164. R1(D, A, B, C, X(2), 9, 0xfcefa3f8L);
  165. R1(C, D, A, B, X(7), 14, 0x676f02d9L);
  166. R1(B, C, D, A, X(12), 20, 0x8d2a4c8aL);
  167. /* Round 2 */
  168. R2(A, B, C, D, X(5), 4, 0xfffa3942L);
  169. R2(D, A, B, C, X(8), 11, 0x8771f681L);
  170. R2(C, D, A, B, X(11), 16, 0x6d9d6122L);
  171. R2(B, C, D, A, X(14), 23, 0xfde5380cL);
  172. R2(A, B, C, D, X(1), 4, 0xa4beea44L);
  173. R2(D, A, B, C, X(4), 11, 0x4bdecfa9L);
  174. R2(C, D, A, B, X(7), 16, 0xf6bb4b60L);
  175. R2(B, C, D, A, X(10), 23, 0xbebfbc70L);
  176. R2(A, B, C, D, X(13), 4, 0x289b7ec6L);
  177. R2(D, A, B, C, X(0), 11, 0xeaa127faL);
  178. R2(C, D, A, B, X(3), 16, 0xd4ef3085L);
  179. R2(B, C, D, A, X(6), 23, 0x04881d05L);
  180. R2(A, B, C, D, X(9), 4, 0xd9d4d039L);
  181. R2(D, A, B, C, X(12), 11, 0xe6db99e5L);
  182. R2(C, D, A, B, X(15), 16, 0x1fa27cf8L);
  183. R2(B, C, D, A, X(2), 23, 0xc4ac5665L);
  184. /* Round 3 */
  185. R3(A, B, C, D, X(0), 6, 0xf4292244L);
  186. R3(D, A, B, C, X(7), 10, 0x432aff97L);
  187. R3(C, D, A, B, X(14), 15, 0xab9423a7L);
  188. R3(B, C, D, A, X(5), 21, 0xfc93a039L);
  189. R3(A, B, C, D, X(12), 6, 0x655b59c3L);
  190. R3(D, A, B, C, X(3), 10, 0x8f0ccc92L);
  191. R3(C, D, A, B, X(10), 15, 0xffeff47dL);
  192. R3(B, C, D, A, X(1), 21, 0x85845dd1L);
  193. R3(A, B, C, D, X(8), 6, 0x6fa87e4fL);
  194. R3(D, A, B, C, X(15), 10, 0xfe2ce6e0L);
  195. R3(C, D, A, B, X(6), 15, 0xa3014314L);
  196. R3(B, C, D, A, X(13), 21, 0x4e0811a1L);
  197. R3(A, B, C, D, X(4), 6, 0xf7537e82L);
  198. R3(D, A, B, C, X(11), 10, 0xbd3af235L);
  199. R3(C, D, A, B, X(2), 15, 0x2ad7d2bbL);
  200. R3(B, C, D, A, X(9), 21, 0xeb86d391L);
  201. A = c->A += A;
  202. B = c->B += B;
  203. C = c->C += C;
  204. D = c->D += D;
  205. }
  206. }
  207. #endif