md5_dgst.c 5.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170
  1. /*
  2. * Copyright 1995-2020 The OpenSSL Project Authors. All Rights Reserved.
  3. *
  4. * Licensed under the Apache License 2.0 (the "License"). You may not use
  5. * this file except in compliance with the License. You can obtain a copy
  6. * in the file LICENSE in the source distribution or at
  7. * https://www.openssl.org/source/license.html
  8. */
  9. /*
  10. * MD5 low level APIs are deprecated for public use, but still ok for
  11. * internal use.
  12. */
  13. #include "internal/deprecated.h"
  14. #include <stdio.h>
  15. #include "md5_local.h"
  16. #include <openssl/opensslv.h>
  17. /*
  18. * Implemented from RFC1321 The MD5 Message-Digest Algorithm
  19. */
  20. #define INIT_DATA_A (unsigned long)0x67452301L
  21. #define INIT_DATA_B (unsigned long)0xefcdab89L
  22. #define INIT_DATA_C (unsigned long)0x98badcfeL
  23. #define INIT_DATA_D (unsigned long)0x10325476L
  24. int MD5_Init(MD5_CTX *c)
  25. {
  26. memset(c, 0, sizeof(*c));
  27. c->A = INIT_DATA_A;
  28. c->B = INIT_DATA_B;
  29. c->C = INIT_DATA_C;
  30. c->D = INIT_DATA_D;
  31. return 1;
  32. }
  33. #ifndef md5_block_data_order
  34. # ifdef X
  35. # undef X
  36. # endif
  37. void md5_block_data_order(MD5_CTX *c, const void *data_, size_t num)
  38. {
  39. const unsigned char *data = data_;
  40. register unsigned MD32_REG_T A, B, C, D, l;
  41. # ifndef MD32_XARRAY
  42. /* See comment in crypto/sha/sha_local.h for details. */
  43. unsigned MD32_REG_T XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,
  44. XX8, XX9, XX10, XX11, XX12, XX13, XX14, XX15;
  45. # define X(i) XX##i
  46. # else
  47. MD5_LONG XX[MD5_LBLOCK];
  48. # define X(i) XX[i]
  49. # endif
  50. A = c->A;
  51. B = c->B;
  52. C = c->C;
  53. D = c->D;
  54. for (; num--;) {
  55. (void)HOST_c2l(data, l);
  56. X(0) = l;
  57. (void)HOST_c2l(data, l);
  58. X(1) = l;
  59. /* Round 0 */
  60. R0(A, B, C, D, X(0), 7, 0xd76aa478L);
  61. (void)HOST_c2l(data, l);
  62. X(2) = l;
  63. R0(D, A, B, C, X(1), 12, 0xe8c7b756L);
  64. (void)HOST_c2l(data, l);
  65. X(3) = l;
  66. R0(C, D, A, B, X(2), 17, 0x242070dbL);
  67. (void)HOST_c2l(data, l);
  68. X(4) = l;
  69. R0(B, C, D, A, X(3), 22, 0xc1bdceeeL);
  70. (void)HOST_c2l(data, l);
  71. X(5) = l;
  72. R0(A, B, C, D, X(4), 7, 0xf57c0fafL);
  73. (void)HOST_c2l(data, l);
  74. X(6) = l;
  75. R0(D, A, B, C, X(5), 12, 0x4787c62aL);
  76. (void)HOST_c2l(data, l);
  77. X(7) = l;
  78. R0(C, D, A, B, X(6), 17, 0xa8304613L);
  79. (void)HOST_c2l(data, l);
  80. X(8) = l;
  81. R0(B, C, D, A, X(7), 22, 0xfd469501L);
  82. (void)HOST_c2l(data, l);
  83. X(9) = l;
  84. R0(A, B, C, D, X(8), 7, 0x698098d8L);
  85. (void)HOST_c2l(data, l);
  86. X(10) = l;
  87. R0(D, A, B, C, X(9), 12, 0x8b44f7afL);
  88. (void)HOST_c2l(data, l);
  89. X(11) = l;
  90. R0(C, D, A, B, X(10), 17, 0xffff5bb1L);
  91. (void)HOST_c2l(data, l);
  92. X(12) = l;
  93. R0(B, C, D, A, X(11), 22, 0x895cd7beL);
  94. (void)HOST_c2l(data, l);
  95. X(13) = l;
  96. R0(A, B, C, D, X(12), 7, 0x6b901122L);
  97. (void)HOST_c2l(data, l);
  98. X(14) = l;
  99. R0(D, A, B, C, X(13), 12, 0xfd987193L);
  100. (void)HOST_c2l(data, l);
  101. X(15) = l;
  102. R0(C, D, A, B, X(14), 17, 0xa679438eL);
  103. R0(B, C, D, A, X(15), 22, 0x49b40821L);
  104. /* Round 1 */
  105. R1(A, B, C, D, X(1), 5, 0xf61e2562L);
  106. R1(D, A, B, C, X(6), 9, 0xc040b340L);
  107. R1(C, D, A, B, X(11), 14, 0x265e5a51L);
  108. R1(B, C, D, A, X(0), 20, 0xe9b6c7aaL);
  109. R1(A, B, C, D, X(5), 5, 0xd62f105dL);
  110. R1(D, A, B, C, X(10), 9, 0x02441453L);
  111. R1(C, D, A, B, X(15), 14, 0xd8a1e681L);
  112. R1(B, C, D, A, X(4), 20, 0xe7d3fbc8L);
  113. R1(A, B, C, D, X(9), 5, 0x21e1cde6L);
  114. R1(D, A, B, C, X(14), 9, 0xc33707d6L);
  115. R1(C, D, A, B, X(3), 14, 0xf4d50d87L);
  116. R1(B, C, D, A, X(8), 20, 0x455a14edL);
  117. R1(A, B, C, D, X(13), 5, 0xa9e3e905L);
  118. R1(D, A, B, C, X(2), 9, 0xfcefa3f8L);
  119. R1(C, D, A, B, X(7), 14, 0x676f02d9L);
  120. R1(B, C, D, A, X(12), 20, 0x8d2a4c8aL);
  121. /* Round 2 */
  122. R2(A, B, C, D, X(5), 4, 0xfffa3942L);
  123. R2(D, A, B, C, X(8), 11, 0x8771f681L);
  124. R2(C, D, A, B, X(11), 16, 0x6d9d6122L);
  125. R2(B, C, D, A, X(14), 23, 0xfde5380cL);
  126. R2(A, B, C, D, X(1), 4, 0xa4beea44L);
  127. R2(D, A, B, C, X(4), 11, 0x4bdecfa9L);
  128. R2(C, D, A, B, X(7), 16, 0xf6bb4b60L);
  129. R2(B, C, D, A, X(10), 23, 0xbebfbc70L);
  130. R2(A, B, C, D, X(13), 4, 0x289b7ec6L);
  131. R2(D, A, B, C, X(0), 11, 0xeaa127faL);
  132. R2(C, D, A, B, X(3), 16, 0xd4ef3085L);
  133. R2(B, C, D, A, X(6), 23, 0x04881d05L);
  134. R2(A, B, C, D, X(9), 4, 0xd9d4d039L);
  135. R2(D, A, B, C, X(12), 11, 0xe6db99e5L);
  136. R2(C, D, A, B, X(15), 16, 0x1fa27cf8L);
  137. R2(B, C, D, A, X(2), 23, 0xc4ac5665L);
  138. /* Round 3 */
  139. R3(A, B, C, D, X(0), 6, 0xf4292244L);
  140. R3(D, A, B, C, X(7), 10, 0x432aff97L);
  141. R3(C, D, A, B, X(14), 15, 0xab9423a7L);
  142. R3(B, C, D, A, X(5), 21, 0xfc93a039L);
  143. R3(A, B, C, D, X(12), 6, 0x655b59c3L);
  144. R3(D, A, B, C, X(3), 10, 0x8f0ccc92L);
  145. R3(C, D, A, B, X(10), 15, 0xffeff47dL);
  146. R3(B, C, D, A, X(1), 21, 0x85845dd1L);
  147. R3(A, B, C, D, X(8), 6, 0x6fa87e4fL);
  148. R3(D, A, B, C, X(15), 10, 0xfe2ce6e0L);
  149. R3(C, D, A, B, X(6), 15, 0xa3014314L);
  150. R3(B, C, D, A, X(13), 21, 0x4e0811a1L);
  151. R3(A, B, C, D, X(4), 6, 0xf7537e82L);
  152. R3(D, A, B, C, X(11), 10, 0xbd3af235L);
  153. R3(C, D, A, B, X(2), 15, 0x2ad7d2bbL);
  154. R3(B, C, D, A, X(9), 21, 0xeb86d391L);
  155. A = c->A += A;
  156. B = c->B += B;
  157. C = c->C += C;
  158. D = c->D += D;
  159. }
  160. }
  161. #endif