Coverage Report

Created: 2022-11-30 06:20

/src/openssl/crypto/rc2/rc2_cbc.c
Line
Count
Source (jump to first uncovered line)
1
/* crypto/rc2/rc2_cbc.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 <openssl/rc2.h>
60
#include "rc2_locl.h"
61
62
void RC2_cbc_encrypt(const unsigned char *in, unsigned char *out, long length,
63
                     RC2_KEY *ks, unsigned char *iv, int encrypt)
64
0
{
65
0
    register unsigned long tin0, tin1;
66
0
    register unsigned long tout0, tout1, xor0, xor1;
67
0
    register long l = length;
68
0
    unsigned long tin[2];
69
70
0
    if (encrypt) {
71
0
        c2l(iv, tout0);
72
0
        c2l(iv, tout1);
73
0
        iv -= 8;
74
0
        for (l -= 8; l >= 0; l -= 8) {
75
0
            c2l(in, tin0);
76
0
            c2l(in, tin1);
77
0
            tin0 ^= tout0;
78
0
            tin1 ^= tout1;
79
0
            tin[0] = tin0;
80
0
            tin[1] = tin1;
81
0
            RC2_encrypt(tin, ks);
82
0
            tout0 = tin[0];
83
0
            l2c(tout0, out);
84
0
            tout1 = tin[1];
85
0
            l2c(tout1, out);
86
0
        }
87
0
        if (l != -8) {
88
0
            c2ln(in, tin0, tin1, l + 8);
89
0
            tin0 ^= tout0;
90
0
            tin1 ^= tout1;
91
0
            tin[0] = tin0;
92
0
            tin[1] = tin1;
93
0
            RC2_encrypt(tin, ks);
94
0
            tout0 = tin[0];
95
0
            l2c(tout0, out);
96
0
            tout1 = tin[1];
97
0
            l2c(tout1, out);
98
0
        }
99
0
        l2c(tout0, iv);
100
0
        l2c(tout1, iv);
101
0
    } else {
102
0
        c2l(iv, xor0);
103
0
        c2l(iv, xor1);
104
0
        iv -= 8;
105
0
        for (l -= 8; l >= 0; l -= 8) {
106
0
            c2l(in, tin0);
107
0
            tin[0] = tin0;
108
0
            c2l(in, tin1);
109
0
            tin[1] = tin1;
110
0
            RC2_decrypt(tin, ks);
111
0
            tout0 = tin[0] ^ xor0;
112
0
            tout1 = tin[1] ^ xor1;
113
0
            l2c(tout0, out);
114
0
            l2c(tout1, out);
115
0
            xor0 = tin0;
116
0
            xor1 = tin1;
117
0
        }
118
0
        if (l != -8) {
119
0
            c2l(in, tin0);
120
0
            tin[0] = tin0;
121
0
            c2l(in, tin1);
122
0
            tin[1] = tin1;
123
0
            RC2_decrypt(tin, ks);
124
0
            tout0 = tin[0] ^ xor0;
125
0
            tout1 = tin[1] ^ xor1;
126
0
            l2cn(tout0, tout1, out, l + 8);
127
0
            xor0 = tin0;
128
0
            xor1 = tin1;
129
0
        }
130
0
        l2c(xor0, iv);
131
0
        l2c(xor1, iv);
132
0
    }
133
0
    tin0 = tin1 = tout0 = tout1 = xor0 = xor1 = 0;
134
0
    tin[0] = tin[1] = 0;
135
0
}
136
137
void RC2_encrypt(unsigned long *d, RC2_KEY *key)
138
0
{
139
0
    int i, n;
140
0
    register RC2_INT *p0, *p1;
141
0
    register RC2_INT x0, x1, x2, x3, t;
142
0
    unsigned long l;
143
144
0
    l = d[0];
145
0
    x0 = (RC2_INT) l & 0xffff;
146
0
    x1 = (RC2_INT) (l >> 16L);
147
0
    l = d[1];
148
0
    x2 = (RC2_INT) l & 0xffff;
149
0
    x3 = (RC2_INT) (l >> 16L);
150
151
0
    n = 3;
152
0
    i = 5;
153
154
0
    p0 = p1 = &(key->data[0]);
155
0
    for (;;) {
156
0
        t = (x0 + (x1 & ~x3) + (x2 & x3) + *(p0++)) & 0xffff;
157
0
        x0 = (t << 1) | (t >> 15);
158
0
        t = (x1 + (x2 & ~x0) + (x3 & x0) + *(p0++)) & 0xffff;
159
0
        x1 = (t << 2) | (t >> 14);
160
0
        t = (x2 + (x3 & ~x1) + (x0 & x1) + *(p0++)) & 0xffff;
161
0
        x2 = (t << 3) | (t >> 13);
162
0
        t = (x3 + (x0 & ~x2) + (x1 & x2) + *(p0++)) & 0xffff;
163
0
        x3 = (t << 5) | (t >> 11);
164
165
0
        if (--i == 0) {
166
0
            if (--n == 0)
167
0
                break;
168
0
            i = (n == 2) ? 6 : 5;
169
170
0
            x0 += p1[x3 & 0x3f];
171
0
            x1 += p1[x0 & 0x3f];
172
0
            x2 += p1[x1 & 0x3f];
173
0
            x3 += p1[x2 & 0x3f];
174
0
        }
175
0
    }
176
177
0
    d[0] =
178
0
        (unsigned long)(x0 & 0xffff) | ((unsigned long)(x1 & 0xffff) << 16L);
179
0
    d[1] =
180
0
        (unsigned long)(x2 & 0xffff) | ((unsigned long)(x3 & 0xffff) << 16L);
181
0
}
182
183
void RC2_decrypt(unsigned long *d, RC2_KEY *key)
184
0
{
185
0
    int i, n;
186
0
    register RC2_INT *p0, *p1;
187
0
    register RC2_INT x0, x1, x2, x3, t;
188
0
    unsigned long l;
189
190
0
    l = d[0];
191
0
    x0 = (RC2_INT) l & 0xffff;
192
0
    x1 = (RC2_INT) (l >> 16L);
193
0
    l = d[1];
194
0
    x2 = (RC2_INT) l & 0xffff;
195
0
    x3 = (RC2_INT) (l >> 16L);
196
197
0
    n = 3;
198
0
    i = 5;
199
200
0
    p0 = &(key->data[63]);
201
0
    p1 = &(key->data[0]);
202
0
    for (;;) {
203
0
        t = ((x3 << 11) | (x3 >> 5)) & 0xffff;
204
0
        x3 = (t - (x0 & ~x2) - (x1 & x2) - *(p0--)) & 0xffff;
205
0
        t = ((x2 << 13) | (x2 >> 3)) & 0xffff;
206
0
        x2 = (t - (x3 & ~x1) - (x0 & x1) - *(p0--)) & 0xffff;
207
0
        t = ((x1 << 14) | (x1 >> 2)) & 0xffff;
208
0
        x1 = (t - (x2 & ~x0) - (x3 & x0) - *(p0--)) & 0xffff;
209
0
        t = ((x0 << 15) | (x0 >> 1)) & 0xffff;
210
0
        x0 = (t - (x1 & ~x3) - (x2 & x3) - *(p0--)) & 0xffff;
211
212
0
        if (--i == 0) {
213
0
            if (--n == 0)
214
0
                break;
215
0
            i = (n == 2) ? 6 : 5;
216
217
0
            x3 = (x3 - p1[x2 & 0x3f]) & 0xffff;
218
0
            x2 = (x2 - p1[x1 & 0x3f]) & 0xffff;
219
0
            x1 = (x1 - p1[x0 & 0x3f]) & 0xffff;
220
0
            x0 = (x0 - p1[x3 & 0x3f]) & 0xffff;
221
0
        }
222
0
    }
223
224
0
    d[0] =
225
0
        (unsigned long)(x0 & 0xffff) | ((unsigned long)(x1 & 0xffff) << 16L);
226
0
    d[1] =
227
0
        (unsigned long)(x2 & 0xffff) | ((unsigned long)(x3 & 0xffff) << 16L);
228
0
}