9eb24f1f84885d5c2e51a7f675264db398c31af7Tinderbox User * Copyright (C) 2000, 2001, 2004, 2005, 2007, 2009, 2014-2018 Internet Systems Consortium, Inc. ("ISC")
0c27b3fe77ac1d5094ba3521e8142d9e7973133fMark Andrews * This Source Code Form is subject to the terms of the Mozilla Public
0c27b3fe77ac1d5094ba3521e8142d9e7973133fMark Andrews * License, v. 2.0. If a copy of the MPL was not distributed with this
0c27b3fe77ac1d5094ba3521e8142d9e7973133fMark Andrews * file, You can obtain one at http://mozilla.org/MPL/2.0/.
53f0234c3e3a845245042affb1f20a189d8791b9Automatic Updater/* $Id: md5.c,v 1.16 2009/02/06 23:47:42 tbox Exp $ */
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff * This code implements the MD5 message-digest algorithm.
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff * The algorithm is due to Ron Rivest. This code was
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff * written by Colin Plumb in 1993, no copyright is claimed.
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff * This code is in the public domain; do with it what you wish.
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff * Equivalent code is available from RSA Data Security, Inc.
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff * This code has been tested against that, and is equivalent,
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff * except that you don't need to include two pages of legalese
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff * with every copy.
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff * To compute the message digest of a chunk of bytes, declare an
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff * MD5Context structure, pass it to MD5Init, call MD5Update as
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff * needed on buffers full of bytes, and then call MD5Final, which
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff * will fill a supplied 16-byte array with the digest.
22bed621ef87bc8b6c1fea599b02c4b38dd6bf48Mark Andrews#if OPENSSL_VERSION_NUMBER < 0x10100000L || defined(LIBRESSL_VERSION_NUMBER)
76af83c9adb772f7b045c62cf8b411165bfaa5efMark Andrews#define EVP_MD_CTX_free(ptr) EVP_MD_CTX_cleanup(ptr)
f9c410d93711fbf312a0162f1e2d3f2a5ede69afFrancis Dupont if (EVP_DigestInit(ctx->ctx, EVP_md5()) != 1) {
f9c410d93711fbf312a0162f1e2d3f2a5ede69afFrancis Dupont FATAL_ERROR(__FILE__, __LINE__, "Cannot initialize MD5.");
c1d7e0562f6a72ecc07ab5140cf2b88183adbd08Francis Dupontisc_md5_update(isc_md5_t *ctx, const unsigned char *buf, unsigned int len) {
fc63119c8b7aa8827fad9e3e45e50c69bc2630e8Francis Dupont (const void *) buf,
c1d7e0562f6a72ecc07ab5140cf2b88183adbd08Francis Dupontisc_md5_final(isc_md5_t *ctx, unsigned char *digest) {
76af83c9adb772f7b045c62cf8b411165bfaa5efMark Andrews RUNTIME_CHECK(EVP_DigestFinal(ctx->ctx, digest, NULL) == 1);
acbb301e648b82fcc38b876a44403cf0fe539cc9Evan Hunt RUNTIME_CHECK(pk11_get_session(ctx, OP_DIGEST, ISC_TRUE, ISC_FALSE,
ba751492fcc4f161a18b983d4f018a1a52938cb9Evan Hunt PK11_FATALCHECK(pkcs_C_DigestInit, (ctx->session, &mech));
ba751492fcc4f161a18b983d4f018a1a52938cb9Evan Hunt (void) pkcs_C_DigestFinal(ctx->session, garbage, &len);
b5252fcde512405a68dd4becfe683d9763bd0feaMukund Sivaraman isc_safe_memwipe(garbage, sizeof(garbage));
ba751492fcc4f161a18b983d4f018a1a52938cb9Evan Huntisc_md5_update(isc_md5_t *ctx, const unsigned char *buf, unsigned int len) {
ba751492fcc4f161a18b983d4f018a1a52938cb9Evan Huntisc_md5_final(isc_md5_t *ctx, unsigned char *digest) {
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff unsigned char *p = (unsigned char *)buf;
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff *buf++ = (isc_uint32_t)((unsigned)p[3] << 8 | p[2]) << 16 |
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff * initialization constants.
ab023a65562e62b85a824509d829b6fad87e00b1Rob Austein/*! The four core functions - F1 is optimized somewhat */
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff/* #define F1(x, y, z) (x & y | ~x & z) */
ab023a65562e62b85a824509d829b6fad87e00b1Rob Austein/*! This is the central step in the MD5 algorithm. */
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff (w += f(x,y,z) + in, w = (w<<s | w>>(32-s)) + x)
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff * The core of the MD5 algorithm, this alters an existing MD5 hash to
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff * reflect the addition of 16 longwords of new data. MD5Update blocks
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff * the data and converts bytes into longwords for this routine.
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Grafftransform(isc_uint32_t buf[4], isc_uint32_t const in[16]) {
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff register isc_uint32_t a, b, c, d;
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff * Update context to reflect the concatenation of another buffer full
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graffisc_md5_update(isc_md5_t *ctx, const unsigned char *buf, unsigned int len) {
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff /* Update byte count */
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff t = 64 - (t & 0x3f); /* Space available in ctx->in (at least 1) */
e851ea826066ac5a5b01c2c23218faa0273a12e8Evan Hunt memmove((unsigned char *)ctx->in + 64 - t, buf, len);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff /* First chunk is an odd size */
e851ea826066ac5a5b01c2c23218faa0273a12e8Evan Hunt memmove((unsigned char *)ctx->in + 64 - t, buf, t);
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff /* Process data in 64-byte chunks */
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff /* Handle any remaining bytes of data. */
40f53fa8d9c6a4fc38c0014495e7a42b08f52481David Lawrence * Final wrapup - pad to 64-byte boundary with the bit pattern
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff * 1 0* (64-bit count of bits processed, MSB-first)
1ee3b153b698e888e55dc944560c845ab6e2879aBrian Wellingtonisc_md5_final(isc_md5_t *ctx, unsigned char *digest) {
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff int count = ctx->bytes[0] & 0x3f; /* Number of bytes in ctx->in */
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff unsigned char *p = (unsigned char *)ctx->in + count;
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff /* Set the first char of padding to 0x80. There is always room. */
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff /* Bytes of padding needed to make 56 bytes (-8..55) */
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff if (count < 0) { /* Padding forces an extra block */
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff /* Append length in bits and transform */
bb2d54f1b3654857b8cb0209612ed847afbd9d3cMichael Graff ctx->in[15] = ctx->bytes[1] << 3 | ctx->bytes[0] >> 29;
b5252fcde512405a68dd4becfe683d9763bd0feaMukund Sivaraman isc_safe_memwipe(ctx, sizeof(*ctx)); /* In case it's sensitive */
f9c410d93711fbf312a0162f1e2d3f2a5ede69afFrancis Dupont * Check for MD5 support; if it does not work, raise a fatal error.
f9c410d93711fbf312a0162f1e2d3f2a5ede69afFrancis Dupont * Use "a" as the test vector.
f9c410d93711fbf312a0162f1e2d3f2a5ede69afFrancis Dupont * Standard use is testing false and result true.
f9c410d93711fbf312a0162f1e2d3f2a5ede69afFrancis Dupont * Testing use is testing true and result false;
f9c410d93711fbf312a0162f1e2d3f2a5ede69afFrancis Dupont 0x0c, 0xc1, 0x75, 0xb9, 0xc0, 0xf1, 0xb6, 0xa8,
f9c410d93711fbf312a0162f1e2d3f2a5ede69afFrancis Dupont 0x31, 0xc3, 0x99, 0xe2, 0x69, 0x77, 0x26, 0x61
f9c410d93711fbf312a0162f1e2d3f2a5ede69afFrancis Dupont INSIST(sizeof(expected) == ISC_MD5_DIGESTLENGTH);
f9c410d93711fbf312a0162f1e2d3f2a5ede69afFrancis Dupont * Introduce a fault for testing.
f9c410d93711fbf312a0162f1e2d3f2a5ede69afFrancis Dupont * These functions do not return anything; any failure will be fatal.
f9c410d93711fbf312a0162f1e2d3f2a5ede69afFrancis Dupont * Must return true in standard case, should return false for testing.
2d387429a1706fd87d3db295001f4134883522d8Francis Dupont return (ISC_TF(memcmp(digest, expected, ISC_MD5_DIGESTLENGTH) == 0));
c40906dfad6dd6e3a3e3c94b8c8847bc9bc064e5Mark Andrews#else /* !PK11_MD5_DISABLE */
c40906dfad6dd6e3a3e3c94b8c8847bc9bc064e5Mark Andrews/* Make the Visual Studio linker happy */
c40906dfad6dd6e3a3e3c94b8c8847bc9bc064e5Mark Andrews#endif /* PK11_MD5_DISABLE */