| 1 | /* |
| 2 | * Unix SMB/Netbios implementation. |
| 3 | * Version 1.9. |
| 4 | * An implementation of MD4 designed for use in the SMB authentication protocol. |
| 5 | * |
| 6 | * Copyright (C) 1997-1998 Andrew Tridgell |
| 7 | * Copyright (C) 2005-2007 Wayne Davison |
| 8 | * |
| 9 | * This program is free software; you can redistribute it and/or modify |
| 10 | * it under the terms of the GNU General Public License as published by |
| 11 | * the Free Software Foundation; either version 2 of the License, or |
| 12 | * (at your option) any later version. |
| 13 | * |
| 14 | * This program is distributed in the hope that it will be useful, |
| 15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 17 | * GNU General Public License for more details. |
| 18 | * |
| 19 | * You should have received a copy of the GNU General Public License along |
| 20 | * with this program; if not, write to the Free Software Foundation, Inc., |
| 21 | * 51 Franklin Street - Fifth Floor, Boston, MA 02110-1301, USA. |
| 22 | */ |
| 23 | |
| 24 | #include "rsync.h" |
| 25 | |
| 26 | /* NOTE: This code makes no attempt to be fast! |
| 27 | * |
| 28 | * It assumes that a int is at least 32 bits long. */ |
| 29 | |
| 30 | static md_context *m; |
| 31 | |
| 32 | #define MASK32 (0xffffffff) |
| 33 | |
| 34 | #define F(X,Y,Z) ((((X)&(Y)) | ((~(X))&(Z)))) |
| 35 | #define G(X,Y,Z) ((((X)&(Y)) | ((X)&(Z)) | ((Y)&(Z)))) |
| 36 | #define H(X,Y,Z) (((X)^(Y)^(Z))) |
| 37 | #define lshift(x,s) (((((x)<<(s))&MASK32) | (((x)>>(32-(s)))&MASK32))) |
| 38 | |
| 39 | #define ROUND1(a,b,c,d,k,s) a = lshift((a + F(b,c,d) + M[k])&MASK32, s) |
| 40 | #define ROUND2(a,b,c,d,k,s) a = lshift((a + G(b,c,d) + M[k] + 0x5A827999)&MASK32,s) |
| 41 | #define ROUND3(a,b,c,d,k,s) a = lshift((a + H(b,c,d) + M[k] + 0x6ED9EBA1)&MASK32,s) |
| 42 | |
| 43 | /* this applies md4 to 64 byte chunks */ |
| 44 | static void mdfour64(uint32 *M) |
| 45 | { |
| 46 | uint32 AA, BB, CC, DD; |
| 47 | uint32 A,B,C,D; |
| 48 | |
| 49 | A = m->A; B = m->B; C = m->C; D = m->D; |
| 50 | AA = A; BB = B; CC = C; DD = D; |
| 51 | |
| 52 | ROUND1(A,B,C,D, 0, 3); ROUND1(D,A,B,C, 1, 7); |
| 53 | ROUND1(C,D,A,B, 2, 11); ROUND1(B,C,D,A, 3, 19); |
| 54 | ROUND1(A,B,C,D, 4, 3); ROUND1(D,A,B,C, 5, 7); |
| 55 | ROUND1(C,D,A,B, 6, 11); ROUND1(B,C,D,A, 7, 19); |
| 56 | ROUND1(A,B,C,D, 8, 3); ROUND1(D,A,B,C, 9, 7); |
| 57 | ROUND1(C,D,A,B, 10, 11); ROUND1(B,C,D,A, 11, 19); |
| 58 | ROUND1(A,B,C,D, 12, 3); ROUND1(D,A,B,C, 13, 7); |
| 59 | ROUND1(C,D,A,B, 14, 11); ROUND1(B,C,D,A, 15, 19); |
| 60 | |
| 61 | ROUND2(A,B,C,D, 0, 3); ROUND2(D,A,B,C, 4, 5); |
| 62 | ROUND2(C,D,A,B, 8, 9); ROUND2(B,C,D,A, 12, 13); |
| 63 | ROUND2(A,B,C,D, 1, 3); ROUND2(D,A,B,C, 5, 5); |
| 64 | ROUND2(C,D,A,B, 9, 9); ROUND2(B,C,D,A, 13, 13); |
| 65 | ROUND2(A,B,C,D, 2, 3); ROUND2(D,A,B,C, 6, 5); |
| 66 | ROUND2(C,D,A,B, 10, 9); ROUND2(B,C,D,A, 14, 13); |
| 67 | ROUND2(A,B,C,D, 3, 3); ROUND2(D,A,B,C, 7, 5); |
| 68 | ROUND2(C,D,A,B, 11, 9); ROUND2(B,C,D,A, 15, 13); |
| 69 | |
| 70 | ROUND3(A,B,C,D, 0, 3); ROUND3(D,A,B,C, 8, 9); |
| 71 | ROUND3(C,D,A,B, 4, 11); ROUND3(B,C,D,A, 12, 15); |
| 72 | ROUND3(A,B,C,D, 2, 3); ROUND3(D,A,B,C, 10, 9); |
| 73 | ROUND3(C,D,A,B, 6, 11); ROUND3(B,C,D,A, 14, 15); |
| 74 | ROUND3(A,B,C,D, 1, 3); ROUND3(D,A,B,C, 9, 9); |
| 75 | ROUND3(C,D,A,B, 5, 11); ROUND3(B,C,D,A, 13, 15); |
| 76 | ROUND3(A,B,C,D, 3, 3); ROUND3(D,A,B,C, 11, 9); |
| 77 | ROUND3(C,D,A,B, 7, 11); ROUND3(B,C,D,A, 15, 15); |
| 78 | |
| 79 | A += AA; B += BB; |
| 80 | C += CC; D += DD; |
| 81 | |
| 82 | A &= MASK32; B &= MASK32; |
| 83 | C &= MASK32; D &= MASK32; |
| 84 | |
| 85 | m->A = A; m->B = B; m->C = C; m->D = D; |
| 86 | } |
| 87 | |
| 88 | static void copy64(uint32 *M, const uchar *in) |
| 89 | { |
| 90 | int i; |
| 91 | |
| 92 | for (i = 0; i < MD4_DIGEST_LEN; i++) { |
| 93 | M[i] = (in[i*4+3] << 24) | (in[i*4+2] << 16) |
| 94 | | (in[i*4+1] << 8) | (in[i*4+0] << 0); |
| 95 | } |
| 96 | } |
| 97 | |
| 98 | static void copy4(uchar *out,uint32 x) |
| 99 | { |
| 100 | out[0] = x&0xFF; |
| 101 | out[1] = (x>>8)&0xFF; |
| 102 | out[2] = (x>>16)&0xFF; |
| 103 | out[3] = (x>>24)&0xFF; |
| 104 | } |
| 105 | |
| 106 | void mdfour_begin(md_context *md) |
| 107 | { |
| 108 | md->A = 0x67452301; |
| 109 | md->B = 0xefcdab89; |
| 110 | md->C = 0x98badcfe; |
| 111 | md->D = 0x10325476; |
| 112 | md->totalN = 0; |
| 113 | md->totalN2 = 0; |
| 114 | } |
| 115 | |
| 116 | static void mdfour_tail(const uchar *in, uint32 length) |
| 117 | { |
| 118 | uchar buf[128]; |
| 119 | uint32 M[16]; |
| 120 | extern int protocol_version; |
| 121 | |
| 122 | /* |
| 123 | * Count total number of bits, modulo 2^64 |
| 124 | */ |
| 125 | m->totalN += length << 3; |
| 126 | if (m->totalN < (length << 3)) |
| 127 | m->totalN2++; |
| 128 | m->totalN2 += length >> 29; |
| 129 | |
| 130 | memset(buf, 0, 128); |
| 131 | if (length) |
| 132 | memcpy(buf, in, length); |
| 133 | buf[length] = 0x80; |
| 134 | |
| 135 | if (length <= 55) { |
| 136 | copy4(buf+56, m->totalN); |
| 137 | /* |
| 138 | * Prior to protocol version 27 only the number of bits |
| 139 | * modulo 2^32 was included. MD4 requires the number |
| 140 | * of bits modulo 2^64, which was fixed starting with |
| 141 | * protocol version 27. |
| 142 | */ |
| 143 | if (protocol_version >= 27) |
| 144 | copy4(buf+60, m->totalN2); |
| 145 | copy64(M, buf); |
| 146 | mdfour64(M); |
| 147 | } else { |
| 148 | copy4(buf+120, m->totalN); |
| 149 | /* |
| 150 | * Prior to protocol version 27 only the number of bits |
| 151 | * modulo 2^32 was included. MD4 requires the number |
| 152 | * of bits modulo 2^64, which was fixed starting with |
| 153 | * protocol version 27. |
| 154 | */ |
| 155 | if (protocol_version >= 27) |
| 156 | copy4(buf+124, m->totalN2); |
| 157 | copy64(M, buf); |
| 158 | mdfour64(M); |
| 159 | copy64(M, buf+64); |
| 160 | mdfour64(M); |
| 161 | } |
| 162 | } |
| 163 | |
| 164 | void mdfour_update(md_context *md, const uchar *in, uint32 length) |
| 165 | { |
| 166 | uint32 M[16]; |
| 167 | |
| 168 | m = md; |
| 169 | |
| 170 | if (length == 0) |
| 171 | mdfour_tail(in, length); |
| 172 | |
| 173 | while (length >= 64) { |
| 174 | copy64(M, in); |
| 175 | mdfour64(M); |
| 176 | in += 64; |
| 177 | length -= 64; |
| 178 | m->totalN += 64 << 3; |
| 179 | if (m->totalN < 64 << 3) |
| 180 | m->totalN2++; |
| 181 | } |
| 182 | |
| 183 | if (length) |
| 184 | mdfour_tail(in, length); |
| 185 | } |
| 186 | |
| 187 | void mdfour_result(md_context *md, uchar digest[MD4_DIGEST_LEN]) |
| 188 | { |
| 189 | m = md; |
| 190 | |
| 191 | copy4(digest, m->A); |
| 192 | copy4(digest+4, m->B); |
| 193 | copy4(digest+8, m->C); |
| 194 | copy4(digest+12, m->D); |
| 195 | } |
| 196 | |
| 197 | void mdfour(uchar digest[MD4_DIGEST_LEN], uchar *in, int length) |
| 198 | { |
| 199 | md_context md; |
| 200 | mdfour_begin(&md); |
| 201 | mdfour_update(&md, in, length); |
| 202 | mdfour_result(&md, digest); |
| 203 | } |
| 204 | |
| 205 | #ifdef TEST_MDFOUR |
| 206 | int protocol_version = 28; |
| 207 | |
| 208 | static void file_checksum1(char *fname) |
| 209 | { |
| 210 | int fd, i, was_multiple_of_64 = 1; |
| 211 | md_context md; |
| 212 | uchar buf[64*1024], sum[MD4_DIGEST_LEN]; |
| 213 | |
| 214 | fd = open(fname,O_RDONLY); |
| 215 | if (fd == -1) { |
| 216 | perror("fname"); |
| 217 | exit(1); |
| 218 | } |
| 219 | |
| 220 | mdfour_begin(&md); |
| 221 | |
| 222 | while (1) { |
| 223 | int n = read(fd, buf, sizeof buf); |
| 224 | if (n <= 0) |
| 225 | break; |
| 226 | was_multiple_of_64 = !(n % 64); |
| 227 | mdfour_update(&md, buf, n); |
| 228 | } |
| 229 | if (was_multiple_of_64 && protocol_version >= 27) |
| 230 | mdfour_update(&md, buf, 0); |
| 231 | |
| 232 | close(fd); |
| 233 | |
| 234 | mdfour_result(&md, sum); |
| 235 | |
| 236 | for (i = 0; i < MD4_DIGEST_LEN; i++) |
| 237 | printf("%02X", sum[i]); |
| 238 | printf("\n"); |
| 239 | } |
| 240 | |
| 241 | int main(int argc, char *argv[]) |
| 242 | { |
| 243 | while (--argc) |
| 244 | file_checksum1(*++argv); |
| 245 | return 0; |
| 246 | } |
| 247 | #endif |