md5.c 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169
  1. /*
  2. * Copyright (C) 2006 Michael Niedermayer (michaelni@gmx.at)
  3. * Copyright (C) 2003-2005 by Christopher R. Hertel (crh@ubiqx.mn.org)
  4. * #inlcude LGPL license
  5. *
  6. * References:
  7. * IETF RFC 1321: The MD5 Message-Digest Algorithm
  8. * Ron Rivest. IETF, April, 1992
  9. *
  10. * based on http://ubiqx.org/libcifs/source/Auth/MD5.c
  11. * from Christopher R. Hertel (crh@ubiqx.mn.org)
  12. * simplified, cleaned and IMO redundant comments removed by michael
  13. *
  14. * if you use gcc, then version 4.1 or later and -fomit-frame-pointer is
  15. * strongly recommanded
  16. */
  17. #include "common.h"
  18. #include <string.h>
  19. #include "md5.h"
  20. typedef struct AVMD5{
  21. uint8_t block[64];
  22. uint32_t ABCD[4];
  23. uint64_t len;
  24. int b_used;
  25. } AVMD5;
  26. const int av_md5_size= sizeof(AVMD5);
  27. static const uint8_t S[4][4] = {
  28. { 7, 12, 17, 22 }, /* Round 1 */
  29. { 5, 9, 14, 20 }, /* Round 2 */
  30. { 4, 11, 16, 23 }, /* Round 3 */
  31. { 6, 10, 15, 21 } /* Round 4 */
  32. };
  33. static const uint32_t T[64] = {
  34. 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee, /* Round 1 */
  35. 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
  36. 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
  37. 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
  38. 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa, /* Round 2 */
  39. 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
  40. 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
  41. 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
  42. 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c, /* Round 3 */
  43. 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
  44. 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05,
  45. 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
  46. 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039, /* Round 4 */
  47. 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
  48. 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
  49. 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391,
  50. };
  51. #define CORE(i, a, b, c, d) \
  52. t = S[i>>4][i&3];\
  53. a += T[i];\
  54. \
  55. switch(i>>4){\
  56. case 0: a += (d ^ b&(c^d)) + X[ i &15 ]; break;\
  57. case 1: a += (c ^ d&(c^b)) + X[ (1+5*i)&15 ]; break;\
  58. case 2: a += (b^c^d) + X[ (5+3*i)&15 ]; break;\
  59. case 3: a += (c^(b|~d)) + X[ ( 7*i)&15 ]; break;\
  60. }\
  61. a = b + (( a << t ) | ( a >> (32 - t) ));
  62. static void body(uint32_t ABCD[4], const uint32_t X[16]){
  63. int i, t;
  64. unsigned int a= ABCD[3];
  65. unsigned int b= ABCD[2];
  66. unsigned int c= ABCD[1];
  67. unsigned int d= ABCD[0];
  68. #ifdef WORDS_BIGENDIAN
  69. for(i=0; i<16; i++)
  70. X[i]= bswap_32(X[i]);
  71. #endif
  72. #ifdef CONFIG_SMALL
  73. for( i = 0; i < 64; i++ ){
  74. CORE(i,a,b,c,d)
  75. t=d; d=c; c=b; b=a; a=t;
  76. }
  77. #else
  78. #define CORE2(i) CORE(i,a,b,c,d) CORE((i+1),d,a,b,c) CORE((i+2),c,d,a,b) CORE((i+3),b,c,d,a)
  79. #define CORE4(i) CORE2(i) CORE2((i+4)) CORE2((i+8)) CORE2((i+12))
  80. CORE4(0) CORE4(16) CORE4(32) CORE4(48)
  81. #endif
  82. ABCD[0] += d;
  83. ABCD[1] += c;
  84. ABCD[2] += b;
  85. ABCD[3] += a;
  86. }
  87. void av_md5_init(AVMD5 *ctx){
  88. ctx->len = 0;
  89. ctx->b_used = 0;
  90. ctx->ABCD[0] = 0x10325476;
  91. ctx->ABCD[1] = 0x98badcfe;
  92. ctx->ABCD[2] = 0xefcdab89;
  93. ctx->ABCD[3] = 0x67452301;
  94. }
  95. void av_md5_update(AVMD5 *ctx, const uint8_t *src, const int len){
  96. int i;
  97. ctx->len += len;
  98. for( i = 0; i < len; i++ ){
  99. ctx->block[ ctx->b_used++ ] = src[i];
  100. if( 64 == ctx->b_used ){
  101. body(ctx->ABCD, (const uint32_t*) ctx->block);
  102. ctx->b_used = 0;
  103. }
  104. }
  105. }
  106. void av_md5_final(AVMD5 *ctx, uint8_t *dst){
  107. int i;
  108. ctx->block[ctx->b_used++] = 0x80;
  109. memset(&ctx->block[ctx->b_used], 0, 64 - ctx->b_used);
  110. if( 56 < ctx->b_used ){
  111. body( ctx->ABCD, (const uint32_t*) ctx->block );
  112. memset(ctx->block, 0, 64);
  113. }
  114. for(i=0; i<8; i++)
  115. ctx->block[56+i] = (ctx->len << 3) >> (i<<3);
  116. body(ctx->ABCD, (const uint32_t*) ctx->block);
  117. for(i=0; i<4; i++)
  118. ((uint32_t*)dst)[i]= le2me_32(ctx->ABCD[3-i]);
  119. }
  120. void av_md5_sum(uint8_t *dst, const uint8_t *src, const int len){
  121. AVMD5 ctx[1];
  122. av_md5_init(ctx);
  123. av_md5_update(ctx, src, len);
  124. av_md5_final(ctx, dst);
  125. }
  126. #ifdef TEST
  127. #include <stdio.h>
  128. main(){
  129. uint64_t md5val;
  130. int i;
  131. uint8_t in[1000];
  132. for(i=0; i<1000; i++) in[i]= i*i;
  133. av_md5_sum( (uint8_t*)&md5val, in, 1000); printf("%lld\n", md5val);
  134. av_md5_sum( (uint8_t*)&md5val, in, 63); printf("%lld\n", md5val);
  135. av_md5_sum( (uint8_t*)&md5val, in, 64); printf("%lld\n", md5val);
  136. av_md5_sum( (uint8_t*)&md5val, in, 65); printf("%lld\n", md5val);
  137. for(i=0; i<1000; i++) in[i]= i % 127;
  138. av_md5_sum( (uint8_t*)&md5val, in, 999); printf("%lld\n", md5val);
  139. }
  140. #endif