]>
Commit | Line | Data |
---|---|---|
3009458e RL |
1 | /* crypto/md4/md4_dgst.c */ |
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 <stdio.h> | |
60 | #include "md4_locl.h" | |
61 | #include <openssl/opensslv.h> | |
62 | ||
63 | const char *MD4_version="MD4" OPENSSL_VERSION_PTEXT; | |
64 | ||
65 | /* Implemented from RFC1186 The MD4 Message-Digest Algorithm | |
66 | */ | |
67 | ||
68 | #define INIT_DATA_A (unsigned long)0x67452301L | |
69 | #define INIT_DATA_B (unsigned long)0xefcdab89L | |
70 | #define INIT_DATA_C (unsigned long)0x98badcfeL | |
71 | #define INIT_DATA_D (unsigned long)0x10325476L | |
72 | ||
2dc769a1 | 73 | int MD4_Init(MD4_CTX *c) |
3009458e RL |
74 | { |
75 | c->A=INIT_DATA_A; | |
76 | c->B=INIT_DATA_B; | |
77 | c->C=INIT_DATA_C; | |
78 | c->D=INIT_DATA_D; | |
79 | c->Nl=0; | |
80 | c->Nh=0; | |
81 | c->num=0; | |
2dc769a1 | 82 | return 1; |
3009458e RL |
83 | } |
84 | ||
85 | #ifndef md4_block_host_order | |
9e0aad9f | 86 | void md4_block_host_order (MD4_CTX *c, const void *data, size_t num) |
3009458e RL |
87 | { |
88 | const MD4_LONG *X=data; | |
2f98abbc | 89 | register unsigned MD32_REG_T A,B,C,D; |
3009458e RL |
90 | |
91 | A=c->A; | |
92 | B=c->B; | |
93 | C=c->C; | |
94 | D=c->D; | |
95 | ||
96 | for (;num--;X+=HASH_LBLOCK) | |
97 | { | |
98 | /* Round 0 */ | |
99 | R0(A,B,C,D,X[ 0], 3,0); | |
100 | R0(D,A,B,C,X[ 1], 7,0); | |
101 | R0(C,D,A,B,X[ 2],11,0); | |
102 | R0(B,C,D,A,X[ 3],19,0); | |
103 | R0(A,B,C,D,X[ 4], 3,0); | |
104 | R0(D,A,B,C,X[ 5], 7,0); | |
105 | R0(C,D,A,B,X[ 6],11,0); | |
106 | R0(B,C,D,A,X[ 7],19,0); | |
107 | R0(A,B,C,D,X[ 8], 3,0); | |
108 | R0(D,A,B,C,X[ 9], 7,0); | |
109 | R0(C,D,A,B,X[10],11,0); | |
110 | R0(B,C,D,A,X[11],19,0); | |
111 | R0(A,B,C,D,X[12], 3,0); | |
112 | R0(D,A,B,C,X[13], 7,0); | |
113 | R0(C,D,A,B,X[14],11,0); | |
114 | R0(B,C,D,A,X[15],19,0); | |
115 | /* Round 1 */ | |
116 | R1(A,B,C,D,X[ 0], 3,0x5A827999L); | |
117 | R1(D,A,B,C,X[ 4], 5,0x5A827999L); | |
118 | R1(C,D,A,B,X[ 8], 9,0x5A827999L); | |
119 | R1(B,C,D,A,X[12],13,0x5A827999L); | |
120 | R1(A,B,C,D,X[ 1], 3,0x5A827999L); | |
121 | R1(D,A,B,C,X[ 5], 5,0x5A827999L); | |
122 | R1(C,D,A,B,X[ 9], 9,0x5A827999L); | |
123 | R1(B,C,D,A,X[13],13,0x5A827999L); | |
124 | R1(A,B,C,D,X[ 2], 3,0x5A827999L); | |
125 | R1(D,A,B,C,X[ 6], 5,0x5A827999L); | |
126 | R1(C,D,A,B,X[10], 9,0x5A827999L); | |
127 | R1(B,C,D,A,X[14],13,0x5A827999L); | |
128 | R1(A,B,C,D,X[ 3], 3,0x5A827999L); | |
129 | R1(D,A,B,C,X[ 7], 5,0x5A827999L); | |
130 | R1(C,D,A,B,X[11], 9,0x5A827999L); | |
131 | R1(B,C,D,A,X[15],13,0x5A827999L); | |
132 | /* Round 2 */ | |
133 | R2(A,B,C,D,X[ 0], 3,0x6ED9EBA1); | |
134 | R2(D,A,B,C,X[ 8], 9,0x6ED9EBA1); | |
135 | R2(C,D,A,B,X[ 4],11,0x6ED9EBA1); | |
136 | R2(B,C,D,A,X[12],15,0x6ED9EBA1); | |
137 | R2(A,B,C,D,X[ 2], 3,0x6ED9EBA1); | |
138 | R2(D,A,B,C,X[10], 9,0x6ED9EBA1); | |
139 | R2(C,D,A,B,X[ 6],11,0x6ED9EBA1); | |
140 | R2(B,C,D,A,X[14],15,0x6ED9EBA1); | |
141 | R2(A,B,C,D,X[ 1], 3,0x6ED9EBA1); | |
142 | R2(D,A,B,C,X[ 9], 9,0x6ED9EBA1); | |
143 | R2(C,D,A,B,X[ 5],11,0x6ED9EBA1); | |
144 | R2(B,C,D,A,X[13],15,0x6ED9EBA1); | |
145 | R2(A,B,C,D,X[ 3], 3,0x6ED9EBA1); | |
146 | R2(D,A,B,C,X[11], 9,0x6ED9EBA1); | |
147 | R2(C,D,A,B,X[ 7],11,0x6ED9EBA1); | |
148 | R2(B,C,D,A,X[15],15,0x6ED9EBA1); | |
149 | ||
150 | A = c->A += A; | |
151 | B = c->B += B; | |
152 | C = c->C += C; | |
153 | D = c->D += D; | |
154 | } | |
155 | } | |
156 | #endif | |
157 | ||
158 | #ifndef md4_block_data_order | |
159 | #ifdef X | |
160 | #undef X | |
161 | #endif | |
9e0aad9f | 162 | void md4_block_data_order (MD4_CTX *c, const void *data_, size_t num) |
3009458e RL |
163 | { |
164 | const unsigned char *data=data_; | |
2f98abbc | 165 | register unsigned MD32_REG_T A,B,C,D,l; |
3009458e RL |
166 | #ifndef MD32_XARRAY |
167 | /* See comment in crypto/sha/sha_locl.h for details. */ | |
2f98abbc AP |
168 | unsigned MD32_REG_T XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7, |
169 | XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15; | |
3009458e RL |
170 | # define X(i) XX##i |
171 | #else | |
172 | MD4_LONG XX[MD4_LBLOCK]; | |
173 | # define X(i) XX[i] | |
174 | #endif | |
175 | ||
176 | A=c->A; | |
177 | B=c->B; | |
178 | C=c->C; | |
179 | D=c->D; | |
180 | ||
181 | for (;num--;) | |
182 | { | |
183 | HOST_c2l(data,l); X( 0)=l; HOST_c2l(data,l); X( 1)=l; | |
184 | /* Round 0 */ | |
185 | R0(A,B,C,D,X( 0), 3,0); HOST_c2l(data,l); X( 2)=l; | |
186 | R0(D,A,B,C,X( 1), 7,0); HOST_c2l(data,l); X( 3)=l; | |
187 | R0(C,D,A,B,X( 2),11,0); HOST_c2l(data,l); X( 4)=l; | |
188 | R0(B,C,D,A,X( 3),19,0); HOST_c2l(data,l); X( 5)=l; | |
189 | R0(A,B,C,D,X( 4), 3,0); HOST_c2l(data,l); X( 6)=l; | |
190 | R0(D,A,B,C,X( 5), 7,0); HOST_c2l(data,l); X( 7)=l; | |
191 | R0(C,D,A,B,X( 6),11,0); HOST_c2l(data,l); X( 8)=l; | |
192 | R0(B,C,D,A,X( 7),19,0); HOST_c2l(data,l); X( 9)=l; | |
193 | R0(A,B,C,D,X( 8), 3,0); HOST_c2l(data,l); X(10)=l; | |
194 | R0(D,A,B,C,X( 9), 7,0); HOST_c2l(data,l); X(11)=l; | |
195 | R0(C,D,A,B,X(10),11,0); HOST_c2l(data,l); X(12)=l; | |
196 | R0(B,C,D,A,X(11),19,0); HOST_c2l(data,l); X(13)=l; | |
197 | R0(A,B,C,D,X(12), 3,0); HOST_c2l(data,l); X(14)=l; | |
198 | R0(D,A,B,C,X(13), 7,0); HOST_c2l(data,l); X(15)=l; | |
199 | R0(C,D,A,B,X(14),11,0); | |
200 | R0(B,C,D,A,X(15),19,0); | |
201 | /* Round 1 */ | |
202 | R1(A,B,C,D,X( 0), 3,0x5A827999L); | |
203 | R1(D,A,B,C,X( 4), 5,0x5A827999L); | |
204 | R1(C,D,A,B,X( 8), 9,0x5A827999L); | |
205 | R1(B,C,D,A,X(12),13,0x5A827999L); | |
206 | R1(A,B,C,D,X( 1), 3,0x5A827999L); | |
207 | R1(D,A,B,C,X( 5), 5,0x5A827999L); | |
208 | R1(C,D,A,B,X( 9), 9,0x5A827999L); | |
209 | R1(B,C,D,A,X(13),13,0x5A827999L); | |
210 | R1(A,B,C,D,X( 2), 3,0x5A827999L); | |
211 | R1(D,A,B,C,X( 6), 5,0x5A827999L); | |
212 | R1(C,D,A,B,X(10), 9,0x5A827999L); | |
213 | R1(B,C,D,A,X(14),13,0x5A827999L); | |
214 | R1(A,B,C,D,X( 3), 3,0x5A827999L); | |
215 | R1(D,A,B,C,X( 7), 5,0x5A827999L); | |
216 | R1(C,D,A,B,X(11), 9,0x5A827999L); | |
217 | R1(B,C,D,A,X(15),13,0x5A827999L); | |
218 | /* Round 2 */ | |
219 | R2(A,B,C,D,X( 0), 3,0x6ED9EBA1L); | |
220 | R2(D,A,B,C,X( 8), 9,0x6ED9EBA1L); | |
221 | R2(C,D,A,B,X( 4),11,0x6ED9EBA1L); | |
222 | R2(B,C,D,A,X(12),15,0x6ED9EBA1L); | |
223 | R2(A,B,C,D,X( 2), 3,0x6ED9EBA1L); | |
224 | R2(D,A,B,C,X(10), 9,0x6ED9EBA1L); | |
225 | R2(C,D,A,B,X( 6),11,0x6ED9EBA1L); | |
226 | R2(B,C,D,A,X(14),15,0x6ED9EBA1L); | |
227 | R2(A,B,C,D,X( 1), 3,0x6ED9EBA1L); | |
228 | R2(D,A,B,C,X( 9), 9,0x6ED9EBA1L); | |
229 | R2(C,D,A,B,X( 5),11,0x6ED9EBA1L); | |
230 | R2(B,C,D,A,X(13),15,0x6ED9EBA1L); | |
231 | R2(A,B,C,D,X( 3), 3,0x6ED9EBA1L); | |
232 | R2(D,A,B,C,X(11), 9,0x6ED9EBA1L); | |
233 | R2(C,D,A,B,X( 7),11,0x6ED9EBA1L); | |
234 | R2(B,C,D,A,X(15),15,0x6ED9EBA1L); | |
235 | ||
236 | A = c->A += A; | |
237 | B = c->B += B; | |
238 | C = c->C += C; | |
239 | D = c->D += D; | |
240 | } | |
241 | } | |
242 | #endif | |
243 | ||
244 | #ifdef undef | |
245 | int printit(unsigned long *l) | |
246 | { | |
247 | int i,ii; | |
248 | ||
249 | for (i=0; i<2; i++) | |
250 | { | |
251 | for (ii=0; ii<8; ii++) | |
252 | { | |
253 | fprintf(stderr,"%08lx ",l[i*8+ii]); | |
254 | } | |
255 | fprintf(stderr,"\n"); | |
256 | } | |
257 | } | |
258 | #endif |