diff options
author | cvs2svn <admin@example.com> | 2001-10-01 21:58:54 +0000 |
---|---|---|
committer | cvs2svn <admin@example.com> | 2001-10-01 21:58:54 +0000 |
commit | 2b482d950b0e856294fcd4c1068c1b21939a7240 (patch) | |
tree | aa05f6be64877f76547f1b54ad84f7bfcb291f5d /src/lib/libcrypto/md4 | |
parent | d7b0aad33e28dafbbef67eb5b84ecb05a844fc88 (diff) | |
download | openbsd-OPENBSD_3_0_BASE.tar.gz openbsd-OPENBSD_3_0_BASE.tar.bz2 openbsd-OPENBSD_3_0_BASE.zip |
This commit was manufactured by cvs2git to create tag 'OPENBSD_3_0_BASE'.OPENBSD_3_0_BASE
Diffstat (limited to 'src/lib/libcrypto/md4')
-rw-r--r-- | src/lib/libcrypto/md4/md4.h | 114 | ||||
-rw-r--r-- | src/lib/libcrypto/md4/md4_dgst.c | 285 | ||||
-rw-r--r-- | src/lib/libcrypto/md4/md4_locl.h | 154 | ||||
-rw-r--r-- | src/lib/libcrypto/md4/md4_one.c | 95 |
4 files changed, 0 insertions, 648 deletions
diff --git a/src/lib/libcrypto/md4/md4.h b/src/lib/libcrypto/md4/md4.h deleted file mode 100644 index c794e186db..0000000000 --- a/src/lib/libcrypto/md4/md4.h +++ /dev/null | |||
@@ -1,114 +0,0 @@ | |||
1 | /* crypto/md4/md4.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 | #ifndef HEADER_MD4_H | ||
60 | #define HEADER_MD4_H | ||
61 | |||
62 | #ifdef __cplusplus | ||
63 | extern "C" { | ||
64 | #endif | ||
65 | |||
66 | #ifdef NO_MD4 | ||
67 | #error MD4 is disabled. | ||
68 | #endif | ||
69 | |||
70 | /* | ||
71 | * !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! | ||
72 | * ! MD4_LONG has to be at least 32 bits wide. If it's wider, then ! | ||
73 | * ! MD4_LONG_LOG2 has to be defined along. ! | ||
74 | * !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! | ||
75 | */ | ||
76 | |||
77 | #if defined(WIN16) || defined(__LP32__) | ||
78 | #define MD4_LONG unsigned long | ||
79 | #elif defined(_CRAY) || defined(__ILP64__) | ||
80 | #define MD4_LONG unsigned long | ||
81 | #define MD4_LONG_LOG2 3 | ||
82 | /* | ||
83 | * _CRAY note. I could declare short, but I have no idea what impact | ||
84 | * does it have on performance on none-T3E machines. I could declare | ||
85 | * int, but at least on C90 sizeof(int) can be chosen at compile time. | ||
86 | * So I've chosen long... | ||
87 | * <appro@fy.chalmers.se> | ||
88 | */ | ||
89 | #else | ||
90 | #define MD4_LONG unsigned int | ||
91 | #endif | ||
92 | |||
93 | #define MD4_CBLOCK 64 | ||
94 | #define MD4_LBLOCK (MD4_CBLOCK/4) | ||
95 | #define MD4_DIGEST_LENGTH 16 | ||
96 | |||
97 | typedef struct MD4state_st | ||
98 | { | ||
99 | MD4_LONG A,B,C,D; | ||
100 | MD4_LONG Nl,Nh; | ||
101 | MD4_LONG data[MD4_LBLOCK]; | ||
102 | int num; | ||
103 | } MD4_CTX; | ||
104 | |||
105 | void MD4_Init(MD4_CTX *c); | ||
106 | void MD4_Update(MD4_CTX *c, const void *data, unsigned long len); | ||
107 | void MD4_Final(unsigned char *md, MD4_CTX *c); | ||
108 | unsigned char *MD4(const unsigned char *d, unsigned long n, unsigned char *md); | ||
109 | void MD4_Transform(MD4_CTX *c, const unsigned char *b); | ||
110 | #ifdef __cplusplus | ||
111 | } | ||
112 | #endif | ||
113 | |||
114 | #endif | ||
diff --git a/src/lib/libcrypto/md4/md4_dgst.c b/src/lib/libcrypto/md4/md4_dgst.c deleted file mode 100644 index 81488ae2e2..0000000000 --- a/src/lib/libcrypto/md4/md4_dgst.c +++ /dev/null | |||
@@ -1,285 +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 | |||
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 | |||
73 | void 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 | } | ||
83 | |||
84 | #ifndef md4_block_host_order | ||
85 | void md4_block_host_order (MD4_CTX *c, const void *data, int num) | ||
86 | { | ||
87 | const MD4_LONG *X=data; | ||
88 | register unsigned long A,B,C,D; | ||
89 | /* | ||
90 | * In case you wonder why A-D are declared as long and not | ||
91 | * as MD4_LONG. Doing so results in slight performance | ||
92 | * boost on LP64 architectures. The catch is we don't | ||
93 | * really care if 32 MSBs of a 64-bit register get polluted | ||
94 | * with eventual overflows as we *save* only 32 LSBs in | ||
95 | * *either* case. Now declaring 'em long excuses the compiler | ||
96 | * from keeping 32 MSBs zeroed resulting in 13% performance | ||
97 | * improvement under SPARC Solaris7/64 and 5% under AlphaLinux. | ||
98 | * Well, to be honest it should say that this *prevents* | ||
99 | * performance degradation. | ||
100 | * | ||
101 | * <appro@fy.chalmers.se> | ||
102 | */ | ||
103 | |||
104 | A=c->A; | ||
105 | B=c->B; | ||
106 | C=c->C; | ||
107 | D=c->D; | ||
108 | |||
109 | for (;num--;X+=HASH_LBLOCK) | ||
110 | { | ||
111 | /* Round 0 */ | ||
112 | R0(A,B,C,D,X[ 0], 3,0); | ||
113 | R0(D,A,B,C,X[ 1], 7,0); | ||
114 | R0(C,D,A,B,X[ 2],11,0); | ||
115 | R0(B,C,D,A,X[ 3],19,0); | ||
116 | R0(A,B,C,D,X[ 4], 3,0); | ||
117 | R0(D,A,B,C,X[ 5], 7,0); | ||
118 | R0(C,D,A,B,X[ 6],11,0); | ||
119 | R0(B,C,D,A,X[ 7],19,0); | ||
120 | R0(A,B,C,D,X[ 8], 3,0); | ||
121 | R0(D,A,B,C,X[ 9], 7,0); | ||
122 | R0(C,D,A,B,X[10],11,0); | ||
123 | R0(B,C,D,A,X[11],19,0); | ||
124 | R0(A,B,C,D,X[12], 3,0); | ||
125 | R0(D,A,B,C,X[13], 7,0); | ||
126 | R0(C,D,A,B,X[14],11,0); | ||
127 | R0(B,C,D,A,X[15],19,0); | ||
128 | /* Round 1 */ | ||
129 | R1(A,B,C,D,X[ 0], 3,0x5A827999L); | ||
130 | R1(D,A,B,C,X[ 4], 5,0x5A827999L); | ||
131 | R1(C,D,A,B,X[ 8], 9,0x5A827999L); | ||
132 | R1(B,C,D,A,X[12],13,0x5A827999L); | ||
133 | R1(A,B,C,D,X[ 1], 3,0x5A827999L); | ||
134 | R1(D,A,B,C,X[ 5], 5,0x5A827999L); | ||
135 | R1(C,D,A,B,X[ 9], 9,0x5A827999L); | ||
136 | R1(B,C,D,A,X[13],13,0x5A827999L); | ||
137 | R1(A,B,C,D,X[ 2], 3,0x5A827999L); | ||
138 | R1(D,A,B,C,X[ 6], 5,0x5A827999L); | ||
139 | R1(C,D,A,B,X[10], 9,0x5A827999L); | ||
140 | R1(B,C,D,A,X[14],13,0x5A827999L); | ||
141 | R1(A,B,C,D,X[ 3], 3,0x5A827999L); | ||
142 | R1(D,A,B,C,X[ 7], 5,0x5A827999L); | ||
143 | R1(C,D,A,B,X[11], 9,0x5A827999L); | ||
144 | R1(B,C,D,A,X[15],13,0x5A827999L); | ||
145 | /* Round 2 */ | ||
146 | R2(A,B,C,D,X[ 0], 3,0x6ED9EBA1); | ||
147 | R2(D,A,B,C,X[ 8], 9,0x6ED9EBA1); | ||
148 | R2(C,D,A,B,X[ 4],11,0x6ED9EBA1); | ||
149 | R2(B,C,D,A,X[12],15,0x6ED9EBA1); | ||
150 | R2(A,B,C,D,X[ 2], 3,0x6ED9EBA1); | ||
151 | R2(D,A,B,C,X[10], 9,0x6ED9EBA1); | ||
152 | R2(C,D,A,B,X[ 6],11,0x6ED9EBA1); | ||
153 | R2(B,C,D,A,X[14],15,0x6ED9EBA1); | ||
154 | R2(A,B,C,D,X[ 1], 3,0x6ED9EBA1); | ||
155 | R2(D,A,B,C,X[ 9], 9,0x6ED9EBA1); | ||
156 | R2(C,D,A,B,X[ 5],11,0x6ED9EBA1); | ||
157 | R2(B,C,D,A,X[13],15,0x6ED9EBA1); | ||
158 | R2(A,B,C,D,X[ 3], 3,0x6ED9EBA1); | ||
159 | R2(D,A,B,C,X[11], 9,0x6ED9EBA1); | ||
160 | R2(C,D,A,B,X[ 7],11,0x6ED9EBA1); | ||
161 | R2(B,C,D,A,X[15],15,0x6ED9EBA1); | ||
162 | |||
163 | A = c->A += A; | ||
164 | B = c->B += B; | ||
165 | C = c->C += C; | ||
166 | D = c->D += D; | ||
167 | } | ||
168 | } | ||
169 | #endif | ||
170 | |||
171 | #ifndef md4_block_data_order | ||
172 | #ifdef X | ||
173 | #undef X | ||
174 | #endif | ||
175 | void md4_block_data_order (MD4_CTX *c, const void *data_, int num) | ||
176 | { | ||
177 | const unsigned char *data=data_; | ||
178 | register unsigned long A,B,C,D,l; | ||
179 | /* | ||
180 | * In case you wonder why A-D are declared as long and not | ||
181 | * as MD4_LONG. Doing so results in slight performance | ||
182 | * boost on LP64 architectures. The catch is we don't | ||
183 | * really care if 32 MSBs of a 64-bit register get polluted | ||
184 | * with eventual overflows as we *save* only 32 LSBs in | ||
185 | * *either* case. Now declaring 'em long excuses the compiler | ||
186 | * from keeping 32 MSBs zeroed resulting in 13% performance | ||
187 | * improvement under SPARC Solaris7/64 and 5% under AlphaLinux. | ||
188 | * Well, to be honest it should say that this *prevents* | ||
189 | * performance degradation. | ||
190 | * | ||
191 | * <appro@fy.chalmers.se> | ||
192 | */ | ||
193 | #ifndef MD32_XARRAY | ||
194 | /* See comment in crypto/sha/sha_locl.h for details. */ | ||
195 | unsigned long XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7, | ||
196 | XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15; | ||
197 | # define X(i) XX##i | ||
198 | #else | ||
199 | MD4_LONG XX[MD4_LBLOCK]; | ||
200 | # define X(i) XX[i] | ||
201 | #endif | ||
202 | |||
203 | A=c->A; | ||
204 | B=c->B; | ||
205 | C=c->C; | ||
206 | D=c->D; | ||
207 | |||
208 | for (;num--;) | ||
209 | { | ||
210 | HOST_c2l(data,l); X( 0)=l; HOST_c2l(data,l); X( 1)=l; | ||
211 | /* Round 0 */ | ||
212 | R0(A,B,C,D,X( 0), 3,0); HOST_c2l(data,l); X( 2)=l; | ||
213 | R0(D,A,B,C,X( 1), 7,0); HOST_c2l(data,l); X( 3)=l; | ||
214 | R0(C,D,A,B,X( 2),11,0); HOST_c2l(data,l); X( 4)=l; | ||
215 | R0(B,C,D,A,X( 3),19,0); HOST_c2l(data,l); X( 5)=l; | ||
216 | R0(A,B,C,D,X( 4), 3,0); HOST_c2l(data,l); X( 6)=l; | ||
217 | R0(D,A,B,C,X( 5), 7,0); HOST_c2l(data,l); X( 7)=l; | ||
218 | R0(C,D,A,B,X( 6),11,0); HOST_c2l(data,l); X( 8)=l; | ||
219 | R0(B,C,D,A,X( 7),19,0); HOST_c2l(data,l); X( 9)=l; | ||
220 | R0(A,B,C,D,X( 8), 3,0); HOST_c2l(data,l); X(10)=l; | ||
221 | R0(D,A,B,C,X( 9), 7,0); HOST_c2l(data,l); X(11)=l; | ||
222 | R0(C,D,A,B,X(10),11,0); HOST_c2l(data,l); X(12)=l; | ||
223 | R0(B,C,D,A,X(11),19,0); HOST_c2l(data,l); X(13)=l; | ||
224 | R0(A,B,C,D,X(12), 3,0); HOST_c2l(data,l); X(14)=l; | ||
225 | R0(D,A,B,C,X(13), 7,0); HOST_c2l(data,l); X(15)=l; | ||
226 | R0(C,D,A,B,X(14),11,0); | ||
227 | R0(B,C,D,A,X(15),19,0); | ||
228 | /* Round 1 */ | ||
229 | R1(A,B,C,D,X( 0), 3,0x5A827999L); | ||
230 | R1(D,A,B,C,X( 4), 5,0x5A827999L); | ||
231 | R1(C,D,A,B,X( 8), 9,0x5A827999L); | ||
232 | R1(B,C,D,A,X(12),13,0x5A827999L); | ||
233 | R1(A,B,C,D,X( 1), 3,0x5A827999L); | ||
234 | R1(D,A,B,C,X( 5), 5,0x5A827999L); | ||
235 | R1(C,D,A,B,X( 9), 9,0x5A827999L); | ||
236 | R1(B,C,D,A,X(13),13,0x5A827999L); | ||
237 | R1(A,B,C,D,X( 2), 3,0x5A827999L); | ||
238 | R1(D,A,B,C,X( 6), 5,0x5A827999L); | ||
239 | R1(C,D,A,B,X(10), 9,0x5A827999L); | ||
240 | R1(B,C,D,A,X(14),13,0x5A827999L); | ||
241 | R1(A,B,C,D,X( 3), 3,0x5A827999L); | ||
242 | R1(D,A,B,C,X( 7), 5,0x5A827999L); | ||
243 | R1(C,D,A,B,X(11), 9,0x5A827999L); | ||
244 | R1(B,C,D,A,X(15),13,0x5A827999L); | ||
245 | /* Round 2 */ | ||
246 | R2(A,B,C,D,X( 0), 3,0x6ED9EBA1L); | ||
247 | R2(D,A,B,C,X( 8), 9,0x6ED9EBA1L); | ||
248 | R2(C,D,A,B,X( 4),11,0x6ED9EBA1L); | ||
249 | R2(B,C,D,A,X(12),15,0x6ED9EBA1L); | ||
250 | R2(A,B,C,D,X( 2), 3,0x6ED9EBA1L); | ||
251 | R2(D,A,B,C,X(10), 9,0x6ED9EBA1L); | ||
252 | R2(C,D,A,B,X( 6),11,0x6ED9EBA1L); | ||
253 | R2(B,C,D,A,X(14),15,0x6ED9EBA1L); | ||
254 | R2(A,B,C,D,X( 1), 3,0x6ED9EBA1L); | ||
255 | R2(D,A,B,C,X( 9), 9,0x6ED9EBA1L); | ||
256 | R2(C,D,A,B,X( 5),11,0x6ED9EBA1L); | ||
257 | R2(B,C,D,A,X(13),15,0x6ED9EBA1L); | ||
258 | R2(A,B,C,D,X( 3), 3,0x6ED9EBA1L); | ||
259 | R2(D,A,B,C,X(11), 9,0x6ED9EBA1L); | ||
260 | R2(C,D,A,B,X( 7),11,0x6ED9EBA1L); | ||
261 | R2(B,C,D,A,X(15),15,0x6ED9EBA1L); | ||
262 | |||
263 | A = c->A += A; | ||
264 | B = c->B += B; | ||
265 | C = c->C += C; | ||
266 | D = c->D += D; | ||
267 | } | ||
268 | } | ||
269 | #endif | ||
270 | |||
271 | #ifdef undef | ||
272 | int printit(unsigned long *l) | ||
273 | { | ||
274 | int i,ii; | ||
275 | |||
276 | for (i=0; i<2; i++) | ||
277 | { | ||
278 | for (ii=0; ii<8; ii++) | ||
279 | { | ||
280 | fprintf(stderr,"%08lx ",l[i*8+ii]); | ||
281 | } | ||
282 | fprintf(stderr,"\n"); | ||
283 | } | ||
284 | } | ||
285 | #endif | ||
diff --git a/src/lib/libcrypto/md4/md4_locl.h b/src/lib/libcrypto/md4/md4_locl.h deleted file mode 100644 index 0a2b39018d..0000000000 --- a/src/lib/libcrypto/md4/md4_locl.h +++ /dev/null | |||
@@ -1,154 +0,0 @@ | |||
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 | |||
68 | void md4_block_host_order (MD4_CTX *c, const void *p,int num); | ||
69 | void md4_block_data_order (MD4_CTX *c, const void *p,int num); | ||
70 | |||
71 | #if 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); }; | ||
diff --git a/src/lib/libcrypto/md4/md4_one.c b/src/lib/libcrypto/md4/md4_one.c deleted file mode 100644 index 87a995d38d..0000000000 --- a/src/lib/libcrypto/md4/md4_one.c +++ /dev/null | |||
@@ -1,95 +0,0 @@ | |||
1 | /* crypto/md4/md4_one.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 <string.h> | ||
61 | #include <openssl/md4.h> | ||
62 | |||
63 | #ifdef CHARSET_EBCDIC | ||
64 | #include <openssl/ebcdic.h> | ||
65 | #endif | ||
66 | |||
67 | unsigned char *MD4(const unsigned char *d, unsigned long n, unsigned char *md) | ||
68 | { | ||
69 | MD4_CTX c; | ||
70 | static unsigned char m[MD4_DIGEST_LENGTH]; | ||
71 | |||
72 | if (md == NULL) md=m; | ||
73 | MD4_Init(&c); | ||
74 | #ifndef CHARSET_EBCDIC | ||
75 | MD4_Update(&c,d,n); | ||
76 | #else | ||
77 | { | ||
78 | char temp[1024]; | ||
79 | unsigned long chunk; | ||
80 | |||
81 | while (n > 0) | ||
82 | { | ||
83 | chunk = (n > sizeof(temp)) ? sizeof(temp) : n; | ||
84 | ebcdic2ascii(temp, d, chunk); | ||
85 | MD4_Update(&c,temp,chunk); | ||
86 | n -= chunk; | ||
87 | d += chunk; | ||
88 | } | ||
89 | } | ||
90 | #endif | ||
91 | MD4_Final(md,&c); | ||
92 | memset(&c,0,sizeof(c)); /* security consideration */ | ||
93 | return(md); | ||
94 | } | ||
95 | |||