1214501Srpaulo/* 2214501Srpaulo * MD5 hash implementation and interface functions 3214501Srpaulo * Copyright (c) 2003-2005, Jouni Malinen <j@w1.fi> 4214501Srpaulo * 5214501Srpaulo * This program is free software; you can redistribute it and/or modify 6214501Srpaulo * it under the terms of the GNU General Public License version 2 as 7214501Srpaulo * published by the Free Software Foundation. 8214501Srpaulo * 9214501Srpaulo * Alternatively, this software may be distributed under the terms of BSD 10214501Srpaulo * license. 11214501Srpaulo * 12214501Srpaulo * See README and COPYING for more details. 13214501Srpaulo */ 14214501Srpaulo 15214501Srpaulo#include "includes.h" 16214501Srpaulo 17214501Srpaulo#include "common.h" 18214501Srpaulo#include "md5.h" 19214501Srpaulo#include "md5_i.h" 20214501Srpaulo#include "crypto.h" 21214501Srpaulo 22214501Srpaulo 23214501Srpaulostatic void MD5Transform(u32 buf[4], u32 const in[16]); 24214501Srpaulo 25214501Srpaulo 26214501Srpaulotypedef struct MD5Context MD5_CTX; 27214501Srpaulo 28214501Srpaulo 29214501Srpaulo/** 30214501Srpaulo * md5_vector - MD5 hash for data vector 31214501Srpaulo * @num_elem: Number of elements in the data vector 32214501Srpaulo * @addr: Pointers to the data areas 33214501Srpaulo * @len: Lengths of the data blocks 34214501Srpaulo * @mac: Buffer for the hash 35214501Srpaulo * Returns: 0 on success, -1 of failure 36214501Srpaulo */ 37214501Srpauloint md5_vector(size_t num_elem, const u8 *addr[], const size_t *len, u8 *mac) 38214501Srpaulo{ 39214501Srpaulo MD5_CTX ctx; 40214501Srpaulo size_t i; 41214501Srpaulo 42214501Srpaulo MD5Init(&ctx); 43214501Srpaulo for (i = 0; i < num_elem; i++) 44214501Srpaulo MD5Update(&ctx, addr[i], len[i]); 45214501Srpaulo MD5Final(mac, &ctx); 46214501Srpaulo return 0; 47214501Srpaulo} 48214501Srpaulo 49214501Srpaulo 50214501Srpaulo/* ===== start - public domain MD5 implementation ===== */ 51214501Srpaulo/* 52214501Srpaulo * This code implements the MD5 message-digest algorithm. 53214501Srpaulo * The algorithm is due to Ron Rivest. This code was 54214501Srpaulo * written by Colin Plumb in 1993, no copyright is claimed. 55214501Srpaulo * This code is in the public domain; do with it what you wish. 56214501Srpaulo * 57214501Srpaulo * Equivalent code is available from RSA Data Security, Inc. 58214501Srpaulo * This code has been tested against that, and is equivalent, 59214501Srpaulo * except that you don't need to include two pages of legalese 60214501Srpaulo * with every copy. 61214501Srpaulo * 62214501Srpaulo * To compute the message digest of a chunk of bytes, declare an 63214501Srpaulo * MD5Context structure, pass it to MD5Init, call MD5Update as 64214501Srpaulo * needed on buffers full of bytes, and then call MD5Final, which 65214501Srpaulo * will fill a supplied 16-byte array with the digest. 66214501Srpaulo */ 67214501Srpaulo 68214501Srpaulo#ifndef WORDS_BIGENDIAN 69214501Srpaulo#define byteReverse(buf, len) /* Nothing */ 70214501Srpaulo#else 71214501Srpaulo/* 72214501Srpaulo * Note: this code is harmless on little-endian machines. 73214501Srpaulo */ 74214501Srpaulostatic void byteReverse(unsigned char *buf, unsigned longs) 75214501Srpaulo{ 76214501Srpaulo u32 t; 77214501Srpaulo do { 78214501Srpaulo t = (u32) ((unsigned) buf[3] << 8 | buf[2]) << 16 | 79214501Srpaulo ((unsigned) buf[1] << 8 | buf[0]); 80214501Srpaulo *(u32 *) buf = t; 81214501Srpaulo buf += 4; 82214501Srpaulo } while (--longs); 83214501Srpaulo} 84214501Srpaulo#endif 85214501Srpaulo 86214501Srpaulo/* 87214501Srpaulo * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious 88214501Srpaulo * initialization constants. 89214501Srpaulo */ 90214501Srpaulovoid MD5Init(struct MD5Context *ctx) 91214501Srpaulo{ 92214501Srpaulo ctx->buf[0] = 0x67452301; 93214501Srpaulo ctx->buf[1] = 0xefcdab89; 94214501Srpaulo ctx->buf[2] = 0x98badcfe; 95214501Srpaulo ctx->buf[3] = 0x10325476; 96214501Srpaulo 97214501Srpaulo ctx->bits[0] = 0; 98214501Srpaulo ctx->bits[1] = 0; 99214501Srpaulo} 100214501Srpaulo 101214501Srpaulo/* 102214501Srpaulo * Update context to reflect the concatenation of another buffer full 103214501Srpaulo * of bytes. 104214501Srpaulo */ 105214501Srpaulovoid MD5Update(struct MD5Context *ctx, unsigned char const *buf, unsigned len) 106214501Srpaulo{ 107214501Srpaulo u32 t; 108214501Srpaulo 109214501Srpaulo /* Update bitcount */ 110214501Srpaulo 111214501Srpaulo t = ctx->bits[0]; 112214501Srpaulo if ((ctx->bits[0] = t + ((u32) len << 3)) < t) 113214501Srpaulo ctx->bits[1]++; /* Carry from low to high */ 114214501Srpaulo ctx->bits[1] += len >> 29; 115214501Srpaulo 116214501Srpaulo t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */ 117214501Srpaulo 118214501Srpaulo /* Handle any leading odd-sized chunks */ 119214501Srpaulo 120214501Srpaulo if (t) { 121214501Srpaulo unsigned char *p = (unsigned char *) ctx->in + t; 122214501Srpaulo 123214501Srpaulo t = 64 - t; 124214501Srpaulo if (len < t) { 125214501Srpaulo os_memcpy(p, buf, len); 126214501Srpaulo return; 127214501Srpaulo } 128214501Srpaulo os_memcpy(p, buf, t); 129214501Srpaulo byteReverse(ctx->in, 16); 130214501Srpaulo MD5Transform(ctx->buf, (u32 *) ctx->in); 131214501Srpaulo buf += t; 132214501Srpaulo len -= t; 133214501Srpaulo } 134214501Srpaulo /* Process data in 64-byte chunks */ 135214501Srpaulo 136214501Srpaulo while (len >= 64) { 137214501Srpaulo os_memcpy(ctx->in, buf, 64); 138214501Srpaulo byteReverse(ctx->in, 16); 139214501Srpaulo MD5Transform(ctx->buf, (u32 *) ctx->in); 140214501Srpaulo buf += 64; 141214501Srpaulo len -= 64; 142214501Srpaulo } 143214501Srpaulo 144214501Srpaulo /* Handle any remaining bytes of data. */ 145214501Srpaulo 146214501Srpaulo os_memcpy(ctx->in, buf, len); 147214501Srpaulo} 148214501Srpaulo 149214501Srpaulo/* 150214501Srpaulo * Final wrapup - pad to 64-byte boundary with the bit pattern 151214501Srpaulo * 1 0* (64-bit count of bits processed, MSB-first) 152214501Srpaulo */ 153214501Srpaulovoid MD5Final(unsigned char digest[16], struct MD5Context *ctx) 154214501Srpaulo{ 155214501Srpaulo unsigned count; 156214501Srpaulo unsigned char *p; 157214501Srpaulo 158214501Srpaulo /* Compute number of bytes mod 64 */ 159214501Srpaulo count = (ctx->bits[0] >> 3) & 0x3F; 160214501Srpaulo 161214501Srpaulo /* Set the first char of padding to 0x80. This is safe since there is 162214501Srpaulo always at least one byte free */ 163214501Srpaulo p = ctx->in + count; 164214501Srpaulo *p++ = 0x80; 165214501Srpaulo 166214501Srpaulo /* Bytes of padding needed to make 64 bytes */ 167214501Srpaulo count = 64 - 1 - count; 168214501Srpaulo 169214501Srpaulo /* Pad out to 56 mod 64 */ 170214501Srpaulo if (count < 8) { 171214501Srpaulo /* Two lots of padding: Pad the first block to 64 bytes */ 172214501Srpaulo os_memset(p, 0, count); 173214501Srpaulo byteReverse(ctx->in, 16); 174214501Srpaulo MD5Transform(ctx->buf, (u32 *) ctx->in); 175214501Srpaulo 176214501Srpaulo /* Now fill the next block with 56 bytes */ 177214501Srpaulo os_memset(ctx->in, 0, 56); 178214501Srpaulo } else { 179214501Srpaulo /* Pad block to 56 bytes */ 180214501Srpaulo os_memset(p, 0, count - 8); 181214501Srpaulo } 182214501Srpaulo byteReverse(ctx->in, 14); 183214501Srpaulo 184214501Srpaulo /* Append length in bits and transform */ 185214501Srpaulo ((u32 *) ctx->in)[14] = ctx->bits[0]; 186214501Srpaulo ((u32 *) ctx->in)[15] = ctx->bits[1]; 187214501Srpaulo 188214501Srpaulo MD5Transform(ctx->buf, (u32 *) ctx->in); 189214501Srpaulo byteReverse((unsigned char *) ctx->buf, 4); 190214501Srpaulo os_memcpy(digest, ctx->buf, 16); 191246982Sdim os_memset(ctx, 0, sizeof(*ctx)); /* In case it's sensitive */ 192214501Srpaulo} 193214501Srpaulo 194214501Srpaulo/* The four core functions - F1 is optimized somewhat */ 195214501Srpaulo 196214501Srpaulo/* #define F1(x, y, z) (x & y | ~x & z) */ 197214501Srpaulo#define F1(x, y, z) (z ^ (x & (y ^ z))) 198214501Srpaulo#define F2(x, y, z) F1(z, x, y) 199214501Srpaulo#define F3(x, y, z) (x ^ y ^ z) 200214501Srpaulo#define F4(x, y, z) (y ^ (x | ~z)) 201214501Srpaulo 202214501Srpaulo/* This is the central step in the MD5 algorithm. */ 203214501Srpaulo#define MD5STEP(f, w, x, y, z, data, s) \ 204214501Srpaulo ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x ) 205214501Srpaulo 206214501Srpaulo/* 207214501Srpaulo * The core of the MD5 algorithm, this alters an existing MD5 hash to 208214501Srpaulo * reflect the addition of 16 longwords of new data. MD5Update blocks 209214501Srpaulo * the data and converts bytes into longwords for this routine. 210214501Srpaulo */ 211214501Srpaulostatic void MD5Transform(u32 buf[4], u32 const in[16]) 212214501Srpaulo{ 213214501Srpaulo register u32 a, b, c, d; 214214501Srpaulo 215214501Srpaulo a = buf[0]; 216214501Srpaulo b = buf[1]; 217214501Srpaulo c = buf[2]; 218214501Srpaulo d = buf[3]; 219214501Srpaulo 220214501Srpaulo MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); 221214501Srpaulo MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); 222214501Srpaulo MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); 223214501Srpaulo MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); 224214501Srpaulo MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); 225214501Srpaulo MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12); 226214501Srpaulo MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17); 227214501Srpaulo MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22); 228214501Srpaulo MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7); 229214501Srpaulo MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12); 230214501Srpaulo MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17); 231214501Srpaulo MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22); 232214501Srpaulo MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7); 233214501Srpaulo MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12); 234214501Srpaulo MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17); 235214501Srpaulo MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22); 236214501Srpaulo 237214501Srpaulo MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5); 238214501Srpaulo MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9); 239214501Srpaulo MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14); 240214501Srpaulo MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20); 241214501Srpaulo MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5); 242214501Srpaulo MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9); 243214501Srpaulo MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14); 244214501Srpaulo MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20); 245214501Srpaulo MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5); 246214501Srpaulo MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9); 247214501Srpaulo MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14); 248214501Srpaulo MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20); 249214501Srpaulo MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5); 250214501Srpaulo MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9); 251214501Srpaulo MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14); 252214501Srpaulo MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20); 253214501Srpaulo 254214501Srpaulo MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4); 255214501Srpaulo MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11); 256214501Srpaulo MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16); 257214501Srpaulo MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23); 258214501Srpaulo MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4); 259214501Srpaulo MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11); 260214501Srpaulo MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16); 261214501Srpaulo MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23); 262214501Srpaulo MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4); 263214501Srpaulo MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11); 264214501Srpaulo MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16); 265214501Srpaulo MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23); 266214501Srpaulo MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4); 267214501Srpaulo MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11); 268214501Srpaulo MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16); 269214501Srpaulo MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23); 270214501Srpaulo 271214501Srpaulo MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6); 272214501Srpaulo MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10); 273214501Srpaulo MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15); 274214501Srpaulo MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21); 275214501Srpaulo MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6); 276214501Srpaulo MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10); 277214501Srpaulo MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15); 278214501Srpaulo MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21); 279214501Srpaulo MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6); 280214501Srpaulo MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10); 281214501Srpaulo MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15); 282214501Srpaulo MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21); 283214501Srpaulo MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6); 284214501Srpaulo MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10); 285214501Srpaulo MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15); 286214501Srpaulo MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21); 287214501Srpaulo 288214501Srpaulo buf[0] += a; 289214501Srpaulo buf[1] += b; 290214501Srpaulo buf[2] += c; 291214501Srpaulo buf[3] += d; 292214501Srpaulo} 293214501Srpaulo/* ===== end - public domain MD5 implementation ===== */ 294