Nelze vybrat více než 25 témat Téma musí začínat písmenem nebo číslem, může obsahovat pomlčky („-“) a může být dlouhé až 35 znaků.

md5.c 5.4KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234
  1. /*
  2. * Cryptographic API.
  3. *
  4. * MD5 Message Digest Algorithm (RFC1321).
  5. *
  6. * Derived from cryptoapi implementation, originally based on the
  7. * public domain implementation written by Colin Plumb in 1993.
  8. *
  9. * Reduced object size by around 50% compared to the original Linux
  10. * version for use in Etherboot by Michael Brown.
  11. *
  12. * Copyright (c) Cryptoapi developers.
  13. * Copyright (c) 2002 James Morris <jmorris@intercode.com.au>
  14. * Copyright (c) 2006 Michael Brown <mbrown@fensystems.co.uk>
  15. *
  16. * This program is free software; you can redistribute it and/or modify it
  17. * under the terms of the GNU General Public License as published by the Free
  18. * Software Foundation; either version 2 of the License, or (at your option)
  19. * any later version.
  20. *
  21. */
  22. FILE_LICENCE ( GPL2_OR_LATER );
  23. #include <stdint.h>
  24. #include <string.h>
  25. #include <byteswap.h>
  26. #include <ipxe/crypto.h>
  27. #include <ipxe/md5.h>
  28. struct md5_step {
  29. u32 ( * f ) ( u32 b, u32 c, u32 d );
  30. u8 coefficient;
  31. u8 constant;
  32. };
  33. static u32 f1(u32 b, u32 c, u32 d)
  34. {
  35. return ( d ^ ( b & ( c ^ d ) ) );
  36. }
  37. static u32 f2(u32 b, u32 c, u32 d)
  38. {
  39. return ( c ^ ( d & ( b ^ c ) ) );
  40. }
  41. static u32 f3(u32 b, u32 c, u32 d)
  42. {
  43. return ( b ^ c ^ d );
  44. }
  45. static u32 f4(u32 b, u32 c, u32 d)
  46. {
  47. return ( c ^ ( b | ~d ) );
  48. }
  49. static struct md5_step md5_steps[4] = {
  50. {
  51. .f = f1,
  52. .coefficient = 1,
  53. .constant = 0,
  54. },
  55. {
  56. .f = f2,
  57. .coefficient = 5,
  58. .constant = 1,
  59. },
  60. {
  61. .f = f3,
  62. .coefficient = 3,
  63. .constant = 5,
  64. },
  65. {
  66. .f = f4,
  67. .coefficient = 7,
  68. .constant = 0,
  69. }
  70. };
  71. static const u8 r[64] = {
  72. 7,12,17,22,7,12,17,22,7,12,17,22,7,12,17,22,
  73. 5,9,14,20,5,9,14,20,5,9,14,20,5,9,14,20,
  74. 4,11,16,23,4,11,16,23,4,11,16,23,4,11,16,23,
  75. 6,10,15,21,6,10,15,21,6,10,15,21,6,10,15,21
  76. };
  77. static const u32 k[64] = {
  78. 0xd76aa478UL, 0xe8c7b756UL, 0x242070dbUL, 0xc1bdceeeUL,
  79. 0xf57c0fafUL, 0x4787c62aUL, 0xa8304613UL, 0xfd469501UL,
  80. 0x698098d8UL, 0x8b44f7afUL, 0xffff5bb1UL, 0x895cd7beUL,
  81. 0x6b901122UL, 0xfd987193UL, 0xa679438eUL, 0x49b40821UL,
  82. 0xf61e2562UL, 0xc040b340UL, 0x265e5a51UL, 0xe9b6c7aaUL,
  83. 0xd62f105dUL, 0x02441453UL, 0xd8a1e681UL, 0xe7d3fbc8UL,
  84. 0x21e1cde6UL, 0xc33707d6UL, 0xf4d50d87UL, 0x455a14edUL,
  85. 0xa9e3e905UL, 0xfcefa3f8UL, 0x676f02d9UL, 0x8d2a4c8aUL,
  86. 0xfffa3942UL, 0x8771f681UL, 0x6d9d6122UL, 0xfde5380cUL,
  87. 0xa4beea44UL, 0x4bdecfa9UL, 0xf6bb4b60UL, 0xbebfbc70UL,
  88. 0x289b7ec6UL, 0xeaa127faUL, 0xd4ef3085UL, 0x04881d05UL,
  89. 0xd9d4d039UL, 0xe6db99e5UL, 0x1fa27cf8UL, 0xc4ac5665UL,
  90. 0xf4292244UL, 0x432aff97UL, 0xab9423a7UL, 0xfc93a039UL,
  91. 0x655b59c3UL, 0x8f0ccc92UL, 0xffeff47dUL, 0x85845dd1UL,
  92. 0x6fa87e4fUL, 0xfe2ce6e0UL, 0xa3014314UL, 0x4e0811a1UL,
  93. 0xf7537e82UL, 0xbd3af235UL, 0x2ad7d2bbUL, 0xeb86d391UL,
  94. };
  95. static void md5_transform(u32 *hash, const u32 *in)
  96. {
  97. u32 a, b, c, d, f, g, temp;
  98. int i;
  99. struct md5_step *step;
  100. a = hash[0];
  101. b = hash[1];
  102. c = hash[2];
  103. d = hash[3];
  104. for ( i = 0 ; i < 64 ; i++ ) {
  105. step = &md5_steps[i >> 4];
  106. f = step->f ( b, c, d );
  107. g = ( ( i * step->coefficient + step->constant ) & 0xf );
  108. temp = d;
  109. d = c;
  110. c = b;
  111. a += ( f + k[i] + in[g] );
  112. a = ( ( a << r[i] ) | ( a >> ( 32-r[i] ) ) );
  113. b += a;
  114. a = temp;
  115. }
  116. hash[0] += a;
  117. hash[1] += b;
  118. hash[2] += c;
  119. hash[3] += d;
  120. }
  121. /* XXX: this stuff can be optimized */
  122. static inline void le32_to_cpu_array(u32 *buf, unsigned int words)
  123. {
  124. while (words--) {
  125. le32_to_cpus(buf);
  126. buf++;
  127. }
  128. }
  129. static inline void cpu_to_le32_array(u32 *buf, unsigned int words)
  130. {
  131. while (words--) {
  132. cpu_to_le32s(buf);
  133. buf++;
  134. }
  135. }
  136. static inline void md5_transform_helper(struct md5_ctx *ctx)
  137. {
  138. le32_to_cpu_array(ctx->block, sizeof(ctx->block) / sizeof(u32));
  139. md5_transform(ctx->hash, ctx->block);
  140. }
  141. static void md5_init(void *context)
  142. {
  143. struct md5_ctx *mctx = context;
  144. mctx->hash[0] = 0x67452301;
  145. mctx->hash[1] = 0xefcdab89;
  146. mctx->hash[2] = 0x98badcfe;
  147. mctx->hash[3] = 0x10325476;
  148. mctx->byte_count = 0;
  149. }
  150. static void md5_update(void *context, const void *data, size_t len)
  151. {
  152. struct md5_ctx *mctx = context;
  153. const u32 avail = sizeof(mctx->block) - (mctx->byte_count & 0x3f);
  154. mctx->byte_count += len;
  155. if (avail > len) {
  156. memcpy((char *)mctx->block + (sizeof(mctx->block) - avail),
  157. data, len);
  158. return;
  159. }
  160. memcpy((char *)mctx->block + (sizeof(mctx->block) - avail),
  161. data, avail);
  162. md5_transform_helper(mctx);
  163. data += avail;
  164. len -= avail;
  165. while (len >= sizeof(mctx->block)) {
  166. memcpy(mctx->block, data, sizeof(mctx->block));
  167. md5_transform_helper(mctx);
  168. data += sizeof(mctx->block);
  169. len -= sizeof(mctx->block);
  170. }
  171. memcpy(mctx->block, data, len);
  172. }
  173. static void md5_final(void *context, void *out)
  174. {
  175. struct md5_ctx *mctx = context;
  176. const unsigned int offset = mctx->byte_count & 0x3f;
  177. char *p = (char *)mctx->block + offset;
  178. int padding = 56 - (offset + 1);
  179. *p++ = 0x80;
  180. if (padding < 0) {
  181. memset(p, 0x00, padding + sizeof (u64));
  182. md5_transform_helper(mctx);
  183. p = (char *)mctx->block;
  184. padding = 56;
  185. }
  186. memset(p, 0, padding);
  187. mctx->block[14] = mctx->byte_count << 3;
  188. mctx->block[15] = mctx->byte_count >> 29;
  189. le32_to_cpu_array(mctx->block, (sizeof(mctx->block) -
  190. sizeof(u64)) / sizeof(u32));
  191. md5_transform(mctx->hash, mctx->block);
  192. cpu_to_le32_array(mctx->hash, sizeof(mctx->hash) / sizeof(u32));
  193. memcpy(out, mctx->hash, sizeof(mctx->hash));
  194. memset(mctx, 0, sizeof(*mctx));
  195. }
  196. struct digest_algorithm md5_algorithm = {
  197. .name = "md5",
  198. .ctxsize = MD5_CTX_SIZE,
  199. .blocksize = ( MD5_BLOCK_WORDS * 4 ),
  200. .digestsize = MD5_DIGEST_SIZE,
  201. .init = md5_init,
  202. .update = md5_update,
  203. .final = md5_final,
  204. };