summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/rc2/rc2.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/lib/libcrypto/rc2/rc2.c')
-rw-r--r--src/lib/libcrypto/rc2/rc2.c461
1 files changed, 461 insertions, 0 deletions
diff --git a/src/lib/libcrypto/rc2/rc2.c b/src/lib/libcrypto/rc2/rc2.c
new file mode 100644
index 0000000000..c122d4b810
--- /dev/null
+++ b/src/lib/libcrypto/rc2/rc2.c
@@ -0,0 +1,461 @@
1/* $OpenBSD: rc2.c,v 1.1 2025/05/25 05:29:54 jsing 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 <openssl/rc2.h>
60
61#include "rc2_local.h"
62
63static const unsigned char key_table[256]={
64 0xd9,0x78,0xf9,0xc4,0x19,0xdd,0xb5,0xed,0x28,0xe9,0xfd,0x79,
65 0x4a,0xa0,0xd8,0x9d,0xc6,0x7e,0x37,0x83,0x2b,0x76,0x53,0x8e,
66 0x62,0x4c,0x64,0x88,0x44,0x8b,0xfb,0xa2,0x17,0x9a,0x59,0xf5,
67 0x87,0xb3,0x4f,0x13,0x61,0x45,0x6d,0x8d,0x09,0x81,0x7d,0x32,
68 0xbd,0x8f,0x40,0xeb,0x86,0xb7,0x7b,0x0b,0xf0,0x95,0x21,0x22,
69 0x5c,0x6b,0x4e,0x82,0x54,0xd6,0x65,0x93,0xce,0x60,0xb2,0x1c,
70 0x73,0x56,0xc0,0x14,0xa7,0x8c,0xf1,0xdc,0x12,0x75,0xca,0x1f,
71 0x3b,0xbe,0xe4,0xd1,0x42,0x3d,0xd4,0x30,0xa3,0x3c,0xb6,0x26,
72 0x6f,0xbf,0x0e,0xda,0x46,0x69,0x07,0x57,0x27,0xf2,0x1d,0x9b,
73 0xbc,0x94,0x43,0x03,0xf8,0x11,0xc7,0xf6,0x90,0xef,0x3e,0xe7,
74 0x06,0xc3,0xd5,0x2f,0xc8,0x66,0x1e,0xd7,0x08,0xe8,0xea,0xde,
75 0x80,0x52,0xee,0xf7,0x84,0xaa,0x72,0xac,0x35,0x4d,0x6a,0x2a,
76 0x96,0x1a,0xd2,0x71,0x5a,0x15,0x49,0x74,0x4b,0x9f,0xd0,0x5e,
77 0x04,0x18,0xa4,0xec,0xc2,0xe0,0x41,0x6e,0x0f,0x51,0xcb,0xcc,
78 0x24,0x91,0xaf,0x50,0xa1,0xf4,0x70,0x39,0x99,0x7c,0x3a,0x85,
79 0x23,0xb8,0xb4,0x7a,0xfc,0x02,0x36,0x5b,0x25,0x55,0x97,0x31,
80 0x2d,0x5d,0xfa,0x98,0xe3,0x8a,0x92,0xae,0x05,0xdf,0x29,0x10,
81 0x67,0x6c,0xba,0xc9,0xd3,0x00,0xe6,0xcf,0xe1,0x9e,0xa8,0x2c,
82 0x63,0x16,0x01,0x3f,0x58,0xe2,0x89,0xa9,0x0d,0x38,0x34,0x1b,
83 0xab,0x33,0xff,0xb0,0xbb,0x48,0x0c,0x5f,0xb9,0xb1,0xcd,0x2e,
84 0xc5,0xf3,0xdb,0x47,0xe5,0xa5,0x9c,0x77,0x0a,0xa6,0x20,0x68,
85 0xfe,0x7f,0xc1,0xad,
86 };
87
88/* It has come to my attention that there are 2 versions of the RC2
89 * key schedule. One which is normal, and anther which has a hook to
90 * use a reduced key length.
91 * BSAFE uses the 'retarded' version. What I previously shipped is
92 * the same as specifying 1024 for the 'bits' parameter. Bsafe uses
93 * a version where the bits parameter is the same as len*8 */
94void
95RC2_set_key(RC2_KEY *key, int len, const unsigned char *data, int bits)
96{
97 int i, j;
98 unsigned char *k;
99 RC2_INT *ki;
100 unsigned int c, d;
101
102 k = (unsigned char *)&(key->data[0]);
103 *k = 0; /* for if there is a zero length key */
104
105 if (len > 128)
106 len = 128;
107 if (bits <= 0)
108 bits = 1024;
109 if (bits > 1024)
110 bits = 1024;
111
112 for (i = 0; i < len; i++)
113 k[i] = data[i];
114
115 /* expand table */
116 d = k[len - 1];
117 j = 0;
118 for (i = len; i < 128; i++, j++)
119 {
120 d = key_table[(k[j] + d) & 0xff];
121 k[i] = d;
122 }
123
124 /* hmm.... key reduction to 'bits' bits */
125
126 j = (bits + 7) >> 3;
127 i = 128 - j;
128 c = (0xff >> (-bits & 0x07));
129
130 d = key_table[k[i] & c];
131 k[i] = d;
132 while (i--) {
133 d = key_table[k[i + j] ^ d];
134 k[i] = d;
135 }
136
137 /* copy from bytes into RC2_INT's */
138 ki = &(key->data[63]);
139 for (i = 127; i >= 0; i -= 2)
140 *(ki--) = ((k[i] << 8)|k[i - 1]) & 0xffff;
141}
142LCRYPTO_ALIAS(RC2_set_key);
143
144void
145RC2_encrypt(unsigned long *d, RC2_KEY *key)
146{
147 int i, n;
148 RC2_INT *p0, *p1;
149 RC2_INT x0, x1, x2, x3, t;
150 unsigned long l;
151
152 l = d[0];
153 x0 = (RC2_INT)l & 0xffff;
154 x1 = (RC2_INT)(l >> 16L);
155 l = d[1];
156 x2 = (RC2_INT)l & 0xffff;
157 x3 = (RC2_INT)(l >> 16L);
158
159 n = 3;
160 i = 5;
161
162 p0 = p1 = &(key->data[0]);
163 for (;;) {
164 t = (x0 + (x1 & ~x3) + (x2 & x3) + *(p0++)) & 0xffff;
165 x0 = (t << 1)|(t >> 15);
166 t = (x1 + (x2 & ~x0) + (x3 & x0) + *(p0++)) & 0xffff;
167 x1 = (t << 2)|(t >> 14);
168 t = (x2 + (x3 & ~x1) + (x0 & x1) + *(p0++)) & 0xffff;
169 x2 = (t << 3)|(t >> 13);
170 t = (x3 + (x0 & ~x2) + (x1 & x2) + *(p0++)) & 0xffff;
171 x3 = (t << 5)|(t >> 11);
172
173 if (--i == 0) {
174 if (--n == 0)
175 break;
176 i = (n == 2) ? 6 : 5;
177
178 x0 += p1[x3 & 0x3f];
179 x1 += p1[x0 & 0x3f];
180 x2 += p1[x1 & 0x3f];
181 x3 += p1[x2 & 0x3f];
182 }
183 }
184
185 d[0] = (unsigned long)(x0 & 0xffff)|((unsigned long)(x1 & 0xffff) <<
186 16L);
187 d[1] = (unsigned long)(x2 & 0xffff)|((unsigned long)(x3 & 0xffff) <<
188 16L);
189}
190LCRYPTO_ALIAS(RC2_encrypt);
191
192void
193RC2_decrypt(unsigned long *d, RC2_KEY *key)
194{
195 int i, n;
196 RC2_INT *p0, *p1;
197 RC2_INT x0, x1, x2, x3, t;
198 unsigned long l;
199
200 l = d[0];
201 x0 = (RC2_INT)l & 0xffff;
202 x1 = (RC2_INT)(l >> 16L);
203 l = d[1];
204 x2 = (RC2_INT)l & 0xffff;
205 x3 = (RC2_INT)(l >> 16L);
206
207 n = 3;
208 i = 5;
209
210 p0 = &(key->data[63]);
211 p1 = &(key->data[0]);
212 for (;;) {
213 t = ((x3 << 11)|(x3 >> 5)) & 0xffff;
214 x3 = (t - (x0 & ~x2) - (x1 & x2) - *(p0--)) & 0xffff;
215 t = ((x2 << 13)|(x2 >> 3)) & 0xffff;
216 x2 = (t - (x3 & ~x1) - (x0 & x1) - *(p0--)) & 0xffff;
217 t = ((x1 << 14)|(x1 >> 2)) & 0xffff;
218 x1 = (t - (x2 & ~x0) - (x3 & x0) - *(p0--)) & 0xffff;
219 t = ((x0 << 15)|(x0 >> 1)) & 0xffff;
220 x0 = (t - (x1 & ~x3) - (x2 & x3) - *(p0--)) & 0xffff;
221
222 if (--i == 0) {
223 if (--n == 0)
224 break;
225 i = (n == 2) ? 6 : 5;
226
227 x3 = (x3 - p1[x2 & 0x3f]) & 0xffff;
228 x2 = (x2 - p1[x1 & 0x3f]) & 0xffff;
229 x1 = (x1 - p1[x0 & 0x3f]) & 0xffff;
230 x0 = (x0 - p1[x3 & 0x3f]) & 0xffff;
231 }
232 }
233
234 d[0] = (unsigned long)(x0 & 0xffff)|((unsigned long)(x1 & 0xffff) <<
235 16L);
236 d[1] = (unsigned long)(x2 & 0xffff)|((unsigned long)(x3 & 0xffff) <<
237 16L);
238}
239LCRYPTO_ALIAS(RC2_decrypt);
240
241void
242RC2_cbc_encrypt(const unsigned char *in, unsigned char *out, long length,
243 RC2_KEY *ks, unsigned char *iv, int encrypt)
244{
245 unsigned long tin0, tin1;
246 unsigned long tout0, tout1, xor0, xor1;
247 long l = length;
248 unsigned long tin[2];
249
250 if (encrypt) {
251 c2l(iv, tout0);
252 c2l(iv, tout1);
253 iv -= 8;
254 for (l -= 8; l >= 0; l -= 8)
255 {
256 c2l(in, tin0);
257 c2l(in, tin1);
258 tin0 ^= tout0;
259 tin1 ^= tout1;
260 tin[0] = tin0;
261 tin[1] = tin1;
262 RC2_encrypt(tin, ks);
263 tout0 = tin[0];
264 l2c(tout0, out);
265 tout1 = tin[1];
266 l2c(tout1, out);
267 }
268 if (l != -8) {
269 c2ln(in, tin0, tin1, l + 8);
270 tin0 ^= tout0;
271 tin1 ^= tout1;
272 tin[0] = tin0;
273 tin[1] = tin1;
274 RC2_encrypt(tin, ks);
275 tout0 = tin[0];
276 l2c(tout0, out);
277 tout1 = tin[1];
278 l2c(tout1, out);
279 }
280 l2c(tout0, iv);
281 l2c(tout1, iv);
282 } else {
283 c2l(iv, xor0);
284 c2l(iv, xor1);
285 iv -= 8;
286 for (l -= 8; l >= 0; l -= 8)
287 {
288 c2l(in, tin0);
289 tin[0] = tin0;
290 c2l(in, tin1);
291 tin[1] = tin1;
292 RC2_decrypt(tin, ks);
293 tout0 = tin[0] ^ xor0;
294 tout1 = tin[1] ^ xor1;
295 l2c(tout0, out);
296 l2c(tout1, out);
297 xor0 = tin0;
298 xor1 = tin1;
299 }
300 if (l != -8) {
301 c2l(in, tin0);
302 tin[0] = tin0;
303 c2l(in, tin1);
304 tin[1] = tin1;
305 RC2_decrypt(tin, ks);
306 tout0 = tin[0] ^ xor0;
307 tout1 = tin[1] ^ xor1;
308 l2cn(tout0, tout1, out, l + 8);
309 xor0 = tin0;
310 xor1 = tin1;
311 }
312 l2c(xor0, iv);
313 l2c(xor1, iv);
314 }
315 tin0 = tin1 = tout0 = tout1 = xor0 = xor1 = 0;
316 tin[0] = tin[1] = 0;
317}
318LCRYPTO_ALIAS(RC2_cbc_encrypt);
319
320/* The input and output encrypted as though 64bit cfb mode is being
321 * used. The extra state information to record how much of the
322 * 64bit block we have used is contained in *num;
323 */
324void
325RC2_cfb64_encrypt(const unsigned char *in, unsigned char *out,
326 long length, RC2_KEY *schedule, unsigned char *ivec,
327 int *num, int encrypt)
328{
329 unsigned long v0, v1, t;
330 int n = *num;
331 long l = length;
332 unsigned long ti[2];
333 unsigned char *iv, c, cc;
334
335 iv = (unsigned char *)ivec;
336 if (encrypt) {
337 while (l--) {
338 if (n == 0) {
339 c2l(iv, v0);
340 ti[0] = v0;
341 c2l(iv, v1);
342 ti[1] = v1;
343 RC2_encrypt((unsigned long *)ti, schedule);
344 iv = (unsigned char *)ivec;
345 t = ti[0];
346 l2c(t, iv);
347 t = ti[1];
348 l2c(t, iv);
349 iv = (unsigned char *)ivec;
350 }
351 c = *(in++) ^ iv[n];
352 *(out++) = c;
353 iv[n] = c;
354 n = (n + 1) & 0x07;
355 }
356 } else {
357 while (l--) {
358 if (n == 0) {
359 c2l(iv, v0);
360 ti[0] = v0;
361 c2l(iv, v1);
362 ti[1] = v1;
363 RC2_encrypt((unsigned long *)ti, schedule);
364 iv = (unsigned char *)ivec;
365 t = ti[0];
366 l2c(t, iv);
367 t = ti[1];
368 l2c(t, iv);
369 iv = (unsigned char *)ivec;
370 }
371 cc = *(in++);
372 c = iv[n];
373 iv[n] = cc;
374 *(out++) = c ^ cc;
375 n = (n + 1) & 0x07;
376 }
377 }
378 v0 = v1 = ti[0] = ti[1] = t = c = cc = 0;
379 *num = n;
380}
381LCRYPTO_ALIAS(RC2_cfb64_encrypt);
382
383/* RC2 as implemented frm a posting from
384 * Newsgroups: sci.crypt
385 * Sender: pgut01@cs.auckland.ac.nz (Peter Gutmann)
386 * Subject: Specification for Ron Rivests Cipher No.2
387 * Message-ID: <4fk39f$f70@net.auckland.ac.nz>
388 * Date: 11 Feb 1996 06:45:03 GMT
389 */
390void
391RC2_ecb_encrypt(const unsigned char *in, unsigned char *out, RC2_KEY *ks,
392 int encrypt)
393{
394 unsigned long l, d[2];
395
396 c2l(in, l);
397 d[0] = l;
398 c2l(in, l);
399 d[1] = l;
400 if (encrypt)
401 RC2_encrypt(d, ks);
402 else
403 RC2_decrypt(d, ks);
404 l = d[0];
405 l2c(l, out);
406 l = d[1];
407 l2c(l, out);
408 l = d[0] = d[1] = 0;
409}
410LCRYPTO_ALIAS(RC2_ecb_encrypt);
411
412/* The input and output encrypted as though 64bit ofb mode is being
413 * used. The extra state information to record how much of the
414 * 64bit block we have used is contained in *num;
415 */
416void
417RC2_ofb64_encrypt(const unsigned char *in, unsigned char *out,
418 long length, RC2_KEY *schedule, unsigned char *ivec,
419 int *num)
420{
421 unsigned long v0, v1, t;
422 int n = *num;
423 long l = length;
424 unsigned char d[8];
425 char *dp;
426 unsigned long ti[2];
427 unsigned char *iv;
428 int save = 0;
429
430 iv = (unsigned char *)ivec;
431 c2l(iv, v0);
432 c2l(iv, v1);
433 ti[0] = v0;
434 ti[1] = v1;
435 dp = (char *)d;
436 l2c(v0, dp);
437 l2c(v1, dp);
438 while (l--) {
439 if (n == 0) {
440 RC2_encrypt((unsigned long *)ti, schedule);
441 dp = (char *)d;
442 t = ti[0];
443 l2c(t, dp);
444 t = ti[1];
445 l2c(t, dp);
446 save++;
447 }
448 *(out++) = *(in++) ^ d[n];
449 n = (n + 1) & 0x07;
450 }
451 if (save) {
452 v0 = ti[0];
453 v1 = ti[1];
454 iv = (unsigned char *)ivec;
455 l2c(v0, iv);
456 l2c(v1, iv);
457 }
458 t = v0 = v1 = ti[0] = ti[1] = 0;
459 *num = n;
460}
461LCRYPTO_ALIAS(RC2_ofb64_encrypt);