1 /* Copyright (C) 1995-1998 Eric Young (eay (at) cryptsoft.com) 2 * All rights reserved. 3 * 4 * This package is an SSL implementation written 5 * by Eric Young (eay (at) cryptsoft.com). 6 * The implementation was written so as to conform with Netscapes SSL. 7 * 8 * This library is free for commercial and non-commercial use as long as 9 * the following conditions are aheared to. The following conditions 10 * apply to all code found in this distribution, be it the RC4, RSA, 11 * lhash, DES, etc., code; not just the SSL code. The SSL documentation 12 * included with this distribution is covered by the same copyright terms 13 * except that the holder is Tim Hudson (tjh (at) cryptsoft.com). 14 * 15 * Copyright remains Eric Young's, and as such any Copyright notices in 16 * the code are not to be removed. 17 * If this package is used in a product, Eric Young should be given attribution 18 * as the author of the parts of the library used. 19 * This can be in the form of a textual message at program startup or 20 * in documentation (online or textual) provided with the package. 21 * 22 * Redistribution and use in source and binary forms, with or without 23 * modification, are permitted provided that the following conditions 24 * are met: 25 * 1. Redistributions of source code must retain the copyright 26 * notice, this list of conditions and the following disclaimer. 27 * 2. Redistributions in binary form must reproduce the above copyright 28 * notice, this list of conditions and the following disclaimer in the 29 * documentation and/or other materials provided with the distribution. 30 * 3. All advertising materials mentioning features or use of this software 31 * must display the following acknowledgement: 32 * "This product includes cryptographic software written by 33 * Eric Young (eay (at) cryptsoft.com)" 34 * The word 'cryptographic' can be left out if the rouines from the library 35 * being used are not cryptographic related :-). 36 * 4. If you include any Windows specific code (or a derivative thereof) from 37 * the apps directory (application code) you must include an acknowledgement: 38 * "This product includes software written by Tim Hudson (tjh (at) cryptsoft.com)" 39 * 40 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND 41 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 42 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 43 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 44 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 45 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 46 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 48 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 49 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 50 * SUCH DAMAGE. 51 * 52 * The licence and distribution terms for any publically available version or 53 * derivative of this code cannot be changed. i.e. this code cannot simply be 54 * copied and put under another distribution licence 55 * [including the GNU Public Licence.] */ 56 57 #include <openssl/md4.h> 58 59 #include <stdlib.h> 60 #include <string.h> 61 62 63 /* Implemented from RFC1186 The MD4 Message-Digest Algorithm. */ 64 65 int MD4_Init(MD4_CTX *md4) { 66 memset(md4, 0, sizeof(MD4_CTX)); 67 md4->h[0] = 0x67452301UL; 68 md4->h[1] = 0xefcdab89UL; 69 md4->h[2] = 0x98badcfeUL; 70 md4->h[3] = 0x10325476UL; 71 return 1; 72 } 73 74 void md4_block_data_order(uint32_t *state, const uint8_t *data, size_t num); 75 76 #define DATA_ORDER_IS_LITTLE_ENDIAN 77 78 #define HASH_CTX MD4_CTX 79 #define HASH_CBLOCK 64 80 #define HASH_UPDATE MD4_Update 81 #define HASH_TRANSFORM MD4_Transform 82 #define HASH_FINAL MD4_Final 83 #define HASH_MAKE_STRING(c, s) \ 84 do { \ 85 uint32_t ll; \ 86 ll = (c)->h[0]; \ 87 HOST_l2c(ll, (s)); \ 88 ll = (c)->h[1]; \ 89 HOST_l2c(ll, (s)); \ 90 ll = (c)->h[2]; \ 91 HOST_l2c(ll, (s)); \ 92 ll = (c)->h[3]; \ 93 HOST_l2c(ll, (s)); \ 94 } while (0) 95 #define HASH_BLOCK_DATA_ORDER md4_block_data_order 96 97 #include "../digest/md32_common.h" 98 99 /* As pointed out by Wei Dai <weidai (at) eskimo.com>, the above can be 100 * simplified to the code below. Wei attributes these optimizations 101 * to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel. */ 102 #define F(b, c, d) ((((c) ^ (d)) & (b)) ^ (d)) 103 #define G(b, c, d) (((b) & (c)) | ((b) & (d)) | ((c) & (d))) 104 #define H(b, c, d) ((b) ^ (c) ^ (d)) 105 106 #define ROTATE(a, n) (((a) << (n)) | ((a) >> (32 - (n)))) 107 108 #define R0(a, b, c, d, k, s, t) \ 109 { \ 110 a += ((k) + (t)+F((b), (c), (d))); \ 111 a = ROTATE(a, s); \ 112 }; 113 114 #define R1(a, b, c, d, k, s, t) \ 115 { \ 116 a += ((k) + (t)+G((b), (c), (d))); \ 117 a = ROTATE(a, s); \ 118 }; 119 120 #define R2(a, b, c, d, k, s, t) \ 121 { \ 122 a += ((k) + (t)+H((b), (c), (d))); \ 123 a = ROTATE(a, s); \ 124 }; 125 126 void md4_block_data_order(uint32_t *state, const uint8_t *data, size_t num) { 127 uint32_t A, B, C, D, l; 128 uint32_t X0, X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11, X12, X13, X14, X15; 129 130 A = state[0]; 131 B = state[1]; 132 C = state[2]; 133 D = state[3]; 134 135 for (; num--;) { 136 HOST_c2l(data, l); 137 X0 = l; 138 HOST_c2l(data, l); 139 X1 = l; 140 /* Round 0 */ 141 R0(A, B, C, D, X0, 3, 0); 142 HOST_c2l(data, l); 143 X2 = l; 144 R0(D, A, B, C, X1, 7, 0); 145 HOST_c2l(data, l); 146 X3 = l; 147 R0(C, D, A, B, X2, 11, 0); 148 HOST_c2l(data, l); 149 X4 = l; 150 R0(B, C, D, A, X3, 19, 0); 151 HOST_c2l(data, l); 152 X5 = l; 153 R0(A, B, C, D, X4, 3, 0); 154 HOST_c2l(data, l); 155 X6 = l; 156 R0(D, A, B, C, X5, 7, 0); 157 HOST_c2l(data, l); 158 X7 = l; 159 R0(C, D, A, B, X6, 11, 0); 160 HOST_c2l(data, l); 161 X8 = l; 162 R0(B, C, D, A, X7, 19, 0); 163 HOST_c2l(data, l); 164 X9 = l; 165 R0(A, B, C, D, X8, 3, 0); 166 HOST_c2l(data, l); 167 X10 = l; 168 R0(D, A, B, C, X9, 7, 0); 169 HOST_c2l(data, l); 170 X11 = l; 171 R0(C, D, A, B, X10, 11, 0); 172 HOST_c2l(data, l); 173 X12 = l; 174 R0(B, C, D, A, X11, 19, 0); 175 HOST_c2l(data, l); 176 X13 = l; 177 R0(A, B, C, D, X12, 3, 0); 178 HOST_c2l(data, l); 179 X14 = l; 180 R0(D, A, B, C, X13, 7, 0); 181 HOST_c2l(data, l); 182 X15 = l; 183 R0(C, D, A, B, X14, 11, 0); 184 R0(B, C, D, A, X15, 19, 0); 185 /* Round 1 */ 186 R1(A, B, C, D, X0, 3, 0x5A827999L); 187 R1(D, A, B, C, X4, 5, 0x5A827999L); 188 R1(C, D, A, B, X8, 9, 0x5A827999L); 189 R1(B, C, D, A, X12, 13, 0x5A827999L); 190 R1(A, B, C, D, X1, 3, 0x5A827999L); 191 R1(D, A, B, C, X5, 5, 0x5A827999L); 192 R1(C, D, A, B, X9, 9, 0x5A827999L); 193 R1(B, C, D, A, X13, 13, 0x5A827999L); 194 R1(A, B, C, D, X2, 3, 0x5A827999L); 195 R1(D, A, B, C, X6, 5, 0x5A827999L); 196 R1(C, D, A, B, X10, 9, 0x5A827999L); 197 R1(B, C, D, A, X14, 13, 0x5A827999L); 198 R1(A, B, C, D, X3, 3, 0x5A827999L); 199 R1(D, A, B, C, X7, 5, 0x5A827999L); 200 R1(C, D, A, B, X11, 9, 0x5A827999L); 201 R1(B, C, D, A, X15, 13, 0x5A827999L); 202 /* Round 2 */ 203 R2(A, B, C, D, X0, 3, 0x6ED9EBA1L); 204 R2(D, A, B, C, X8, 9, 0x6ED9EBA1L); 205 R2(C, D, A, B, X4, 11, 0x6ED9EBA1L); 206 R2(B, C, D, A, X12, 15, 0x6ED9EBA1L); 207 R2(A, B, C, D, X2, 3, 0x6ED9EBA1L); 208 R2(D, A, B, C, X10, 9, 0x6ED9EBA1L); 209 R2(C, D, A, B, X6, 11, 0x6ED9EBA1L); 210 R2(B, C, D, A, X14, 15, 0x6ED9EBA1L); 211 R2(A, B, C, D, X1, 3, 0x6ED9EBA1L); 212 R2(D, A, B, C, X9, 9, 0x6ED9EBA1L); 213 R2(C, D, A, B, X5, 11, 0x6ED9EBA1L); 214 R2(B, C, D, A, X13, 15, 0x6ED9EBA1L); 215 R2(A, B, C, D, X3, 3, 0x6ED9EBA1L); 216 R2(D, A, B, C, X11, 9, 0x6ED9EBA1L); 217 R2(C, D, A, B, X7, 11, 0x6ED9EBA1L); 218 R2(B, C, D, A, X15, 15, 0x6ED9EBA1L); 219 220 A = state[0] += A; 221 B = state[1] += B; 222 C = state[2] += C; 223 D = state[3] += D; 224 } 225 } 226
