/src/openssl111/crypto/des/cfb64ede.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* |
2 | | * Copyright 1995-2017 The OpenSSL Project Authors. All Rights Reserved. |
3 | | * |
4 | | * Licensed under the OpenSSL license (the "License"). You may not use |
5 | | * this file except in compliance with the License. You can obtain a copy |
6 | | * in the file LICENSE in the source distribution or at |
7 | | * https://www.openssl.org/source/license.html |
8 | | */ |
9 | | |
10 | | #include "des_local.h" |
11 | | |
12 | | /* |
13 | | * The input and output encrypted as though 64bit cfb mode is being used. |
14 | | * The extra state information to record how much of the 64bit block we have |
15 | | * used is contained in *num; |
16 | | */ |
17 | | |
18 | | void DES_ede3_cfb64_encrypt(const unsigned char *in, unsigned char *out, |
19 | | long length, DES_key_schedule *ks1, |
20 | | DES_key_schedule *ks2, DES_key_schedule *ks3, |
21 | | DES_cblock *ivec, int *num, int enc) |
22 | 0 | { |
23 | 0 | register DES_LONG v0, v1; |
24 | 0 | register long l = length; |
25 | 0 | register int n = *num; |
26 | 0 | DES_LONG ti[2]; |
27 | 0 | unsigned char *iv, c, cc; |
28 | |
|
29 | 0 | iv = &(*ivec)[0]; |
30 | 0 | if (enc) { |
31 | 0 | while (l--) { |
32 | 0 | if (n == 0) { |
33 | 0 | c2l(iv, v0); |
34 | 0 | c2l(iv, v1); |
35 | |
|
36 | 0 | ti[0] = v0; |
37 | 0 | ti[1] = v1; |
38 | 0 | DES_encrypt3(ti, ks1, ks2, ks3); |
39 | 0 | v0 = ti[0]; |
40 | 0 | v1 = ti[1]; |
41 | |
|
42 | 0 | iv = &(*ivec)[0]; |
43 | 0 | l2c(v0, iv); |
44 | 0 | l2c(v1, iv); |
45 | 0 | iv = &(*ivec)[0]; |
46 | 0 | } |
47 | 0 | c = *(in++) ^ iv[n]; |
48 | 0 | *(out++) = c; |
49 | 0 | iv[n] = c; |
50 | 0 | n = (n + 1) & 0x07; |
51 | 0 | } |
52 | 0 | } else { |
53 | 0 | while (l--) { |
54 | 0 | if (n == 0) { |
55 | 0 | c2l(iv, v0); |
56 | 0 | c2l(iv, v1); |
57 | |
|
58 | 0 | ti[0] = v0; |
59 | 0 | ti[1] = v1; |
60 | 0 | DES_encrypt3(ti, ks1, ks2, ks3); |
61 | 0 | v0 = ti[0]; |
62 | 0 | v1 = ti[1]; |
63 | |
|
64 | 0 | iv = &(*ivec)[0]; |
65 | 0 | l2c(v0, iv); |
66 | 0 | l2c(v1, iv); |
67 | 0 | iv = &(*ivec)[0]; |
68 | 0 | } |
69 | 0 | cc = *(in++); |
70 | 0 | c = iv[n]; |
71 | 0 | iv[n] = cc; |
72 | 0 | *(out++) = c ^ cc; |
73 | 0 | n = (n + 1) & 0x07; |
74 | 0 | } |
75 | 0 | } |
76 | 0 | v0 = v1 = ti[0] = ti[1] = c = cc = 0; |
77 | 0 | *num = n; |
78 | 0 | } |
79 | | |
80 | | /* |
81 | | * This is compatible with the single key CFB-r for DES, even thought that's |
82 | | * not what EVP needs. |
83 | | */ |
84 | | |
85 | | void DES_ede3_cfb_encrypt(const unsigned char *in, unsigned char *out, |
86 | | int numbits, long length, DES_key_schedule *ks1, |
87 | | DES_key_schedule *ks2, DES_key_schedule *ks3, |
88 | | DES_cblock *ivec, int enc) |
89 | 0 | { |
90 | 0 | register DES_LONG d0, d1, v0, v1; |
91 | 0 | register unsigned long l = length, n = ((unsigned int)numbits + 7) / 8; |
92 | 0 | register int num = numbits, i; |
93 | 0 | DES_LONG ti[2]; |
94 | 0 | unsigned char *iv; |
95 | 0 | unsigned char ovec[16]; |
96 | |
|
97 | 0 | if (num > 64) |
98 | 0 | return; |
99 | 0 | iv = &(*ivec)[0]; |
100 | 0 | c2l(iv, v0); |
101 | 0 | c2l(iv, v1); |
102 | 0 | if (enc) { |
103 | 0 | while (l >= n) { |
104 | 0 | l -= n; |
105 | 0 | ti[0] = v0; |
106 | 0 | ti[1] = v1; |
107 | 0 | DES_encrypt3(ti, ks1, ks2, ks3); |
108 | 0 | c2ln(in, d0, d1, n); |
109 | 0 | in += n; |
110 | 0 | d0 ^= ti[0]; |
111 | 0 | d1 ^= ti[1]; |
112 | 0 | l2cn(d0, d1, out, n); |
113 | 0 | out += n; |
114 | | /* |
115 | | * 30-08-94 - eay - changed because l>>32 and l<<32 are bad under |
116 | | * gcc :-( |
117 | | */ |
118 | 0 | if (num == 32) { |
119 | 0 | v0 = v1; |
120 | 0 | v1 = d0; |
121 | 0 | } else if (num == 64) { |
122 | 0 | v0 = d0; |
123 | 0 | v1 = d1; |
124 | 0 | } else { |
125 | 0 | iv = &ovec[0]; |
126 | 0 | l2c(v0, iv); |
127 | 0 | l2c(v1, iv); |
128 | 0 | l2c(d0, iv); |
129 | 0 | l2c(d1, iv); |
130 | | /* shift ovec left most of the bits... */ |
131 | 0 | memmove(ovec, ovec + num / 8, 8 + (num % 8 ? 1 : 0)); |
132 | | /* now the remaining bits */ |
133 | 0 | if (num % 8 != 0) |
134 | 0 | for (i = 0; i < 8; ++i) { |
135 | 0 | ovec[i] <<= num % 8; |
136 | 0 | ovec[i] |= ovec[i + 1] >> (8 - num % 8); |
137 | 0 | } |
138 | 0 | iv = &ovec[0]; |
139 | 0 | c2l(iv, v0); |
140 | 0 | c2l(iv, v1); |
141 | 0 | } |
142 | 0 | } |
143 | 0 | } else { |
144 | 0 | while (l >= n) { |
145 | 0 | l -= n; |
146 | 0 | ti[0] = v0; |
147 | 0 | ti[1] = v1; |
148 | 0 | DES_encrypt3(ti, ks1, ks2, ks3); |
149 | 0 | c2ln(in, d0, d1, n); |
150 | 0 | in += n; |
151 | | /* |
152 | | * 30-08-94 - eay - changed because l>>32 and l<<32 are bad under |
153 | | * gcc :-( |
154 | | */ |
155 | 0 | if (num == 32) { |
156 | 0 | v0 = v1; |
157 | 0 | v1 = d0; |
158 | 0 | } else if (num == 64) { |
159 | 0 | v0 = d0; |
160 | 0 | v1 = d1; |
161 | 0 | } else { |
162 | 0 | iv = &ovec[0]; |
163 | 0 | l2c(v0, iv); |
164 | 0 | l2c(v1, iv); |
165 | 0 | l2c(d0, iv); |
166 | 0 | l2c(d1, iv); |
167 | | /* shift ovec left most of the bits... */ |
168 | 0 | memmove(ovec, ovec + num / 8, 8 + (num % 8 ? 1 : 0)); |
169 | | /* now the remaining bits */ |
170 | 0 | if (num % 8 != 0) |
171 | 0 | for (i = 0; i < 8; ++i) { |
172 | 0 | ovec[i] <<= num % 8; |
173 | 0 | ovec[i] |= ovec[i + 1] >> (8 - num % 8); |
174 | 0 | } |
175 | 0 | iv = &ovec[0]; |
176 | 0 | c2l(iv, v0); |
177 | 0 | c2l(iv, v1); |
178 | 0 | } |
179 | 0 | d0 ^= ti[0]; |
180 | 0 | d1 ^= ti[1]; |
181 | 0 | l2cn(d0, d1, out, n); |
182 | 0 | out += n; |
183 | 0 | } |
184 | 0 | } |
185 | 0 | iv = &(*ivec)[0]; |
186 | 0 | l2c(v0, iv); |
187 | 0 | l2c(v1, iv); |
188 | 0 | v0 = v1 = d0 = d1 = ti[0] = ti[1] = 0; |
189 | 0 | } |