summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/rc4/rc4_enc.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/lib/libcrypto/rc4/rc4_enc.c')
-rw-r--r--src/lib/libcrypto/rc4/rc4_enc.c301
1 files changed, 0 insertions, 301 deletions
diff --git a/src/lib/libcrypto/rc4/rc4_enc.c b/src/lib/libcrypto/rc4/rc4_enc.c
deleted file mode 100644
index e68edddfea..0000000000
--- a/src/lib/libcrypto/rc4/rc4_enc.c
+++ /dev/null
@@ -1,301 +0,0 @@
1/* $OpenBSD: rc4_enc.c,v 1.13 2014/10/28 07:35:59 jsg Exp $ */
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 <machine/endian.h>
60#include <openssl/rc4.h>
61#include "rc4_locl.h"
62
63/* RC4 as implemented from a posting from
64 * Newsgroups: sci.crypt
65 * From: sterndark@netcom.com (David Sterndark)
66 * Subject: RC4 Algorithm revealed.
67 * Message-ID: <sternCvKL4B.Hyy@netcom.com>
68 * Date: Wed, 14 Sep 1994 06:35:31 GMT
69 */
70
71void RC4(RC4_KEY *key, size_t len, const unsigned char *indata,
72 unsigned char *outdata)
73 {
74 RC4_INT *d;
75 RC4_INT x,y,tx,ty;
76 size_t i;
77
78 x=key->x;
79 y=key->y;
80 d=key->data;
81
82#if defined(RC4_CHUNK)
83 /*
84 * The original reason for implementing this(*) was the fact that
85 * pre-21164a Alpha CPUs don't have byte load/store instructions
86 * and e.g. a byte store has to be done with 64-bit load, shift,
87 * and, or and finally 64-bit store. Peaking data and operating
88 * at natural word size made it possible to reduce amount of
89 * instructions as well as to perform early read-ahead without
90 * suffering from RAW (read-after-write) hazard. This resulted
91 * in ~40%(**) performance improvement on 21064 box with gcc.
92 * But it's not only Alpha users who win here:-) Thanks to the
93 * early-n-wide read-ahead this implementation also exhibits
94 * >40% speed-up on SPARC and 20-30% on 64-bit MIPS (depending
95 * on sizeof(RC4_INT)).
96 *
97 * (*) "this" means code which recognizes the case when input
98 * and output pointers appear to be aligned at natural CPU
99 * word boundary
100 * (**) i.e. according to 'apps/openssl speed rc4' benchmark,
101 * crypto/rc4/rc4speed.c exhibits almost 70% speed-up...
102 *
103 * Caveats.
104 *
105 * - RC4_CHUNK="unsigned long long" should be a #1 choice for
106 * UltraSPARC. Unfortunately gcc generates very slow code
107 * (2.5-3 times slower than one generated by Sun's WorkShop
108 * C) and therefore gcc (at least 2.95 and earlier) should
109 * always be told that RC4_CHUNK="unsigned long".
110 *
111 * <appro@fy.chalmers.se>
112 */
113
114# define RC4_STEP ( \
115 x=(x+1) &0xff, \
116 tx=d[x], \
117 y=(tx+y)&0xff, \
118 ty=d[y], \
119 d[y]=tx, \
120 d[x]=ty, \
121 (RC4_CHUNK)d[(tx+ty)&0xff]\
122 )
123
124 if ( ( ((size_t)indata & (sizeof(RC4_CHUNK)-1)) |
125 ((size_t)outdata & (sizeof(RC4_CHUNK)-1)) ) == 0 )
126 {
127 RC4_CHUNK ichunk,otp;
128
129 /*
130 * I reckon we can afford to implement both endian
131 * cases and to decide which way to take at run-time
132 * because the machine code appears to be very compact
133 * and redundant 1-2KB is perfectly tolerable (i.e.
134 * in case the compiler fails to eliminate it:-). By
135 * suggestion from Terrel Larson <terr@terralogic.net>.
136 *
137 * Special notes.
138 *
139 * - compilers (those I've tried) don't seem to have
140 * problems eliminating either the operators guarded
141 * by "if (sizeof(RC4_CHUNK)==8)" or the condition
142 * expressions themselves so I've got 'em to replace
143 * corresponding #ifdefs from the previous version;
144 * - I chose to let the redundant switch cases when
145 * sizeof(RC4_CHUNK)!=8 be (were also #ifdefed
146 * before);
147 * - in case you wonder "&(sizeof(RC4_CHUNK)*8-1)" in
148 * [LB]ESHFT guards against "shift is out of range"
149 * warnings when sizeof(RC4_CHUNK)!=8
150 *
151 * <appro@fy.chalmers.se>
152 */
153 if (BYTE_ORDER != LITTLE_ENDIAN)
154 { /* BIG-ENDIAN CASE */
155# define BESHFT(c) (((sizeof(RC4_CHUNK)-(c)-1)*8)&(sizeof(RC4_CHUNK)*8-1))
156 for (;len&(0-sizeof(RC4_CHUNK));len-=sizeof(RC4_CHUNK))
157 {
158 ichunk = *(RC4_CHUNK *)indata;
159 otp = RC4_STEP<<BESHFT(0);
160 otp |= RC4_STEP<<BESHFT(1);
161 otp |= RC4_STEP<<BESHFT(2);
162 otp |= RC4_STEP<<BESHFT(3);
163 if (sizeof(RC4_CHUNK)==8)
164 {
165 otp |= RC4_STEP<<BESHFT(4);
166 otp |= RC4_STEP<<BESHFT(5);
167 otp |= RC4_STEP<<BESHFT(6);
168 otp |= RC4_STEP<<BESHFT(7);
169 }
170 *(RC4_CHUNK *)outdata = otp^ichunk;
171 indata += sizeof(RC4_CHUNK);
172 outdata += sizeof(RC4_CHUNK);
173 }
174 if (len)
175 {
176 RC4_CHUNK mask=(RC4_CHUNK)-1, ochunk;
177
178 ichunk = *(RC4_CHUNK *)indata;
179 ochunk = *(RC4_CHUNK *)outdata;
180 otp = 0;
181 i = BESHFT(0);
182 mask <<= (sizeof(RC4_CHUNK)-len)<<3;
183 switch (len&(sizeof(RC4_CHUNK)-1))
184 {
185 case 7: otp = RC4_STEP<<i, i-=8;
186 case 6: otp |= RC4_STEP<<i, i-=8;
187 case 5: otp |= RC4_STEP<<i, i-=8;
188 case 4: otp |= RC4_STEP<<i, i-=8;
189 case 3: otp |= RC4_STEP<<i, i-=8;
190 case 2: otp |= RC4_STEP<<i, i-=8;
191 case 1: otp |= RC4_STEP<<i, i-=8;
192 }
193 ochunk &= ~mask;
194 ochunk |= (otp^ichunk) & mask;
195 *(RC4_CHUNK *)outdata = ochunk;
196 }
197 key->x=x;
198 key->y=y;
199 return;
200 }
201 else
202 { /* LITTLE-ENDIAN CASE */
203# define LESHFT(c) (((c)*8)&(sizeof(RC4_CHUNK)*8-1))
204 for (;len&(0-sizeof(RC4_CHUNK));len-=sizeof(RC4_CHUNK))
205 {
206 ichunk = *(RC4_CHUNK *)indata;
207 otp = RC4_STEP;
208 otp |= RC4_STEP<<8;
209 otp |= RC4_STEP<<16;
210 otp |= RC4_STEP<<24;
211 if (sizeof(RC4_CHUNK)==8)
212 {
213 otp |= RC4_STEP<<LESHFT(4);
214 otp |= RC4_STEP<<LESHFT(5);
215 otp |= RC4_STEP<<LESHFT(6);
216 otp |= RC4_STEP<<LESHFT(7);
217 }
218 *(RC4_CHUNK *)outdata = otp^ichunk;
219 indata += sizeof(RC4_CHUNK);
220 outdata += sizeof(RC4_CHUNK);
221 }
222 if (len)
223 {
224 RC4_CHUNK mask=(RC4_CHUNK)-1, ochunk;
225
226 ichunk = *(RC4_CHUNK *)indata;
227 ochunk = *(RC4_CHUNK *)outdata;
228 otp = 0;
229 i = 0;
230 mask >>= (sizeof(RC4_CHUNK)-len)<<3;
231 switch (len&(sizeof(RC4_CHUNK)-1))
232 {
233 case 7: otp = RC4_STEP, i+=8;
234 case 6: otp |= RC4_STEP<<i, i+=8;
235 case 5: otp |= RC4_STEP<<i, i+=8;
236 case 4: otp |= RC4_STEP<<i, i+=8;
237 case 3: otp |= RC4_STEP<<i, i+=8;
238 case 2: otp |= RC4_STEP<<i, i+=8;
239 case 1: otp |= RC4_STEP<<i, i+=8;
240 }
241 ochunk &= ~mask;
242 ochunk |= (otp^ichunk) & mask;
243 *(RC4_CHUNK *)outdata = ochunk;
244 }
245 key->x=x;
246 key->y=y;
247 return;
248 }
249 }
250#endif
251#define LOOP(in,out) \
252 x=((x+1)&0xff); \
253 tx=d[x]; \
254 y=(tx+y)&0xff; \
255 d[x]=ty=d[y]; \
256 d[y]=tx; \
257 (out) = d[(tx+ty)&0xff]^ (in);
258
259#ifndef RC4_INDEX
260#define RC4_LOOP(a,b,i) LOOP(*((a)++),*((b)++))
261#else
262#define RC4_LOOP(a,b,i) LOOP(a[i],b[i])
263#endif
264
265 i=len>>3;
266 if (i)
267 {
268 for (;;)
269 {
270 RC4_LOOP(indata,outdata,0);
271 RC4_LOOP(indata,outdata,1);
272 RC4_LOOP(indata,outdata,2);
273 RC4_LOOP(indata,outdata,3);
274 RC4_LOOP(indata,outdata,4);
275 RC4_LOOP(indata,outdata,5);
276 RC4_LOOP(indata,outdata,6);
277 RC4_LOOP(indata,outdata,7);
278#ifdef RC4_INDEX
279 indata+=8;
280 outdata+=8;
281#endif
282 if (--i == 0) break;
283 }
284 }
285 i=len&0x07;
286 if (i)
287 {
288 for (;;)
289 {
290 RC4_LOOP(indata,outdata,0); if (--i == 0) break;
291 RC4_LOOP(indata,outdata,1); if (--i == 0) break;
292 RC4_LOOP(indata,outdata,2); if (--i == 0) break;
293 RC4_LOOP(indata,outdata,3); if (--i == 0) break;
294 RC4_LOOP(indata,outdata,4); if (--i == 0) break;
295 RC4_LOOP(indata,outdata,5); if (--i == 0) break;
296 RC4_LOOP(indata,outdata,6); if (--i == 0) break;
297 }
298 }
299 key->x=x;
300 key->y=y;
301 }
generated by cgit v1.2.3-55-g6feb (git 2.39.1) at 2025-08-09 13:42:13 +0000