md5_dgst.c 5.3 KB

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