1 /* Copyright (C) 1995-1998 Eric Young (eay (at) cryptsoft.com) 2 * All rights reserved. 3 * 4 * This package is an SSL implementation written 5 * by Eric Young (eay (at) cryptsoft.com). 6 * The implementation was written so as to conform with Netscapes SSL. 7 * 8 * This library is free for commercial and non-commercial use as long as 9 * the following conditions are aheared to. The following conditions 10 * apply to all code found in this distribution, be it the RC4, RSA, 11 * lhash, DES, etc., code; not just the SSL code. The SSL documentation 12 * included with this distribution is covered by the same copyright terms 13 * except that the holder is Tim Hudson (tjh (at) cryptsoft.com). 14 * 15 * Copyright remains Eric Young's, and as such any Copyright notices in 16 * the code are not to be removed. 17 * If this package is used in a product, Eric Young should be given attribution 18 * as the author of the parts of the library used. 19 * This can be in the form of a textual message at program startup or 20 * in documentation (online or textual) provided with the package. 21 * 22 * Redistribution and use in source and binary forms, with or without 23 * modification, are permitted provided that the following conditions 24 * are met: 25 * 1. Redistributions of source code must retain the copyright 26 * notice, this list of conditions and the following disclaimer. 27 * 2. Redistributions in binary form must reproduce the above copyright 28 * notice, this list of conditions and the following disclaimer in the 29 * documentation and/or other materials provided with the distribution. 30 * 3. All advertising materials mentioning features or use of this software 31 * must display the following acknowledgement: 32 * "This product includes cryptographic software written by 33 * Eric Young (eay (at) cryptsoft.com)" 34 * The word 'cryptographic' can be left out if the rouines from the library 35 * being used are not cryptographic related :-). 36 * 4. If you include any Windows specific code (or a derivative thereof) from 37 * the apps directory (application code) you must include an acknowledgement: 38 * "This product includes software written by Tim Hudson (tjh (at) cryptsoft.com)" 39 * 40 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND 41 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 42 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 43 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 44 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 45 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 46 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 48 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 49 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 50 * SUCH DAMAGE. 51 * 52 * The licence and distribution terms for any publically available version or 53 * derivative of this code cannot be changed. i.e. this code cannot simply be 54 * copied and put under another distribution licence 55 * [including the GNU Public Licence.] */ 56 57 #include <openssl/md5.h> 58 59 #include <string.h> 60 61 #include <openssl/mem.h> 62 63 #include "../../internal.h" 64 65 66 uint8_t *MD5(const uint8_t *data, size_t len, uint8_t *out) { 67 MD5_CTX ctx; 68 MD5_Init(&ctx); 69 MD5_Update(&ctx, data, len); 70 MD5_Final(out, &ctx); 71 72 return out; 73 } 74 75 int MD5_Init(MD5_CTX *md5) { 76 OPENSSL_memset(md5, 0, sizeof(MD5_CTX)); 77 md5->h[0] = 0x67452301UL; 78 md5->h[1] = 0xefcdab89UL; 79 md5->h[2] = 0x98badcfeUL; 80 md5->h[3] = 0x10325476UL; 81 return 1; 82 } 83 84 #if !defined(OPENSSL_NO_ASM) && \ 85 (defined(OPENSSL_X86_64) || defined(OPENSSL_X86)) 86 #define MD5_ASM 87 #define md5_block_data_order md5_block_asm_data_order 88 #endif 89 90 91 void md5_block_data_order(uint32_t *state, const uint8_t *data, size_t num); 92 93 #define DATA_ORDER_IS_LITTLE_ENDIAN 94 95 #define HASH_CTX MD5_CTX 96 #define HASH_CBLOCK 64 97 #define HASH_UPDATE MD5_Update 98 #define HASH_TRANSFORM MD5_Transform 99 #define HASH_FINAL MD5_Final 100 #define HASH_MAKE_STRING(c, s) \ 101 do { \ 102 uint32_t ll; \ 103 ll = (c)->h[0]; \ 104 HOST_l2c(ll, (s)); \ 105 ll = (c)->h[1]; \ 106 HOST_l2c(ll, (s)); \ 107 ll = (c)->h[2]; \ 108 HOST_l2c(ll, (s)); \ 109 ll = (c)->h[3]; \ 110 HOST_l2c(ll, (s)); \ 111 } while (0) 112 #define HASH_BLOCK_DATA_ORDER md5_block_data_order 113 114 #include "../digest/md32_common.h" 115 116 // As pointed out by Wei Dai <weidai (at) eskimo.com>, the above can be 117 // simplified to the code below. Wei attributes these optimizations 118 // to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel. 119 #define F(b, c, d) ((((c) ^ (d)) & (b)) ^ (d)) 120 #define G(b, c, d) ((((b) ^ (c)) & (d)) ^ (c)) 121 #define H(b, c, d) ((b) ^ (c) ^ (d)) 122 #define I(b, c, d) (((~(d)) | (b)) ^ (c)) 123 124 #define ROTATE(a, n) (((a) << (n)) | ((a) >> (32 - (n)))) 125 126 #define R0(a, b, c, d, k, s, t) \ 127 do { \ 128 (a) += ((k) + (t) + F((b), (c), (d))); \ 129 (a) = ROTATE(a, s); \ 130 (a) += (b); \ 131 } while (0) 132 133 #define R1(a, b, c, d, k, s, t) \ 134 do { \ 135 (a) += ((k) + (t) + G((b), (c), (d))); \ 136 (a) = ROTATE(a, s); \ 137 (a) += (b); \ 138 } while (0) 139 140 #define R2(a, b, c, d, k, s, t) \ 141 do { \ 142 (a) += ((k) + (t) + H((b), (c), (d))); \ 143 (a) = ROTATE(a, s); \ 144 (a) += (b); \ 145 } while (0) 146 147 #define R3(a, b, c, d, k, s, t) \ 148 do { \ 149 (a) += ((k) + (t) + I((b), (c), (d))); \ 150 (a) = ROTATE(a, s); \ 151 (a) += (b); \ 152 } while (0) 153 154 #ifndef md5_block_data_order 155 #ifdef X 156 #undef X 157 #endif 158 void md5_block_data_order(uint32_t *state, const uint8_t *data, size_t num) { 159 uint32_t A, B, C, D, l; 160 uint32_t XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7, XX8, XX9, XX10, XX11, XX12, 161 XX13, XX14, XX15; 162 #define X(i) XX##i 163 164 A = state[0]; 165 B = state[1]; 166 C = state[2]; 167 D = state[3]; 168 169 for (; num--;) { 170 HOST_c2l(data, l); 171 X(0) = l; 172 HOST_c2l(data, l); 173 X(1) = l; 174 // Round 0 175 R0(A, B, C, D, X(0), 7, 0xd76aa478L); 176 HOST_c2l(data, l); 177 X(2) = l; 178 R0(D, A, B, C, X(1), 12, 0xe8c7b756L); 179 HOST_c2l(data, l); 180 X(3) = l; 181 R0(C, D, A, B, X(2), 17, 0x242070dbL); 182 HOST_c2l(data, l); 183 X(4) = l; 184 R0(B, C, D, A, X(3), 22, 0xc1bdceeeL); 185 HOST_c2l(data, l); 186 X(5) = l; 187 R0(A, B, C, D, X(4), 7, 0xf57c0fafL); 188 HOST_c2l(data, l); 189 X(6) = l; 190 R0(D, A, B, C, X(5), 12, 0x4787c62aL); 191 HOST_c2l(data, l); 192 X(7) = l; 193 R0(C, D, A, B, X(6), 17, 0xa8304613L); 194 HOST_c2l(data, l); 195 X(8) = l; 196 R0(B, C, D, A, X(7), 22, 0xfd469501L); 197 HOST_c2l(data, l); 198 X(9) = l; 199 R0(A, B, C, D, X(8), 7, 0x698098d8L); 200 HOST_c2l(data, l); 201 X(10) = l; 202 R0(D, A, B, C, X(9), 12, 0x8b44f7afL); 203 HOST_c2l(data, l); 204 X(11) = l; 205 R0(C, D, A, B, X(10), 17, 0xffff5bb1L); 206 HOST_c2l(data, l); 207 X(12) = l; 208 R0(B, C, D, A, X(11), 22, 0x895cd7beL); 209 HOST_c2l(data, l); 210 X(13) = l; 211 R0(A, B, C, D, X(12), 7, 0x6b901122L); 212 HOST_c2l(data, l); 213 X(14) = l; 214 R0(D, A, B, C, X(13), 12, 0xfd987193L); 215 HOST_c2l(data, l); 216 X(15) = l; 217 R0(C, D, A, B, X(14), 17, 0xa679438eL); 218 R0(B, C, D, A, X(15), 22, 0x49b40821L); 219 // Round 1 220 R1(A, B, C, D, X(1), 5, 0xf61e2562L); 221 R1(D, A, B, C, X(6), 9, 0xc040b340L); 222 R1(C, D, A, B, X(11), 14, 0x265e5a51L); 223 R1(B, C, D, A, X(0), 20, 0xe9b6c7aaL); 224 R1(A, B, C, D, X(5), 5, 0xd62f105dL); 225 R1(D, A, B, C, X(10), 9, 0x02441453L); 226 R1(C, D, A, B, X(15), 14, 0xd8a1e681L); 227 R1(B, C, D, A, X(4), 20, 0xe7d3fbc8L); 228 R1(A, B, C, D, X(9), 5, 0x21e1cde6L); 229 R1(D, A, B, C, X(14), 9, 0xc33707d6L); 230 R1(C, D, A, B, X(3), 14, 0xf4d50d87L); 231 R1(B, C, D, A, X(8), 20, 0x455a14edL); 232 R1(A, B, C, D, X(13), 5, 0xa9e3e905L); 233 R1(D, A, B, C, X(2), 9, 0xfcefa3f8L); 234 R1(C, D, A, B, X(7), 14, 0x676f02d9L); 235 R1(B, C, D, A, X(12), 20, 0x8d2a4c8aL); 236 // Round 2 237 R2(A, B, C, D, X(5), 4, 0xfffa3942L); 238 R2(D, A, B, C, X(8), 11, 0x8771f681L); 239 R2(C, D, A, B, X(11), 16, 0x6d9d6122L); 240 R2(B, C, D, A, X(14), 23, 0xfde5380cL); 241 R2(A, B, C, D, X(1), 4, 0xa4beea44L); 242 R2(D, A, B, C, X(4), 11, 0x4bdecfa9L); 243 R2(C, D, A, B, X(7), 16, 0xf6bb4b60L); 244 R2(B, C, D, A, X(10), 23, 0xbebfbc70L); 245 R2(A, B, C, D, X(13), 4, 0x289b7ec6L); 246 R2(D, A, B, C, X(0), 11, 0xeaa127faL); 247 R2(C, D, A, B, X(3), 16, 0xd4ef3085L); 248 R2(B, C, D, A, X(6), 23, 0x04881d05L); 249 R2(A, B, C, D, X(9), 4, 0xd9d4d039L); 250 R2(D, A, B, C, X(12), 11, 0xe6db99e5L); 251 R2(C, D, A, B, X(15), 16, 0x1fa27cf8L); 252 R2(B, C, D, A, X(2), 23, 0xc4ac5665L); 253 // Round 3 254 R3(A, B, C, D, X(0), 6, 0xf4292244L); 255 R3(D, A, B, C, X(7), 10, 0x432aff97L); 256 R3(C, D, A, B, X(14), 15, 0xab9423a7L); 257 R3(B, C, D, A, X(5), 21, 0xfc93a039L); 258 R3(A, B, C, D, X(12), 6, 0x655b59c3L); 259 R3(D, A, B, C, X(3), 10, 0x8f0ccc92L); 260 R3(C, D, A, B, X(10), 15, 0xffeff47dL); 261 R3(B, C, D, A, X(1), 21, 0x85845dd1L); 262 R3(A, B, C, D, X(8), 6, 0x6fa87e4fL); 263 R3(D, A, B, C, X(15), 10, 0xfe2ce6e0L); 264 R3(C, D, A, B, X(6), 15, 0xa3014314L); 265 R3(B, C, D, A, X(13), 21, 0x4e0811a1L); 266 R3(A, B, C, D, X(4), 6, 0xf7537e82L); 267 R3(D, A, B, C, X(11), 10, 0xbd3af235L); 268 R3(C, D, A, B, X(2), 15, 0x2ad7d2bbL); 269 R3(B, C, D, A, X(9), 21, 0xeb86d391L); 270 271 A = state[0] += A; 272 B = state[1] += B; 273 C = state[2] += C; 274 D = state[3] += D; 275 } 276 } 277 #undef X 278 #endif 279 280 #undef DATA_ORDER_IS_LITTLE_ENDIAN 281 #undef HASH_CTX 282 #undef HASH_CBLOCK 283 #undef HASH_UPDATE 284 #undef HASH_TRANSFORM 285 #undef HASH_FINAL 286 #undef HASH_MAKE_STRING 287 #undef HASH_BLOCK_DATA_ORDER 288 #undef F 289 #undef G 290 #undef H 291 #undef I 292 #undef ROTATE 293 #undef R0 294 #undef R1 295 #undef R2 296 #undef R3 297 #undef HOST_c2l 298 #undef HOST_l2c 299
