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