1 /* $NetBSD: md5.c,v 1.2 2024/08/18 20:47:14 christos Exp $ */ 2 3 /* 4 * Copyright (C) 2004, 2005, 2007, 2009 Internet Systems Consortium, Inc. ("ISC") 5 * Copyright (C) 2000, 2001 Internet Software Consortium. 6 * 7 * Permission to use, copy, modify, and/or distribute this software for any 8 * purpose with or without fee is hereby granted, provided that the above 9 * copyright notice and this permission notice appear in all copies. 10 * 11 * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES WITH 12 * REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY 13 * AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR ANY SPECIAL, DIRECT, 14 * INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM 15 * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE 16 * OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR 17 * PERFORMANCE OF THIS SOFTWARE. 18 */ 19 20 /* Id: md5.c,v 1.16 2009/02/06 23:47:42 tbox Exp */ 21 22 /*! \file 23 * This code implements the MD5 message-digest algorithm. 24 * The algorithm is due to Ron Rivest. This code was 25 * written by Colin Plumb in 1993, no copyright is claimed. 26 * This code is in the public domain; do with it what you wish. 27 * 28 * Equivalent code is available from RSA Data Security, Inc. 29 * This code has been tested against that, and is equivalent, 30 * except that you don't need to include two pages of legalese 31 * with every copy. 32 * 33 * To compute the message digest of a chunk of bytes, declare an 34 * MD5Context structure, pass it to MD5Init, call MD5Update as 35 * needed on buffers full of bytes, and then call MD5Final, which 36 * will fill a supplied 16-byte array with the digest. 37 */ 38 39 #include "config.h" 40 41 #include <isc/assertions.h> 42 #include <isc/md5.h> 43 #include <isc/platform.h> 44 #include <isc/string.h> 45 #include <isc/types.h> 46 #include <isc/util.h> 47 48 #ifdef ISC_PLATFORM_OPENSSLHASH 49 50 void 51 isc_md5_init(isc_md5_t *ctx) { 52 EVP_DigestInit(ctx, EVP_md5()); 53 } 54 55 void 56 isc_md5_invalidate(isc_md5_t *ctx) { 57 EVP_MD_CTX_cleanup(ctx); 58 } 59 60 void 61 isc_md5_update(isc_md5_t *ctx, const unsigned char *buf, unsigned int len) { 62 EVP_DigestUpdate(ctx, (const void *) buf, (size_t) len); 63 } 64 65 void 66 isc_md5_final(isc_md5_t *ctx, unsigned char *digest) { 67 EVP_DigestFinal(ctx, digest, NULL); 68 } 69 70 #else 71 72 static void 73 byteSwap(isc_uint32_t *buf, unsigned words) 74 { 75 unsigned char *p = (unsigned char *)buf; 76 77 do { 78 *buf++ = (isc_uint32_t)((unsigned)p[3] << 8 | p[2]) << 16 | 79 ((unsigned)p[1] << 8 | p[0]); 80 p += 4; 81 } while (--words); 82 } 83 84 /*! 85 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious 86 * initialization constants. 87 */ 88 void 89 isc_md5_init(isc_md5_t *ctx) { 90 ctx->buf[0] = 0x67452301; 91 ctx->buf[1] = 0xefcdab89; 92 ctx->buf[2] = 0x98badcfe; 93 ctx->buf[3] = 0x10325476; 94 95 ctx->bytes[0] = 0; 96 ctx->bytes[1] = 0; 97 } 98 99 void 100 isc_md5_invalidate(isc_md5_t *ctx) { 101 memset(ctx, 0, sizeof(isc_md5_t)); 102 } 103 104 /*@{*/ 105 /*! The four core functions - F1 is optimized somewhat */ 106 107 /* #define F1(x, y, z) (x & y | ~x & z) */ 108 #define F1(x, y, z) (z ^ (x & (y ^ z))) 109 #define F2(x, y, z) F1(z, x, y) 110 #define F3(x, y, z) (x ^ y ^ z) 111 #define F4(x, y, z) (y ^ (x | ~z)) 112 /*@}*/ 113 114 /*! This is the central step in the MD5 algorithm. */ 115 #define MD5STEP(f,w,x,y,z,in,s) \ 116 (w += f(x,y,z) + in, w = (w<<s | w>>(32-s)) + x) 117 118 /*! 119 * The core of the MD5 algorithm, this alters an existing MD5 hash to 120 * reflect the addition of 16 longwords of new data. MD5Update blocks 121 * the data and converts bytes into longwords for this routine. 122 */ 123 static void 124 transform(isc_uint32_t buf[4], isc_uint32_t const in[16]) { 125 register isc_uint32_t a, b, c, d; 126 127 a = buf[0]; 128 b = buf[1]; 129 c = buf[2]; 130 d = buf[3]; 131 132 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); 133 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); 134 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); 135 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); 136 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); 137 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12); 138 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17); 139 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22); 140 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7); 141 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12); 142 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17); 143 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22); 144 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7); 145 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12); 146 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17); 147 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22); 148 149 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5); 150 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9); 151 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14); 152 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20); 153 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5); 154 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9); 155 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14); 156 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20); 157 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5); 158 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9); 159 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14); 160 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20); 161 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5); 162 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9); 163 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14); 164 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20); 165 166 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4); 167 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11); 168 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16); 169 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23); 170 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4); 171 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11); 172 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16); 173 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23); 174 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4); 175 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11); 176 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16); 177 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23); 178 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4); 179 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11); 180 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16); 181 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23); 182 183 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6); 184 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10); 185 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15); 186 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21); 187 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6); 188 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10); 189 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15); 190 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21); 191 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6); 192 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10); 193 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15); 194 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21); 195 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6); 196 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10); 197 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15); 198 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21); 199 200 buf[0] += a; 201 buf[1] += b; 202 buf[2] += c; 203 buf[3] += d; 204 } 205 206 /*! 207 * Update context to reflect the concatenation of another buffer full 208 * of bytes. 209 */ 210 void 211 isc_md5_update(isc_md5_t *ctx, const unsigned char *buf, unsigned int len) { 212 isc_uint32_t t; 213 214 /* Update byte count */ 215 216 t = ctx->bytes[0]; 217 if ((ctx->bytes[0] = t + len) < t) 218 ctx->bytes[1]++; /* Carry from low to high */ 219 220 t = 64 - (t & 0x3f); /* Space available in ctx->in (at least 1) */ 221 if (t > len) { 222 memcpy((unsigned char *)ctx->in + 64 - t, buf, len); 223 return; 224 } 225 /* First chunk is an odd size */ 226 memcpy((unsigned char *)ctx->in + 64 - t, buf, t); 227 byteSwap(ctx->in, 16); 228 transform(ctx->buf, ctx->in); 229 buf += t; 230 len -= t; 231 232 /* Process data in 64-byte chunks */ 233 while (len >= 64) { 234 memcpy(ctx->in, buf, 64); 235 byteSwap(ctx->in, 16); 236 transform(ctx->buf, ctx->in); 237 buf += 64; 238 len -= 64; 239 } 240 241 /* Handle any remaining bytes of data. */ 242 memcpy(ctx->in, buf, len); 243 } 244 245 /*! 246 * Final wrapup - pad to 64-byte boundary with the bit pattern 247 * 1 0* (64-bit count of bits processed, MSB-first) 248 */ 249 void 250 isc_md5_final(isc_md5_t *ctx, unsigned char *digest) { 251 int count = ctx->bytes[0] & 0x3f; /* Number of bytes in ctx->in */ 252 unsigned char *p = (unsigned char *)ctx->in + count; 253 254 /* Set the first char of padding to 0x80. There is always room. */ 255 *p++ = 0x80; 256 257 /* Bytes of padding needed to make 56 bytes (-8..55) */ 258 count = 56 - 1 - count; 259 260 if (count < 0) { /* Padding forces an extra block */ 261 memset(p, 0, count + 8); 262 byteSwap(ctx->in, 16); 263 transform(ctx->buf, ctx->in); 264 p = (unsigned char *)ctx->in; 265 count = 56; 266 } 267 memset(p, 0, count); 268 byteSwap(ctx->in, 14); 269 270 /* Append length in bits and transform */ 271 ctx->in[14] = ctx->bytes[0] << 3; 272 ctx->in[15] = ctx->bytes[1] << 3 | ctx->bytes[0] >> 29; 273 transform(ctx->buf, ctx->in); 274 275 byteSwap(ctx->buf, 4); 276 memcpy(digest, ctx->buf, 16); 277 memset(ctx, 0, sizeof(isc_md5_t)); /* In case it's sensitive */ 278 } 279 #endif 280