Coverage Report

Created: 2022-11-30 06:20

/src/openssl/crypto/bf/bf_enc.c
Line
Count
Source (jump to first uncovered line)
1
/* crypto/bf/bf_enc.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/blowfish.h>
60
#include "bf_locl.h"
61
62
/*
63
 * Blowfish as implemented from 'Blowfish: Springer-Verlag paper' (From
64
 * LECTURE NOTES IN COMPUTER SCIENCE 809, FAST SOFTWARE ENCRYPTION, CAMBRIDGE
65
 * SECURITY WORKSHOP, CAMBRIDGE, U.K., DECEMBER 9-11, 1993)
66
 */
67
68
#if (BF_ROUNDS != 16) && (BF_ROUNDS != 20)
69
# error If you set BF_ROUNDS to some value other than 16 or 20, you will have \
70
to modify the code.
71
#endif
72
73
void BF_encrypt(BF_LONG *data, const BF_KEY *key)
74
0
{
75
0
#ifndef BF_PTR2
76
0
    register BF_LONG l, r;
77
0
    register const BF_LONG *p, *s;
78
79
0
    p = key->P;
80
0
    s = &(key->S[0]);
81
0
    l = data[0];
82
0
    r = data[1];
83
84
0
    l ^= p[0];
85
0
    BF_ENC(r, l, s, p[1]);
86
0
    BF_ENC(l, r, s, p[2]);
87
0
    BF_ENC(r, l, s, p[3]);
88
0
    BF_ENC(l, r, s, p[4]);
89
0
    BF_ENC(r, l, s, p[5]);
90
0
    BF_ENC(l, r, s, p[6]);
91
0
    BF_ENC(r, l, s, p[7]);
92
0
    BF_ENC(l, r, s, p[8]);
93
0
    BF_ENC(r, l, s, p[9]);
94
0
    BF_ENC(l, r, s, p[10]);
95
0
    BF_ENC(r, l, s, p[11]);
96
0
    BF_ENC(l, r, s, p[12]);
97
0
    BF_ENC(r, l, s, p[13]);
98
0
    BF_ENC(l, r, s, p[14]);
99
0
    BF_ENC(r, l, s, p[15]);
100
0
    BF_ENC(l, r, s, p[16]);
101
# if BF_ROUNDS == 20
102
    BF_ENC(r, l, s, p[17]);
103
    BF_ENC(l, r, s, p[18]);
104
    BF_ENC(r, l, s, p[19]);
105
    BF_ENC(l, r, s, p[20]);
106
# endif
107
0
    r ^= p[BF_ROUNDS + 1];
108
109
0
    data[1] = l & 0xffffffffL;
110
0
    data[0] = r & 0xffffffffL;
111
#else
112
    register BF_LONG l, r, t, *k;
113
114
    l = data[0];
115
    r = data[1];
116
    k = (BF_LONG *)key;
117
118
    l ^= k[0];
119
    BF_ENC(r, l, k, 1);
120
    BF_ENC(l, r, k, 2);
121
    BF_ENC(r, l, k, 3);
122
    BF_ENC(l, r, k, 4);
123
    BF_ENC(r, l, k, 5);
124
    BF_ENC(l, r, k, 6);
125
    BF_ENC(r, l, k, 7);
126
    BF_ENC(l, r, k, 8);
127
    BF_ENC(r, l, k, 9);
128
    BF_ENC(l, r, k, 10);
129
    BF_ENC(r, l, k, 11);
130
    BF_ENC(l, r, k, 12);
131
    BF_ENC(r, l, k, 13);
132
    BF_ENC(l, r, k, 14);
133
    BF_ENC(r, l, k, 15);
134
    BF_ENC(l, r, k, 16);
135
# if BF_ROUNDS == 20
136
    BF_ENC(r, l, k, 17);
137
    BF_ENC(l, r, k, 18);
138
    BF_ENC(r, l, k, 19);
139
    BF_ENC(l, r, k, 20);
140
# endif
141
    r ^= k[BF_ROUNDS + 1];
142
143
    data[1] = l & 0xffffffffL;
144
    data[0] = r & 0xffffffffL;
145
#endif
146
0
}
147
148
#ifndef BF_DEFAULT_OPTIONS
149
150
void BF_decrypt(BF_LONG *data, const BF_KEY *key)
151
0
{
152
0
# ifndef BF_PTR2
153
0
    register BF_LONG l, r;
154
0
    register const BF_LONG *p, *s;
155
156
0
    p = key->P;
157
0
    s = &(key->S[0]);
158
0
    l = data[0];
159
0
    r = data[1];
160
161
0
    l ^= p[BF_ROUNDS + 1];
162
#  if BF_ROUNDS == 20
163
    BF_ENC(r, l, s, p[20]);
164
    BF_ENC(l, r, s, p[19]);
165
    BF_ENC(r, l, s, p[18]);
166
    BF_ENC(l, r, s, p[17]);
167
#  endif
168
0
    BF_ENC(r, l, s, p[16]);
169
0
    BF_ENC(l, r, s, p[15]);
170
0
    BF_ENC(r, l, s, p[14]);
171
0
    BF_ENC(l, r, s, p[13]);
172
0
    BF_ENC(r, l, s, p[12]);
173
0
    BF_ENC(l, r, s, p[11]);
174
0
    BF_ENC(r, l, s, p[10]);
175
0
    BF_ENC(l, r, s, p[9]);
176
0
    BF_ENC(r, l, s, p[8]);
177
0
    BF_ENC(l, r, s, p[7]);
178
0
    BF_ENC(r, l, s, p[6]);
179
0
    BF_ENC(l, r, s, p[5]);
180
0
    BF_ENC(r, l, s, p[4]);
181
0
    BF_ENC(l, r, s, p[3]);
182
0
    BF_ENC(r, l, s, p[2]);
183
0
    BF_ENC(l, r, s, p[1]);
184
0
    r ^= p[0];
185
186
0
    data[1] = l & 0xffffffffL;
187
0
    data[0] = r & 0xffffffffL;
188
# else
189
    register BF_LONG l, r, t, *k;
190
191
    l = data[0];
192
    r = data[1];
193
    k = (BF_LONG *)key;
194
195
    l ^= k[BF_ROUNDS + 1];
196
#  if BF_ROUNDS == 20
197
    BF_ENC(r, l, k, 20);
198
    BF_ENC(l, r, k, 19);
199
    BF_ENC(r, l, k, 18);
200
    BF_ENC(l, r, k, 17);
201
#  endif
202
    BF_ENC(r, l, k, 16);
203
    BF_ENC(l, r, k, 15);
204
    BF_ENC(r, l, k, 14);
205
    BF_ENC(l, r, k, 13);
206
    BF_ENC(r, l, k, 12);
207
    BF_ENC(l, r, k, 11);
208
    BF_ENC(r, l, k, 10);
209
    BF_ENC(l, r, k, 9);
210
    BF_ENC(r, l, k, 8);
211
    BF_ENC(l, r, k, 7);
212
    BF_ENC(r, l, k, 6);
213
    BF_ENC(l, r, k, 5);
214
    BF_ENC(r, l, k, 4);
215
    BF_ENC(l, r, k, 3);
216
    BF_ENC(r, l, k, 2);
217
    BF_ENC(l, r, k, 1);
218
    r ^= k[0];
219
220
    data[1] = l & 0xffffffffL;
221
    data[0] = r & 0xffffffffL;
222
# endif
223
0
}
224
225
void BF_cbc_encrypt(const unsigned char *in, unsigned char *out, long length,
226
                    const BF_KEY *schedule, unsigned char *ivec, int encrypt)
