/src/libressl/crypto/des/cfb64ede.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* $OpenBSD: cfb64ede.c,v 1.9 2015/02/07 13:19:15 doug 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 "des_locl.h" |
60 | | |
61 | | /* The input and output encrypted as though 64bit cfb mode is being |
62 | | * used. The extra state information to record how much of the |
63 | | * 64bit block we have used is contained in *num; |
64 | | */ |
65 | | |
66 | | void DES_ede3_cfb64_encrypt(const unsigned char *in, unsigned char *out, |
67 | | long length, DES_key_schedule *ks1, |
68 | | DES_key_schedule *ks2, DES_key_schedule *ks3, |
69 | | DES_cblock *ivec, int *num, int enc) |
70 | 0 | { |
71 | 0 | DES_LONG v0,v1; |
72 | 0 | long l=length; |
73 | 0 | int n= *num; |
74 | 0 | DES_LONG ti[2]; |
75 | 0 | unsigned char *iv,c,cc; |
76 | |
|
77 | 0 | iv=&(*ivec)[0]; |
78 | 0 | if (enc) |
79 | 0 | { |
80 | 0 | while (l--) |
81 | 0 | { |
82 | 0 | if (n == 0) |
83 | 0 | { |
84 | 0 | c2l(iv,v0); |
85 | 0 | c2l(iv,v1); |
86 | |
|
87 | 0 | ti[0]=v0; |
88 | 0 | ti[1]=v1; |
89 | 0 | DES_encrypt3(ti,ks1,ks2,ks3); |
90 | 0 | v0=ti[0]; |
91 | 0 | v1=ti[1]; |
92 | |
|
93 | 0 | iv = &(*ivec)[0]; |
94 | 0 | l2c(v0,iv); |
95 | 0 | l2c(v1,iv); |
96 | 0 | iv = &(*ivec)[0]; |
97 | 0 | } |
98 | 0 | c= *(in++)^iv[n]; |
99 | 0 | *(out++)=c; |
100 | 0 | iv[n]=c; |
101 | 0 | n=(n+1)&0x07; |
102 | 0 | } |
103 | 0 | } |
104 | 0 | else |
105 | 0 | { |
106 | 0 | while (l--) |
107 | 0 | { |
108 | 0 | if (n == 0) |
109 | 0 | { |
110 | 0 | c2l(iv,v0); |
111 | 0 | c2l(iv,v1); |
112 | |
|
113 | 0 | ti[0]=v0; |
114 | 0 | ti[1]=v1; |
115 | 0 | DES_encrypt3(ti,ks1,ks2,ks3); |
116 | 0 | v0=ti[0]; |
117 | 0 | v1=ti[1]; |
118 | |
|
119 | 0 | iv = &(*ivec)[0]; |
120 | 0 | l2c(v0,iv); |
121 | 0 | l2c(v1,iv); |
122 | 0 | iv = &(*ivec)[0]; |
123 | 0 | } |
124 | 0 | cc= *(in++); |
125 | 0 | c=iv[n]; |
126 | 0 | iv[n]=cc; |
127 | 0 | *(out++)=c^cc; |
128 | 0 | n=(n+1)&0x07; |
129 | 0 | } |
130 | 0 | } |
131 | 0 | v0=v1=ti[0]=ti[1]=c=cc=0; |
132 | 0 | *num=n; |
133 | 0 | } |
134 | | |
135 | | /* This is compatible with the single key CFB-r for DES, even thought that's |
136 | | * not what EVP needs. |
137 | | */ |
138 | | |
139 | | void DES_ede3_cfb_encrypt(const unsigned char *in,unsigned char *out, |
140 | | int numbits,long length,DES_key_schedule *ks1, |
141 | | DES_key_schedule *ks2,DES_key_schedule *ks3, |
142 | | DES_cblock *ivec,int enc) |
143 | 0 | { |
144 | 0 | DES_LONG d0,d1,v0,v1; |
145 | 0 | unsigned long l=length,n=((unsigned int)numbits+7)/8; |
146 | 0 | int num=numbits,i; |
147 | 0 | DES_LONG ti[2]; |
148 | 0 | unsigned char *iv; |
149 | 0 | unsigned char ovec[16]; |
150 | |
|
151 | 0 | if (num > 64) return; |
152 | 0 | iv = &(*ivec)[0]; |
153 | 0 | c2l(iv,v0); |
154 | 0 | c2l(iv,v1); |
155 | 0 | if (enc) |
156 | 0 | { |
157 | 0 | while (l >= n) |
158 | 0 | { |
159 | 0 | l-=n; |
160 | 0 | ti[0]=v0; |
161 | 0 | ti[1]=v1; |
162 | 0 | DES_encrypt3(ti,ks1,ks2,ks3); |
163 | 0 | c2ln(in,d0,d1,n); |
164 | 0 | in+=n; |
165 | 0 | d0^=ti[0]; |
166 | 0 | d1^=ti[1]; |
167 | 0 | l2cn(d0,d1,out,n); |
168 | 0 | out+=n; |
169 | | /* 30-08-94 - eay - changed because l>>32 and |
170 | | * l<<32 are bad under gcc :-( */ |
171 | 0 | if (num == 32) |
172 | 0 | { v0=v1; v1=d0; } |
173 | 0 | else if (num == 64) |
174 | 0 | { v0=d0; v1=d1; } |
175 | 0 | else |
176 | 0 | { |
177 | 0 | iv=&ovec[0]; |
178 | 0 | l2c(v0,iv); |
179 | 0 | l2c(v1,iv); |
180 | 0 | l2c(d0,iv); |
181 | 0 | l2c(d1,iv); |
182 | | /* shift ovec left most of the bits... */ |
183 | 0 | memmove(ovec,ovec+num/8,8+(num%8 ? 1 : 0)); |
184 | | /* now the remaining bits */ |
185 | 0 | if(num%8 != 0) |
186 | 0 | for(i=0 ; i < 8 ; ++i) |
187 | 0 | { |
188 | 0 | ovec[i]<<=num%8; |
189 | 0 | ovec[i]|=ovec[i+1]>>(8-num%8); |
190 | 0 | } |
191 | 0 | iv=&ovec[0]; |
192 | 0 | c2l(iv,v0); |
193 | 0 | c2l(iv,v1); |
194 | 0 | } |
195 | 0 | } |
196 | 0 | } |
197 | 0 | else |
198 | 0 | { |
199 | 0 | while (l >= n) |
200 | 0 | { |
201 | 0 | l-=n; |
202 | 0 | ti[0]=v0; |
203 | 0 | ti[1]=v1; |
204 | 0 | DES_encrypt3(ti,ks1,ks2,ks3); |
205 | 0 | c2ln(in,d0,d1,n); |
206 | 0 | in+=n; |
207 | | /* 30-08-94 - eay - changed because l>>32 and |
208 | | * l<<32 are bad under gcc :-( */ |
209 | 0 | if (num == 32) |
210 | 0 | { v0=v1; v1=d0; } |
211 | 0 | else if (num == 64) |
212 | 0 | { v0=d0; v1=d1; } |
213 | 0 | else |
214 | 0 | { |
215 | 0 | iv=&ovec[0]; |
216 | 0 | l2c(v0,iv); |
217 | 0 | l2c(v1,iv); |
218 | 0 | l2c(d0,iv); |
219 | 0 | l2c(d1,iv); |
220 | | /* shift ovec left most of the bits... */ |
221 | 0 | memmove(ovec,ovec+num/8,8+(num%8 ? 1 : 0)); |
222 | | /* now the remaining bits */ |
223 | 0 | if(num%8 != 0) |
224 | 0 | for(i=0 ; i < 8 ; ++i) |
225 | 0 | { |
226 | 0 | ovec[i]<<=num%8; |
227 | 0 | ovec[i]|=ovec[i+1]>>(8-num%8); |
228 | 0 | } |
229 | 0 | iv=&ovec[0]; |
230 | 0 | c2l(iv,v0); |
231 | 0 | c2l(iv,v1); |
232 | 0 | } |
233 | 0 | d0^=ti[0]; |
234 | 0 | d1^=ti[1]; |
235 | 0 | l2cn(d0,d1,out,n); |
236 | 0 | out+=n; |
237 | 0 | } |
238 | 0 | } |
239 | 0 | iv = &(*ivec)[0]; |
240 | 0 | l2c(v0,iv); |
241 | 0 | l2c(v1,iv); |
242 | 0 | v0=v1=d0=d1=ti[0]=ti[1]=0; |
243 | 0 | } |
244 | | |