diff options
Diffstat (limited to '')
-rw-r--r-- | src/lib/libcrypto/des/des_local.h | 226 |
1 files changed, 0 insertions, 226 deletions
diff --git a/src/lib/libcrypto/des/des_local.h b/src/lib/libcrypto/des/des_local.h deleted file mode 100644 index 61bfde7520..0000000000 --- a/src/lib/libcrypto/des/des_local.h +++ /dev/null | |||
@@ -1,226 +0,0 @@ | |||
1 | /* $OpenBSD: des_local.h,v 1.5 2024/08/31 16:22:18 jsing Exp $ */ | ||
2 | /* Copyright (C) 1995-1997 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_DES_LOCL_H | ||
60 | #define HEADER_DES_LOCL_H | ||
61 | |||
62 | #include <math.h> | ||
63 | #include <stdint.h> | ||
64 | #include <stdio.h> | ||
65 | #include <stdlib.h> | ||
66 | #include <string.h> | ||
67 | #include <unistd.h> | ||
68 | |||
69 | #include <openssl/opensslconf.h> | ||
70 | |||
71 | #include <openssl/des.h> | ||
72 | |||
73 | __BEGIN_HIDDEN_DECLS | ||
74 | |||
75 | #define ITERATIONS 16 | ||
76 | |||
77 | #define c2l(c,l) (l =((DES_LONG)(*((c)++))) , \ | ||
78 | l|=((DES_LONG)(*((c)++)))<< 8L, \ | ||
79 | l|=((DES_LONG)(*((c)++)))<<16L, \ | ||
80 | l|=((DES_LONG)(*((c)++)))<<24L) | ||
81 | |||
82 | /* NOTE - c is not incremented as per c2l */ | ||
83 | #define c2ln(c,l1,l2,n) { \ | ||
84 | c+=n; \ | ||
85 | l1=l2=0; \ | ||
86 | switch (n) { \ | ||
87 | case 8: l2 =((DES_LONG)(*(--(c))))<<24L; \ | ||
88 | case 7: l2|=((DES_LONG)(*(--(c))))<<16L; \ | ||
89 | case 6: l2|=((DES_LONG)(*(--(c))))<< 8L; \ | ||
90 | case 5: l2|=((DES_LONG)(*(--(c)))); \ | ||
91 | case 4: l1 =((DES_LONG)(*(--(c))))<<24L; \ | ||
92 | case 3: l1|=((DES_LONG)(*(--(c))))<<16L; \ | ||
93 | case 2: l1|=((DES_LONG)(*(--(c))))<< 8L; \ | ||
94 | case 1: l1|=((DES_LONG)(*(--(c)))); \ | ||
95 | } \ | ||
96 | } | ||
97 | |||
98 | #define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \ | ||
99 | *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ | ||
100 | *((c)++)=(unsigned char)(((l)>>16L)&0xff), \ | ||
101 | *((c)++)=(unsigned char)(((l)>>24L)&0xff)) | ||
102 | |||
103 | /* NOTE - c is not incremented as per l2c */ | ||
104 | #define l2cn(l1,l2,c,n) { \ | ||
105 | c+=n; \ | ||
106 | switch (n) { \ | ||
107 | case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff);\ | ||
108 | case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff);\ | ||
109 | case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff);\ | ||
110 | case 5: *(--(c))=(unsigned char)(((l2) )&0xff);\ | ||
111 | case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff);\ | ||
112 | case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff);\ | ||
113 | case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff);\ | ||
114 | case 1: *(--(c))=(unsigned char)(((l1) )&0xff);\ | ||
115 | } \ | ||
116 | } | ||
117 | |||
118 | static inline uint32_t | ||
119 | ROTATE(uint32_t a, uint32_t n) | ||
120 | { | ||
121 | return (a >> n) + (a << (32 - n)); | ||
122 | } | ||
123 | |||
124 | /* Don't worry about the LOAD_DATA() stuff, that is used by | ||
125 | * fcrypt() to add it's little bit to the front */ | ||
126 | |||
127 | #ifdef DES_FCRYPT | ||
128 | |||
129 | #define LOAD_DATA_tmp(R,S,u,t,E0,E1) \ | ||
130 | { DES_LONG tmp; LOAD_DATA(R,S,u,t,E0,E1,tmp); } | ||
131 | |||
132 | #define LOAD_DATA(R,S,u,t,E0,E1,tmp) \ | ||
133 | t=R^(R>>16L); \ | ||
134 | u=t&E0; t&=E1; \ | ||
135 | tmp=(u<<16); u^=R^s[S ]; u^=tmp; \ | ||
136 | tmp=(t<<16); t^=R^s[S+1]; t^=tmp | ||
137 | #else | ||
138 | #define LOAD_DATA_tmp(a,b,c,d,e,f) LOAD_DATA(a,b,c,d,e,f,g) | ||
139 | #define LOAD_DATA(R,S,u,t,E0,E1,tmp) \ | ||
140 | u=R^s[S ]; \ | ||
141 | t=R^s[S+1] | ||
142 | #endif | ||
143 | |||
144 | #define D_ENCRYPT(LL,R,S) { \ | ||
145 | LOAD_DATA_tmp(R,S,u,t,E0,E1); \ | ||
146 | t=ROTATE(t,4); \ | ||
147 | LL^= \ | ||
148 | DES_SPtrans[0][(u>> 2L)&0x3f]^ \ | ||
149 | DES_SPtrans[2][(u>>10L)&0x3f]^ \ | ||
150 | DES_SPtrans[4][(u>>18L)&0x3f]^ \ | ||
151 | DES_SPtrans[6][(u>>26L)&0x3f]^ \ | ||
152 | DES_SPtrans[1][(t>> 2L)&0x3f]^ \ | ||
153 | DES_SPtrans[3][(t>>10L)&0x3f]^ \ | ||
154 | DES_SPtrans[5][(t>>18L)&0x3f]^ \ | ||
155 | DES_SPtrans[7][(t>>26L)&0x3f]; } | ||
156 | |||
157 | /* IP and FP | ||
158 | * The problem is more of a geometric problem that random bit fiddling. | ||
159 | 0 1 2 3 4 5 6 7 62 54 46 38 30 22 14 6 | ||
160 | 8 9 10 11 12 13 14 15 60 52 44 36 28 20 12 4 | ||
161 | 16 17 18 19 20 21 22 23 58 50 42 34 26 18 10 2 | ||
162 | 24 25 26 27 28 29 30 31 to 56 48 40 32 24 16 8 0 | ||
163 | |||
164 | 32 33 34 35 36 37 38 39 63 55 47 39 31 23 15 7 | ||
165 | 40 41 42 43 44 45 46 47 61 53 45 37 29 21 13 5 | ||
166 | 48 49 50 51 52 53 54 55 59 51 43 35 27 19 11 3 | ||
167 | 56 57 58 59 60 61 62 63 57 49 41 33 25 17 9 1 | ||
168 | |||
169 | The output has been subject to swaps of the form | ||
170 | 0 1 -> 3 1 but the odd and even bits have been put into | ||
171 | 2 3 2 0 | ||
172 | different words. The main trick is to remember that | ||
173 | t=((l>>size)^r)&(mask); | ||
174 | r^=t; | ||
175 | l^=(t<<size); | ||
176 | can be used to swap and move bits between words. | ||
177 | |||
178 | So l = 0 1 2 3 r = 16 17 18 19 | ||
179 | 4 5 6 7 20 21 22 23 | ||
180 | 8 9 10 11 24 25 26 27 | ||
181 | 12 13 14 15 28 29 30 31 | ||
182 | becomes (for size == 2 and mask == 0x3333) | ||
183 | t = 2^16 3^17 -- -- l = 0 1 16 17 r = 2 3 18 19 | ||
184 | 6^20 7^21 -- -- 4 5 20 21 6 7 22 23 | ||
185 | 10^24 11^25 -- -- 8 9 24 25 10 11 24 25 | ||
186 | 14^28 15^29 -- -- 12 13 28 29 14 15 28 29 | ||
187 | |||
188 | Thanks for hints from Richard Outerbridge - he told me IP&FP | ||
189 | could be done in 15 xor, 10 shifts and 5 ands. | ||
190 | When I finally started to think of the problem in 2D | ||
191 | I first got ~42 operations without xors. When I remembered | ||
192 | how to use xors :-) I got it to its final state. | ||
193 | */ | ||
194 | #define PERM_OP(a,b,t,n,m) ((t)=((((a)>>(n))^(b))&(m)), \ | ||
195 | (b)^=(t), \ | ||
196 | (a)^=((t)<<(n))) | ||
197 | |||
198 | #define IP(l,r) \ | ||
199 | { \ | ||
200 | DES_LONG tt; \ | ||
201 | PERM_OP(r,l,tt, 4,0x0f0f0f0fL); \ | ||
202 | PERM_OP(l,r,tt,16,0x0000ffffL); \ | ||
203 | PERM_OP(r,l,tt, 2,0x33333333L); \ | ||
204 | PERM_OP(l,r,tt, 8,0x00ff00ffL); \ | ||
205 | PERM_OP(r,l,tt, 1,0x55555555L); \ | ||
206 | } | ||
207 | |||
208 | #define FP(l,r) \ | ||
209 | { \ | ||
210 | DES_LONG tt; \ | ||
211 | PERM_OP(l,r,tt, 1,0x55555555L); \ | ||
212 | PERM_OP(r,l,tt, 8,0x00ff00ffL); \ | ||
213 | PERM_OP(l,r,tt, 2,0x33333333L); \ | ||
214 | PERM_OP(r,l,tt,16,0x0000ffffL); \ | ||
215 | PERM_OP(l,r,tt, 4,0x0f0f0f0fL); \ | ||
216 | } | ||
217 | |||
218 | extern const DES_LONG DES_SPtrans[8][64]; | ||
219 | |||
220 | #ifdef OPENSSL_SMALL_FOOTPRINT | ||
221 | #undef DES_UNROLL | ||
222 | #endif | ||
223 | |||
224 | __END_HIDDEN_DECLS | ||
225 | |||
226 | #endif | ||