227
0
{
228
0
    register BF_LONG tin0, tin1;
229
0
    register BF_LONG tout0, tout1, xor0, xor1;
230
0
    register long l = length;
231
0
    BF_LONG tin[2];
232
233
0
    if (encrypt) {
234
0
        n2l(ivec, tout0);
235
0
        n2l(ivec, tout1);
236
0
        ivec -= 8;
237
0
        for (l -= 8; l >= 0; l -= 8) {
238
0
            n2l(in, tin0);
239
0
            n2l(in, tin1);
240
0
            tin0 ^= tout0;
241
0
            tin1 ^= tout1;
242
0
            tin[0] = tin0;
243
0
            tin[1] = tin1;
244
0
            BF_encrypt(tin, schedule);
245
0
            tout0 = tin[0];
246
0
            tout1 = tin[1];
247
0
            l2n(tout0, out);
248
0
            l2n(tout1, out);
249
0
        }
250
0
        if (l != -8) {
251
0
            n2ln(in, tin0, tin1, l + 8);
252
0
            tin0 ^= tout0;
253
0
            tin1 ^= tout1;
254
0
            tin[0] = tin0;
255
0
            tin[1] = tin1;
256
0
            BF_encrypt(tin, schedule);
257
0
            tout0 = tin[0];
258
0
            tout1 = tin[1];
259
0
            l2n(tout0, out);
260
0
            l2n(tout1, out);
261
0
        }
262
0
        l2n(tout0, ivec);
263
0
        l2n(tout1, ivec);
264
0
    } else {
265
0
        n2l(ivec, xor0);
266
0
        n2l(ivec, xor1);
267
0
        ivec -= 8;
268
0
        for (l -= 8; l >= 0; l -= 8) {
269
0
            n2l(in, tin0);
270
0
            n2l(in, tin1);
271
0
            tin[0] = tin0;
272
0
            tin[1] = tin1;
273
0
            BF_decrypt(tin, schedule);
274
0
            tout0 = tin[0] ^ xor0;
275
0
            tout1 = tin[1] ^ xor1;
276
0
            l2n(tout0, out);
277
0
            l2n(tout1, out);
278
0
            xor0 = tin0;
279
0
            xor1 = tin1;
280
0
        }
281
0
        if (l != -8) {
282
0
            n2l(in, tin0);
283
0
            n2l(in, tin1);
284
0
            tin[0] = tin0;
285
0
            tin[1] = tin1;
286
0
            BF_decrypt(tin, schedule);
287
0
            tout0 = tin[0] ^ xor0;
288
0
            tout1 = tin[1] ^ xor1;
289
0
            l2nn(tout0, tout1, out, l + 8);
290
0
            xor0 = tin0;
291
0
            xor1 = tin1;
292
0
        }
293
0
        l2n(xor0, ivec);
294
0
        l2n(xor1, ivec);
295
0
    }
296
0
    tin0 = tin1 = tout0 = tout1 = xor0 = xor1 = 0;
297
0
    tin[0] = tin[1] = 0;
298
0
}
299
300
#endif