18d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt/* 28d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * MD5 hash implementation and interface functions 38d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * Copyright (c) 2003-2005, Jouni Malinen <j@w1.fi> 48d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * 5c5ec7f57ead87efa365800228aa0b09a12d9e6c4Dmitry Shmidt * This software may be distributed under the terms of the BSD license. 6c5ec7f57ead87efa365800228aa0b09a12d9e6c4Dmitry Shmidt * See README for more details. 78d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt */ 88d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 98d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt#include "includes.h" 108d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 118d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt#include "common.h" 128d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt#include "md5.h" 138d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt#include "md5_i.h" 148d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt#include "crypto.h" 158d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 168d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 178d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidtstatic void MD5Transform(u32 buf[4], u32 const in[16]); 188d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 198d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 208d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidttypedef struct MD5Context MD5_CTX; 218d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 228d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 238d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt/** 248d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * md5_vector - MD5 hash for data vector 258d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * @num_elem: Number of elements in the data vector 268d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * @addr: Pointers to the data areas 278d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * @len: Lengths of the data blocks 288d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * @mac: Buffer for the hash 298d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * Returns: 0 on success, -1 of failure 308d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt */ 318d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidtint md5_vector(size_t num_elem, const u8 *addr[], const size_t *len, u8 *mac) 328d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt{ 338d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5_CTX ctx; 348d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt size_t i; 358d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 368d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5Init(&ctx); 378d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt for (i = 0; i < num_elem; i++) 388d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5Update(&ctx, addr[i], len[i]); 398d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5Final(mac, &ctx); 408d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt return 0; 418d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt} 428d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 438d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 448d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt/* ===== start - public domain MD5 implementation ===== */ 458d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt/* 468d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * This code implements the MD5 message-digest algorithm. 478d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * The algorithm is due to Ron Rivest. This code was 488d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * written by Colin Plumb in 1993, no copyright is claimed. 498d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * This code is in the public domain; do with it what you wish. 508d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * 518d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * Equivalent code is available from RSA Data Security, Inc. 528d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * This code has been tested against that, and is equivalent, 538d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * except that you don't need to include two pages of legalese 548d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * with every copy. 558d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * 568d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * To compute the message digest of a chunk of bytes, declare an 578d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * MD5Context structure, pass it to MD5Init, call MD5Update as 588d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * needed on buffers full of bytes, and then call MD5Final, which 598d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * will fill a supplied 16-byte array with the digest. 608d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt */ 618d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 628d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt#ifndef WORDS_BIGENDIAN 638d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt#define byteReverse(buf, len) /* Nothing */ 648d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt#else 658d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt/* 668d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * Note: this code is harmless on little-endian machines. 678d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt */ 688d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidtstatic void byteReverse(unsigned char *buf, unsigned longs) 698d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt{ 708d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt u32 t; 718d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt do { 728d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt t = (u32) ((unsigned) buf[3] << 8 | buf[2]) << 16 | 738d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt ((unsigned) buf[1] << 8 | buf[0]); 748d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt *(u32 *) buf = t; 758d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt buf += 4; 768d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt } while (--longs); 778d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt} 788d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt#endif 798d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 808d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt/* 818d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious 828d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * initialization constants. 838d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt */ 848d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidtvoid MD5Init(struct MD5Context *ctx) 858d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt{ 868d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt ctx->buf[0] = 0x67452301; 878d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt ctx->buf[1] = 0xefcdab89; 888d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt ctx->buf[2] = 0x98badcfe; 898d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt ctx->buf[3] = 0x10325476; 908d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 918d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt ctx->bits[0] = 0; 928d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt ctx->bits[1] = 0; 938d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt} 948d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 958d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt/* 968d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * Update context to reflect the concatenation of another buffer full 978d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * of bytes. 988d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt */ 998d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidtvoid MD5Update(struct MD5Context *ctx, unsigned char const *buf, unsigned len) 1008d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt{ 1018d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt u32 t; 1028d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 1038d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt /* Update bitcount */ 1048d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 1058d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt t = ctx->bits[0]; 1068d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt if ((ctx->bits[0] = t + ((u32) len << 3)) < t) 1078d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt ctx->bits[1]++; /* Carry from low to high */ 1088d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt ctx->bits[1] += len >> 29; 1098d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 1108d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */ 1118d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 1128d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt /* Handle any leading odd-sized chunks */ 1138d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 1148d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt if (t) { 1158d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt unsigned char *p = (unsigned char *) ctx->in + t; 1168d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 1178d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt t = 64 - t; 1188d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt if (len < t) { 1198d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt os_memcpy(p, buf, len); 1208d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt return; 1218d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt } 1228d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt os_memcpy(p, buf, t); 1238d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt byteReverse(ctx->in, 16); 1248d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5Transform(ctx->buf, (u32 *) ctx->in); 1258d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt buf += t; 1268d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt len -= t; 1278d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt } 1288d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt /* Process data in 64-byte chunks */ 1298d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 1308d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt while (len >= 64) { 1318d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt os_memcpy(ctx->in, buf, 64); 1328d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt byteReverse(ctx->in, 16); 1338d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5Transform(ctx->buf, (u32 *) ctx->in); 1348d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt buf += 64; 1358d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt len -= 64; 1368d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt } 1378d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 1388d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt /* Handle any remaining bytes of data. */ 1398d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 1408d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt os_memcpy(ctx->in, buf, len); 1418d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt} 1428d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 1438d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt/* 1448d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * Final wrapup - pad to 64-byte boundary with the bit pattern 1458d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * 1 0* (64-bit count of bits processed, MSB-first) 1468d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt */ 1478d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidtvoid MD5Final(unsigned char digest[16], struct MD5Context *ctx) 1488d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt{ 1498d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt unsigned count; 1508d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt unsigned char *p; 1518d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 1528d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt /* Compute number of bytes mod 64 */ 1538d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt count = (ctx->bits[0] >> 3) & 0x3F; 1548d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 1558d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt /* Set the first char of padding to 0x80. This is safe since there is 1568d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt always at least one byte free */ 1578d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt p = ctx->in + count; 1588d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt *p++ = 0x80; 1598d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 1608d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt /* Bytes of padding needed to make 64 bytes */ 1618d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt count = 64 - 1 - count; 1628d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 1638d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt /* Pad out to 56 mod 64 */ 1648d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt if (count < 8) { 1658d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt /* Two lots of padding: Pad the first block to 64 bytes */ 1668d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt os_memset(p, 0, count); 1678d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt byteReverse(ctx->in, 16); 1688d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5Transform(ctx->buf, (u32 *) ctx->in); 1698d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 1708d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt /* Now fill the next block with 56 bytes */ 1718d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt os_memset(ctx->in, 0, 56); 1728d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt } else { 1738d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt /* Pad block to 56 bytes */ 1748d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt os_memset(p, 0, count - 8); 1758d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt } 1768d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt byteReverse(ctx->in, 14); 1778d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 1788d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt /* Append length in bits and transform */ 179d5e4923d04122f81300fa68fb07d64ede28fd44dDmitry Shmidt ((u32 *) aliasing_hide_typecast(ctx->in, u32))[14] = ctx->bits[0]; 180d5e4923d04122f81300fa68fb07d64ede28fd44dDmitry Shmidt ((u32 *) aliasing_hide_typecast(ctx->in, u32))[15] = ctx->bits[1]; 1818d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 1828d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5Transform(ctx->buf, (u32 *) ctx->in); 1838d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt byteReverse((unsigned char *) ctx->buf, 4); 1848d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt os_memcpy(digest, ctx->buf, 16); 1851f69aa52ea2e0a73ac502565df8c666ee49cab6aDmitry Shmidt os_memset(ctx, 0, sizeof(*ctx)); /* In case it's sensitive */ 1868d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt} 1878d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 1888d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt/* The four core functions - F1 is optimized somewhat */ 1898d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 1908d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt/* #define F1(x, y, z) (x & y | ~x & z) */ 1918d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt#define F1(x, y, z) (z ^ (x & (y ^ z))) 1928d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt#define F2(x, y, z) F1(z, x, y) 1938d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt#define F3(x, y, z) (x ^ y ^ z) 1948d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt#define F4(x, y, z) (y ^ (x | ~z)) 1958d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 1968d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt/* This is the central step in the MD5 algorithm. */ 1978d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt#define MD5STEP(f, w, x, y, z, data, s) \ 1988d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x ) 1998d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 2008d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt/* 2018d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * The core of the MD5 algorithm, this alters an existing MD5 hash to 2028d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * reflect the addition of 16 longwords of new data. MD5Update blocks 2038d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt * the data and converts bytes into longwords for this routine. 2048d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt */ 2058d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidtstatic void MD5Transform(u32 buf[4], u32 const in[16]) 2068d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt{ 2078d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt register u32 a, b, c, d; 2088d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 2098d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt a = buf[0]; 2108d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt b = buf[1]; 2118d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt c = buf[2]; 2128d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt d = buf[3]; 2138d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 2148d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); 2158d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); 2168d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); 2178d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); 2188d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); 2198d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12); 2208d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17); 2218d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22); 2228d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7); 2238d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12); 2248d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17); 2258d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22); 2268d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7); 2278d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12); 2288d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17); 2298d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22); 2308d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 2318d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5); 2328d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9); 2338d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14); 2348d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20); 2358d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5); 2368d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9); 2378d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14); 2388d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20); 2398d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5); 2408d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9); 2418d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14); 2428d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20); 2438d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5); 2448d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9); 2458d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14); 2468d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20); 2478d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 2488d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4); 2498d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11); 2508d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16); 2518d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23); 2528d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4); 2538d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11); 2548d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16); 2558d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23); 2568d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4); 2578d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11); 2588d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16); 2598d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23); 2608d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4); 2618d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11); 2628d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16); 2638d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23); 2648d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 2658d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6); 2668d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10); 2678d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15); 2688d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21); 2698d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6); 2708d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10); 2718d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15); 2728d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21); 2738d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6); 2748d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10); 2758d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15); 2768d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21); 2778d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6); 2788d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10); 2798d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15); 2808d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21); 2818d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt 2828d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt buf[0] += a; 2838d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt buf[1] += b; 2848d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt buf[2] += c; 2858d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt buf[3] += d; 2868d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt} 2878d520ff1dc2da35cdca849e982051b86468016d8Dmitry Shmidt/* ===== end - public domain MD5 implementation ===== */ 288