md4_dgst.c 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153
  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. * MD4 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 <openssl/opensslv.h>
  16. #include "md4_local.h"
  17. /*
  18. * Implemented from RFC1186 The MD4 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 MD4_Init(MD4_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 md4_block_data_order
  34. # ifdef X
  35. # undef X
  36. # endif
  37. void md4_block_data_order(MD4_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. MD4_LONG XX[MD4_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), 3, 0);
  61. (void)HOST_c2l(data, l);
  62. X(2) = l;
  63. R0(D, A, B, C, X(1), 7, 0);
  64. (void)HOST_c2l(data, l);
  65. X(3) = l;
  66. R0(C, D, A, B, X(2), 11, 0);
  67. (void)HOST_c2l(data, l);
  68. X(4) = l;
  69. R0(B, C, D, A, X(3), 19, 0);
  70. (void)HOST_c2l(data, l);
  71. X(5) = l;
  72. R0(A, B, C, D, X(4), 3, 0);
  73. (void)HOST_c2l(data, l);
  74. X(6) = l;
  75. R0(D, A, B, C, X(5), 7, 0);
  76. (void)HOST_c2l(data, l);
  77. X(7) = l;
  78. R0(C, D, A, B, X(6), 11, 0);
  79. (void)HOST_c2l(data, l);
  80. X(8) = l;
  81. R0(B, C, D, A, X(7), 19, 0);
  82. (void)HOST_c2l(data, l);
  83. X(9) = l;
  84. R0(A, B, C, D, X(8), 3, 0);
  85. (void)HOST_c2l(data, l);
  86. X(10) = l;
  87. R0(D, A, B, C, X(9), 7, 0);
  88. (void)HOST_c2l(data, l);
  89. X(11) = l;
  90. R0(C, D, A, B, X(10), 11, 0);
  91. (void)HOST_c2l(data, l);
  92. X(12) = l;
  93. R0(B, C, D, A, X(11), 19, 0);
  94. (void)HOST_c2l(data, l);
  95. X(13) = l;
  96. R0(A, B, C, D, X(12), 3, 0);
  97. (void)HOST_c2l(data, l);
  98. X(14) = l;
  99. R0(D, A, B, C, X(13), 7, 0);
  100. (void)HOST_c2l(data, l);
  101. X(15) = l;
  102. R0(C, D, A, B, X(14), 11, 0);
  103. R0(B, C, D, A, X(15), 19, 0);
  104. /* Round 1 */
  105. R1(A, B, C, D, X(0), 3, 0x5A827999L);
  106. R1(D, A, B, C, X(4), 5, 0x5A827999L);
  107. R1(C, D, A, B, X(8), 9, 0x5A827999L);
  108. R1(B, C, D, A, X(12), 13, 0x5A827999L);
  109. R1(A, B, C, D, X(1), 3, 0x5A827999L);
  110. R1(D, A, B, C, X(5), 5, 0x5A827999L);
  111. R1(C, D, A, B, X(9), 9, 0x5A827999L);
  112. R1(B, C, D, A, X(13), 13, 0x5A827999L);
  113. R1(A, B, C, D, X(2), 3, 0x5A827999L);
  114. R1(D, A, B, C, X(6), 5, 0x5A827999L);
  115. R1(C, D, A, B, X(10), 9, 0x5A827999L);
  116. R1(B, C, D, A, X(14), 13, 0x5A827999L);
  117. R1(A, B, C, D, X(3), 3, 0x5A827999L);
  118. R1(D, A, B, C, X(7), 5, 0x5A827999L);
  119. R1(C, D, A, B, X(11), 9, 0x5A827999L);
  120. R1(B, C, D, A, X(15), 13, 0x5A827999L);
  121. /* Round 2 */
  122. R2(A, B, C, D, X(0), 3, 0x6ED9EBA1L);
  123. R2(D, A, B, C, X(8), 9, 0x6ED9EBA1L);
  124. R2(C, D, A, B, X(4), 11, 0x6ED9EBA1L);
  125. R2(B, C, D, A, X(12), 15, 0x6ED9EBA1L);
  126. R2(A, B, C, D, X(2), 3, 0x6ED9EBA1L);
  127. R2(D, A, B, C, X(10), 9, 0x6ED9EBA1L);
  128. R2(C, D, A, B, X(6), 11, 0x6ED9EBA1L);
  129. R2(B, C, D, A, X(14), 15, 0x6ED9EBA1L);
  130. R2(A, B, C, D, X(1), 3, 0x6ED9EBA1L);
  131. R2(D, A, B, C, X(9), 9, 0x6ED9EBA1L);
  132. R2(C, D, A, B, X(5), 11, 0x6ED9EBA1L);
  133. R2(B, C, D, A, X(13), 15, 0x6ED9EBA1L);
  134. R2(A, B, C, D, X(3), 3, 0x6ED9EBA1L);
  135. R2(D, A, B, C, X(11), 9, 0x6ED9EBA1L);
  136. R2(C, D, A, B, X(7), 11, 0x6ED9EBA1L);
  137. R2(B, C, D, A, X(15), 15, 0x6ED9EBA1L);
  138. A = c->A += A;
  139. B = c->B += B;
  140. C = c->C += C;
  141. D = c->D += D;
  142. }
  143. }
  144. #endif