1/* crypto/md4/md4_locl.h */ 2/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) 3 * All rights reserved. 4 * 5 * This package is an SSL implementation written 6 * by Eric Young (eay@cryptsoft.com). 7 * The implementation was written so as to conform with Netscapes SSL. 8 * 9 * This library is free for commercial and non-commercial use as long as 10 * the following conditions are aheared to. The following conditions 11 * apply to all code found in this distribution, be it the RC4, RSA, 12 * lhash, DES, etc., code; not just the SSL code. The SSL documentation 13 * included with this distribution is covered by the same copyright terms 14 * except that the holder is Tim Hudson (tjh@cryptsoft.com). 15 * 16 * Copyright remains Eric Young's, and as such any Copyright notices in 17 * the code are not to be removed. 18 * If this package is used in a product, Eric Young should be given attribution 19 * as the author of the parts of the library used. 20 * This can be in the form of a textual message at program startup or 21 * in documentation (online or textual) provided with the package. 22 * 23 * Redistribution and use in source and binary forms, with or without 24 * modification, are permitted provided that the following conditions 25 * are met: 26 * 1. Redistributions of source code must retain the copyright 27 * notice, this list of conditions and the following disclaimer. 28 * 2. Redistributions in binary form must reproduce the above copyright 29 * notice, this list of conditions and the following disclaimer in the 30 * documentation and/or other materials provided with the distribution. 31 * 3. All advertising materials mentioning features or use of this software 32 * must display the following acknowledgement: 33 * "This product includes cryptographic software written by 34 * Eric Young (eay@cryptsoft.com)" 35 * The word 'cryptographic' can be left out if the rouines from the library 36 * being used are not cryptographic related :-). 37 * 4. If you include any Windows specific code (or a derivative thereof) from 38 * the apps directory (application code) you must include an acknowledgement: 39 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" 40 * 41 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND 42 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 43 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 44 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 45 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 46 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 47 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 48 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 49 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 50 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 51 * SUCH DAMAGE. 52 * 53 * The licence and distribution terms for any publically available version or 54 * derivative of this code cannot be changed. i.e. this code cannot simply be 55 * copied and put under another distribution licence 56 * [including the GNU Public Licence.] 57 */ 58 59#include <stdlib.h> 60#include <string.h> 61#include <openssl/opensslconf.h> 62#include <openssl/md4.h> 63 64#ifndef MD4_LONG_LOG2 65#define MD4_LONG_LOG2 2 /* default to 32 bits */ 66#endif 67 68void md4_block_host_order (MD4_CTX *c, const void *p,int num); 69void md4_block_data_order (MD4_CTX *c, const void *p,int num); 70 71#if defined(__i386) || defined(__i386__) || defined(_M_IX86) || defined(__INTEL__) 72/* 73 * *_block_host_order is expected to handle aligned data while 74 * *_block_data_order - unaligned. As algorithm and host (x86) 75 * are in this case of the same "endianness" these two are 76 * otherwise indistinguishable. But normally you don't want to 77 * call the same function because unaligned access in places 78 * where alignment is expected is usually a "Bad Thing". Indeed, 79 * on RISCs you get punished with BUS ERROR signal or *severe* 80 * performance degradation. Intel CPUs are in turn perfectly 81 * capable of loading unaligned data without such drastic side 82 * effect. Yes, they say it's slower than aligned load, but no 83 * exception is generated and therefore performance degradation 84 * is *incomparable* with RISCs. What we should weight here is 85 * costs of unaligned access against costs of aligning data. 86 * According to my measurements allowing unaligned access results 87 * in ~9% performance improvement on Pentium II operating at 88 * 266MHz. I won't be surprised if the difference will be higher 89 * on faster systems:-) 90 * 91 * <appro@fy.chalmers.se> 92 */ 93#define md4_block_data_order md4_block_host_order 94#endif 95 96#define DATA_ORDER_IS_LITTLE_ENDIAN 97 98#define HASH_LONG MD4_LONG 99#define HASH_LONG_LOG2 MD4_LONG_LOG2 100#define HASH_CTX MD4_CTX 101#define HASH_CBLOCK MD4_CBLOCK 102#define HASH_LBLOCK MD4_LBLOCK 103#define HASH_UPDATE MD4_Update 104#define HASH_TRANSFORM MD4_Transform 105#define HASH_FINAL MD4_Final 106#define HASH_MAKE_STRING(c,s) do { \ 107 unsigned long ll; \ 108 ll=(c)->A; HOST_l2c(ll,(s)); \ 109 ll=(c)->B; HOST_l2c(ll,(s)); \ 110 ll=(c)->C; HOST_l2c(ll,(s)); \ 111 ll=(c)->D; HOST_l2c(ll,(s)); \ 112 } while (0) 113#define HASH_BLOCK_HOST_ORDER md4_block_host_order 114#if !defined(L_ENDIAN) || defined(md4_block_data_order) 115#define HASH_BLOCK_DATA_ORDER md4_block_data_order 116/* 117 * Little-endians (Intel and Alpha) feel better without this. 118 * It looks like memcpy does better job than generic 119 * md4_block_data_order on copying-n-aligning input data. 120 * But frankly speaking I didn't expect such result on Alpha. 121 * On the other hand I've got this with egcs-1.0.2 and if 122 * program is compiled with another (better?) compiler it 123 * might turn out other way around. 124 * 125 * <appro@fy.chalmers.se> 126 */ 127#endif 128 129#include "md32_common.h" 130 131/* 132#define F(x,y,z) (((x) & (y)) | ((~(x)) & (z))) 133#define G(x,y,z) (((x) & (y)) | ((x) & ((z))) | ((y) & ((z)))) 134*/ 135 136/* As pointed out by Wei Dai <weidai@eskimo.com>, the above can be 137 * simplified to the code below. Wei attributes these optimizations 138 * to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel. 139 */ 140#define F(b,c,d) ((((c) ^ (d)) & (b)) ^ (d)) 141#define G(b,c,d) (((b) & (c)) | ((b) & (d)) | ((c) & (d))) 142#define H(b,c,d) ((b) ^ (c) ^ (d)) 143 144#define R0(a,b,c,d,k,s,t) { \ 145 a+=((k)+(t)+F((b),(c),(d))); \ 146 a=ROTATE(a,s); }; 147 148#define R1(a,b,c,d,k,s,t) { \ 149 a+=((k)+(t)+G((b),(c),(d))); \ 150 a=ROTATE(a,s); };\ 151 152#define R2(a,b,c,d,k,s,t) { \ 153 a+=((k)+(t)+H((b),(c),(d))); \ 154 a=ROTATE(a,s); }; 155