md5.c 6.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210
  1. /*
  2. * Copyright (C) 2006 Michael Niedermayer (michaelni@gmx.at)
  3. * Copyright (C) 2003-2005 by Christopher R. Hertel (crh@ubiqx.mn.org)
  4. *
  5. * References:
  6. * IETF RFC 1321: The MD5 Message-Digest Algorithm
  7. * Ron Rivest. IETF, April, 1992
  8. *
  9. * based on http://ubiqx.org/libcifs/source/Auth/MD5.c
  10. * from Christopher R. Hertel (crh@ubiqx.mn.org)
  11. * Simplified, cleaned and IMO redundant comments removed by michael.
  12. *
  13. * If you use gcc, then version 4.1 or later and -fomit-frame-pointer is
  14. * strongly recommended.
  15. *
  16. * This file is part of FFmpeg.
  17. *
  18. * FFmpeg is free software; you can redistribute it and/or
  19. * modify it under the terms of the GNU Lesser General Public
  20. * License as published by the Free Software Foundation; either
  21. * version 2.1 of the License, or (at your option) any later version.
  22. *
  23. * FFmpeg is distributed in the hope that it will be useful,
  24. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  25. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  26. * Lesser General Public License for more details.
  27. *
  28. * You should have received a copy of the GNU Lesser General Public
  29. * License along with FFmpeg; if not, write to the Free Software
  30. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  31. */
  32. #include <stdint.h>
  33. #include "bswap.h"
  34. #include "intreadwrite.h"
  35. #include "md5.h"
  36. #include "mem.h"
  37. typedef struct AVMD5{
  38. uint64_t len;
  39. uint8_t block[64];
  40. uint32_t ABCD[4];
  41. } AVMD5;
  42. const int av_md5_size = sizeof(AVMD5);
  43. struct AVMD5 *av_md5_alloc(void)
  44. {
  45. return av_mallocz(sizeof(struct AVMD5));
  46. }
  47. static const uint8_t S[4][4] = {
  48. { 7, 12, 17, 22 }, /* round 1 */
  49. { 5, 9, 14, 20 }, /* round 2 */
  50. { 4, 11, 16, 23 }, /* round 3 */
  51. { 6, 10, 15, 21 } /* round 4 */
  52. };
  53. static const uint32_t T[64] = { // T[i]= fabs(sin(i+1)<<32)
  54. 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee, /* round 1 */
  55. 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
  56. 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
  57. 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
  58. 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa, /* round 2 */
  59. 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
  60. 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
  61. 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
  62. 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c, /* round 3 */
  63. 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
  64. 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05,
  65. 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
  66. 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039, /* round 4 */
  67. 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
  68. 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
  69. 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391,
  70. };
  71. #define CORE(i, a, b, c, d) do { \
  72. t = S[i >> 4][i & 3]; \
  73. a += T[i]; \
  74. \
  75. if (i < 32) { \
  76. if (i < 16) a += (d ^ (b & (c ^ d))) + X[ i & 15]; \
  77. else a += (c ^ (d & (c ^ b))) + X[(1 + 5*i) & 15]; \
  78. } else { \
  79. if (i < 48) a += (b ^ c ^ d) + X[(5 + 3*i) & 15]; \
  80. else a += (c ^ (b | ~d)) + X[( 7*i) & 15]; \
  81. } \
  82. a = b + (a << t | a >> (32 - t)); \
  83. } while (0)
  84. static void body(uint32_t ABCD[4], uint32_t X[16])
  85. {
  86. int i av_unused;
  87. uint32_t t;
  88. uint32_t a = ABCD[3];
  89. uint32_t b = ABCD[2];
  90. uint32_t c = ABCD[1];
  91. uint32_t d = ABCD[0];
  92. #if HAVE_BIGENDIAN
  93. for (i = 0; i < 16; i++)
  94. X[i] = av_bswap32(X[i]);
  95. #endif
  96. #if CONFIG_SMALL
  97. for (i = 0; i < 64; i++) {
  98. CORE(i, a, b, c, d);
  99. t = d;
  100. d = c;
  101. c = b;
  102. b = a;
  103. a = t;
  104. }
  105. #else
  106. #define CORE2(i) \
  107. CORE( i, a,b,c,d); CORE((i+1),d,a,b,c); \
  108. CORE((i+2),c,d,a,b); CORE((i+3),b,c,d,a)
  109. #define CORE4(i) CORE2(i); CORE2((i+4)); CORE2((i+8)); CORE2((i+12))
  110. CORE4(0); CORE4(16); CORE4(32); CORE4(48);
  111. #endif
  112. ABCD[0] += d;
  113. ABCD[1] += c;
  114. ABCD[2] += b;
  115. ABCD[3] += a;
  116. }
  117. void av_md5_init(AVMD5 *ctx)
  118. {
  119. ctx->len = 0;
  120. ctx->ABCD[0] = 0x10325476;
  121. ctx->ABCD[1] = 0x98badcfe;
  122. ctx->ABCD[2] = 0xefcdab89;
  123. ctx->ABCD[3] = 0x67452301;
  124. }
  125. void av_md5_update(AVMD5 *ctx, const uint8_t *src, const int len)
  126. {
  127. int i, j;
  128. j = ctx->len & 63;
  129. ctx->len += len;
  130. for (i = 0; i < len; i++) {
  131. ctx->block[j++] = src[i];
  132. if (j == 64) {
  133. body(ctx->ABCD, (uint32_t *) ctx->block);
  134. j = 0;
  135. }
  136. }
  137. }
  138. void av_md5_final(AVMD5 *ctx, uint8_t *dst)
  139. {
  140. int i;
  141. uint64_t finalcount = av_le2ne64(ctx->len << 3);
  142. av_md5_update(ctx, "\200", 1);
  143. while ((ctx->len & 63) != 56)
  144. av_md5_update(ctx, "", 1);
  145. av_md5_update(ctx, (uint8_t *)&finalcount, 8);
  146. for (i = 0; i < 4; i++)
  147. AV_WL32(dst + 4*i, ctx->ABCD[3 - i]);
  148. }
  149. void av_md5_sum(uint8_t *dst, const uint8_t *src, const int len)
  150. {
  151. AVMD5 ctx;
  152. av_md5_init(&ctx);
  153. av_md5_update(&ctx, src, len);
  154. av_md5_final(&ctx, dst);
  155. }
  156. #ifdef TEST
  157. #include <stdio.h>
  158. static void print_md5(uint8_t *md5)
  159. {
  160. int i;
  161. for (i = 0; i < 16; i++)
  162. printf("%02x", md5[i]);
  163. printf("\n");
  164. }
  165. int main(void){
  166. uint8_t md5val[16];
  167. int i;
  168. uint8_t in[1000];
  169. for (i = 0; i < 1000; i++)
  170. in[i] = i * i;
  171. av_md5_sum(md5val, in, 1000); print_md5(md5val);
  172. av_md5_sum(md5val, in, 63); print_md5(md5val);
  173. av_md5_sum(md5val, in, 64); print_md5(md5val);
  174. av_md5_sum(md5val, in, 65); print_md5(md5val);
  175. for (i = 0; i < 1000; i++)
  176. in[i] = i % 127;
  177. av_md5_sum(md5val, in, 999); print_md5(md5val);
  178. return 0;
  179. }
  180. #endif