summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/md4/md4_dgst.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/lib/libcrypto/md4/md4_dgst.c')
-rw-r--r--src/lib/libcrypto/md4/md4_dgst.c286
1 files changed, 0 insertions, 286 deletions
diff --git a/src/lib/libcrypto/md4/md4_dgst.c b/src/lib/libcrypto/md4/md4_dgst.c
deleted file mode 100644
index 6446f5f5e7..0000000000
--- a/src/lib/libcrypto/md4/md4_dgst.c
+++ /dev/null
@@ -1,286 +0,0 @@
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
63const 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
73int MD4_Init(MD4_CTX *c)
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;
82 return 1;
83 }
84
85#ifndef md4_block_host_order
86void md4_block_host_order (MD4_CTX *c, const void *data, int num)
87 {
88 const MD4_LONG *X=data;
89 register unsigned long A,B,C,D;
90 /*
91 * In case you wonder why A-D are declared as long and not
92 * as MD4_LONG. Doing so results in slight performance
93 * boost on LP64 architectures. The catch is we don't
94 * really care if 32 MSBs of a 64-bit register get polluted
95 * with eventual overflows as we *save* only 32 LSBs in
96 * *either* case. Now declaring 'em long excuses the compiler
97 * from keeping 32 MSBs zeroed resulting in 13% performance
98 * improvement under SPARC Solaris7/64 and 5% under AlphaLinux.
99 * Well, to be honest it should say that this *prevents*
100 * performance degradation.
101 *
102 * <appro@fy.chalmers.se>
103 */
104
105 A=c->A;
106 B=c->B;
107 C=c->C;
108 D=c->D;
109
110 for (;num--;X+=HASH_LBLOCK)
111 {
112 /* Round 0 */
113 R0(A,B,C,D,X[ 0], 3,0);
114 R0(D,A,B,C,X[ 1], 7,0);
115 R0(C,D,A,B,X[ 2],11,0);
116 R0(B,C,D,A,X[ 3],19,0);
117 R0(A,B,C,D,X[ 4], 3,0);
118 R0(D,A,B,C,X[ 5], 7,0);
119 R0(C,D,A,B,X[ 6],11,0);
120 R0(B,C,D,A,X[ 7],19,0);
121 R0(A,B,C,D,X[ 8], 3,0);
122 R0(D,A,B,C,X[ 9], 7,0);
123 R0(C,D,A,B,X[10],11,0);
124 R0(B,C,D,A,X[11],19,0);
125 R0(A,B,C,D,X[12], 3,0);
126 R0(D,A,B,C,X[13], 7,0);
127 R0(C,D,A,B,X[14],11,0);
128 R0(B,C,D,A,X[15],19,0);
129 /* Round 1 */
130 R1(A,B,C,D,X[ 0], 3,0x5A827999L);
131 R1(D,A,B,C,X[ 4], 5,0x5A827999L);
132 R1(C,D,A,B,X[ 8], 9,0x5A827999L);
133 R1(B,C,D,A,X[12],13,0x5A827999L);
134 R1(A,B,C,D,X[ 1], 3,0x5A827999L);
135 R1(D,A,B,C,X[ 5], 5,0x5A827999L);
136 R1(C,D,A,B,X[ 9], 9,0x5A827999L);
137 R1(B,C,D,A,X[13],13,0x5A827999L);
138 R1(A,B,C,D,X[ 2], 3,0x5A827999L);
139 R1(D,A,B,C,X[ 6], 5,0x5A827999L);
140 R1(C,D,A,B,X[10], 9,0x5A827999L);
141 R1(B,C,D,A,X[14],13,0x5A827999L);
142 R1(A,B,C,D,X[ 3], 3,0x5A827999L);
143 R1(D,A,B,C,X[ 7], 5,0x5A827999L);
144 R1(C,D,A,B,X[11], 9,0x5A827999L);
145 R1(B,C,D,A,X[15],13,0x5A827999L);
146 /* Round 2 */
147 R2(A,B,C,D,X[ 0], 3,0x6ED9EBA1);
148 R2(D,A,B,C,X[ 8], 9,0x6ED9EBA1);
149 R2(C,D,A,B,X[ 4],11,0x6ED9EBA1);
150 R2(B,C,D,A,X[12],15,0x6ED9EBA1);
151 R2(A,B,C,D,X[ 2], 3,0x6ED9EBA1);
152 R2(D,A,B,C,X[10], 9,0x6ED9EBA1);
153 R2(C,D,A,B,X[ 6],11,0x6ED9EBA1);
154 R2(B,C,D,A,X[14],15,0x6ED9EBA1);
155 R2(A,B,C,D,X[ 1], 3,0x6ED9EBA1);
156 R2(D,A,B,C,X[ 9], 9,0x6ED9EBA1);
157 R2(C,D,A,B,X[ 5],11,0x6ED9EBA1);
158 R2(B,C,D,A,X[13],15,0x6ED9EBA1);
159 R2(A,B,C,D,X[ 3], 3,0x6ED9EBA1);
160 R2(D,A,B,C,X[11], 9,0x6ED9EBA1);
161 R2(C,D,A,B,X[ 7],11,0x6ED9EBA1);
162 R2(B,C,D,A,X[15],15,0x6ED9EBA1);
163
164 A = c->A += A;
165 B = c->B += B;
166 C = c->C += C;
167 D = c->D += D;
168 }
169 }
170#endif
171
172#ifndef md4_block_data_order
173#ifdef X
174#undef X
175#endif
176void md4_block_data_order (MD4_CTX *c, const void *data_, int num)
177 {
178 const unsigned char *data=data_;
179 register unsigned long A,B,C,D,l;
180 /*
181 * In case you wonder why A-D are declared as long and not
182 * as MD4_LONG. Doing so results in slight performance
183 * boost on LP64 architectures. The catch is we don't
184 * really care if 32 MSBs of a 64-bit register get polluted
185 * with eventual overflows as we *save* only 32 LSBs in
186 * *either* case. Now declaring 'em long excuses the compiler
187 * from keeping 32 MSBs zeroed resulting in 13% performance
188 * improvement under SPARC Solaris7/64 and 5% under AlphaLinux.
189 * Well, to be honest it should say that this *prevents*
190 * performance degradation.
191 *
192 * <appro@fy.chalmers.se>
193 */
194#ifndef MD32_XARRAY
195 /* See comment in crypto/sha/sha_locl.h for details. */
196 unsigned long XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,
197 XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15;
198# define X(i) XX##i
199#else
200 MD4_LONG XX[MD4_LBLOCK];
201# define X(i) XX[i]
202#endif
203
204 A=c->A;
205 B=c->B;
206 C=c->C;
207 D=c->D;
208
209 for (;num--;)
210 {
211 HOST_c2l(data,l); X( 0)=l; HOST_c2l(data,l); X( 1)=l;
212 /* Round 0 */
213 R0(A,B,C,D,X( 0), 3,0); HOST_c2l(data,l); X( 2)=l;
214 R0(D,A,B,C,X( 1), 7,0); HOST_c2l(data,l); X( 3)=l;
215 R0(C,D,A,B,X( 2),11,0); HOST_c2l(data,l); X( 4)=l;
216 R0(B,C,D,A,X( 3),19,0); HOST_c2l(data,l); X( 5)=l;
217 R0(A,B,C,D,X( 4), 3,0); HOST_c2l(data,l); X( 6)=l;
218 R0(D,A,B,C,X( 5), 7,0); HOST_c2l(data,l); X( 7)=l;
219 R0(C,D,A,B,X( 6),11,0); HOST_c2l(data,l); X( 8)=l;
220 R0(B,C,D,A,X( 7),19,0); HOST_c2l(data,l); X( 9)=l;
221 R0(A,B,C,D,X( 8), 3,0); HOST_c2l(data,l); X(10)=l;
222 R0(D,A,B,C,X( 9), 7,0); HOST_c2l(data,l); X(11)=l;
223 R0(C,D,A,B,X(10),11,0); HOST_c2l(data,l); X(12)=l;
224 R0(B,C,D,A,X(11),19,0); HOST_c2l(data,l); X(13)=l;
225 R0(A,B,C,D,X(12), 3,0); HOST_c2l(data,l); X(14)=l;
226 R0(D,A,B,C,X(13), 7,0); HOST_c2l(data,l); X(15)=l;
227 R0(C,D,A,B,X(14),11,0);
228 R0(B,C,D,A,X(15),19,0);
229 /* Round 1 */
230 R1(A,B,C,D,X( 0), 3,0x5A827999L);
231 R1(D,A,B,C,X( 4), 5,0x5A827999L);
232 R1(C,D,A,B,X( 8), 9,0x5A827999L);
233 R1(B,C,D,A,X(12),13,0x5A827999L);
234 R1(A,B,C,D,X( 1), 3,0x5A827999L);
235 R1(D,A,B,C,X( 5), 5,0x5A827999L);
236 R1(C,D,A,B,X( 9), 9,0x5A827999L);
237 R1(B,C,D,A,X(13),13,0x5A827999L);
238 R1(A,B,C,D,X( 2), 3,0x5A827999L);
239 R1(D,A,B,C,X( 6), 5,0x5A827999L);
240 R1(C,D,A,B,X(10), 9,0x5A827999L);
241 R1(B,C,D,A,X(14),13,0x5A827999L);
242 R1(A,B,C,D,X( 3), 3,0x5A827999L);
243 R1(D,A,B,C,X( 7), 5,0x5A827999L);
244 R1(C,D,A,B,X(11), 9,0x5A827999L);
245 R1(B,C,D,A,X(15),13,0x5A827999L);
246 /* Round 2 */
247 R2(A,B,C,D,X( 0), 3,0x6ED9EBA1L);
248 R2(D,A,B,C,X( 8), 9,0x6ED9EBA1L);
249 R2(C,D,A,B,X( 4),11,0x6ED9EBA1L);
250 R2(B,C,D,A,X(12),15,0x6ED9EBA1L);
251 R2(A,B,C,D,X( 2), 3,0x6ED9EBA1L);
252 R2(D,A,B,C,X(10), 9,0x6ED9EBA1L);
253 R2(C,D,A,B,X( 6),11,0x6ED9EBA1L);
254 R2(B,C,D,A,X(14),15,0x6ED9EBA1L);
255 R2(A,B,C,D,X( 1), 3,0x6ED9EBA1L);
256 R2(D,A,B,C,X( 9), 9,0x6ED9EBA1L);
257 R2(C,D,A,B,X( 5),11,0x6ED9EBA1L);
258 R2(B,C,D,A,X(13),15,0x6ED9EBA1L);
259 R2(A,B,C,D,X( 3), 3,0x6ED9EBA1L);
260 R2(D,A,B,C,X(11), 9,0x6ED9EBA1L);
261 R2(C,D,A,B,X( 7),11,0x6ED9EBA1L);
262 R2(B,C,D,A,X(15),15,0x6ED9EBA1L);
263
264 A = c->A += A;
265 B = c->B += B;
266 C = c->C += C;
267 D = c->D += D;
268 }
269 }
270#endif
271
272#ifdef undef
273int printit(unsigned long *l)
274 {
275 int i,ii;
276
277 for (i=0; i<2; i++)
278 {
279 for (ii=0; ii<8; ii++)
280 {
281 fprintf(stderr,"%08lx ",l[i*8+ii]);
282 }
283 fprintf(stderr,"\n");
284 }
285 }
286#endif
generated by cgit v1.2.3-55-g6feb (git 2.39.1) at 2025-08-17 10:44:37 +0000