]>
Commit | Line | Data |
---|---|---|
b1ab9ed8 A |
1 | /* |
2 | * Copyright (c) 2000-2001 Apple Computer, Inc. All Rights Reserved. | |
3 | * | |
4 | * The contents of this file constitute Original Code as defined in and are | |
5 | * subject to the Apple Public Source License Version 1.2 (the 'License'). | |
6 | * You may not use this file except in compliance with the License. Please obtain | |
7 | * a copy of the License at http://www.apple.com/publicsource and read it before | |
8 | * using this file. | |
9 | * | |
10 | * This Original Code and all software distributed under the License are | |
11 | * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESS | |
12 | * OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, INCLUDING WITHOUT | |
13 | * LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR | |
14 | * PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. Please see the License for the | |
15 | * specific language governing rights and limitations under the License. | |
16 | */ | |
17 | ||
18 | ||
19 | /* crypto/rc2/rc2_cbc.c */ | |
20 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) | |
21 | * All rights reserved. | |
22 | * | |
23 | * This package is an SSL implementation written | |
24 | * by Eric Young (eay@cryptsoft.com). | |
25 | * The implementation was written so as to conform with Netscapes SSL. | |
26 | * | |
27 | * This library is free for commercial and non-commercial use as long as | |
28 | * the following conditions are aheared to. The following conditions | |
29 | * apply to all code found in this distribution, be it the RC4, RSA, | |
30 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation | |
31 | * included with this distribution is covered by the same copyright terms | |
32 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). | |
33 | * | |
34 | * Copyright remains Eric Young's, and as such any Copyright notices in | |
35 | * the code are not to be removed. | |
36 | * If this package is used in a product, Eric Young should be given attribution | |
37 | * as the author of the parts of the library used. | |
38 | * This can be in the form of a textual message at program startup or | |
39 | * in documentation (online or textual) provided with the package. | |
40 | * | |
41 | * Redistribution and use in source and binary forms, with or without | |
42 | * modification, are permitted provided that the following conditions | |
43 | * are met: | |
44 | * 1. Redistributions of source code must retain the copyright | |
45 | * notice, this list of conditions and the following disclaimer. | |
46 | * 2. Redistributions in binary form must reproduce the above copyright | |
47 | * notice, this list of conditions and the following disclaimer in the | |
48 | * documentation and/or other materials provided with the distribution. | |
49 | * 3. All advertising materials mentioning features or use of this software | |
50 | * must display the following acknowledgement: | |
51 | * "This product includes cryptographic software written by | |
52 | * Eric Young (eay@cryptsoft.com)" | |
53 | * The word 'cryptographic' can be left out if the rouines from the library | |
54 | * being used are not cryptographic related :-). | |
55 | * 4. If you include any Windows specific code (or a derivative thereof) from | |
56 | * the apps directory (application code) you must include an acknowledgement: | |
57 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | |
58 | * | |
59 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND | |
60 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
61 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
62 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE | |
63 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
64 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
65 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
66 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
67 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
68 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
69 | * SUCH DAMAGE. | |
70 | * | |
71 | * The licence and distribution terms for any publically available version or | |
72 | * derivative of this code cannot be changed. i.e. this code cannot simply be | |
73 | * copied and put under another distribution licence | |
74 | * [including the GNU Public Licence.] | |
75 | */ | |
76 | ||
77 | #include <openssl/rc2.h> | |
78 | #include "rc2_locl.h" | |
79 | ||
80 | #ifndef _OPENSSL_APPLE_CDSA_ | |
81 | ||
82 | void RC2_cbc_encrypt(unsigned char *in, unsigned char *out, long length, | |
83 | RC2_KEY *ks, unsigned char *iv, int encrypt) | |
84 | { | |
85 | register unsigned long tin0,tin1; | |
86 | register unsigned long tout0,tout1,xor0,xor1; | |
87 | register long l=length; | |
88 | unsigned long tin[2]; | |
89 | ||
90 | if (encrypt) | |
91 | { | |
92 | c2l(iv,tout0); | |
93 | c2l(iv,tout1); | |
94 | iv-=8; | |
95 | for (l-=8; l>=0; l-=8) | |
96 | { | |
97 | c2l(in,tin0); | |
98 | c2l(in,tin1); | |
99 | tin0^=tout0; | |
100 | tin1^=tout1; | |
101 | tin[0]=tin0; | |
102 | tin[1]=tin1; | |
103 | RC2_encrypt(tin,ks); | |
104 | tout0=tin[0]; l2c(tout0,out); | |
105 | tout1=tin[1]; l2c(tout1,out); | |
106 | } | |
107 | if (l != -8) | |
108 | { | |
109 | c2ln(in,tin0,tin1,l+8); | |
110 | tin0^=tout0; | |
111 | tin1^=tout1; | |
112 | tin[0]=tin0; | |
113 | tin[1]=tin1; | |
114 | RC2_encrypt(tin,ks); | |
115 | tout0=tin[0]; l2c(tout0,out); | |
116 | tout1=tin[1]; l2c(tout1,out); | |
117 | } | |
118 | l2c(tout0,iv); | |
119 | l2c(tout1,iv); | |
120 | } | |
121 | else | |
122 | { | |
123 | c2l(iv,xor0); | |
124 | c2l(iv,xor1); | |
125 | iv-=8; | |
126 | for (l-=8; l>=0; l-=8) | |
127 | { | |
128 | c2l(in,tin0); tin[0]=tin0; | |
129 | c2l(in,tin1); tin[1]=tin1; | |
130 | RC2_decrypt(tin,ks); | |
131 | tout0=tin[0]^xor0; | |
132 | tout1=tin[1]^xor1; | |
133 | l2c(tout0,out); | |
134 | l2c(tout1,out); | |
135 | xor0=tin0; | |
136 | xor1=tin1; | |
137 | } | |
138 | if (l != -8) | |
139 | { | |
140 | c2l(in,tin0); tin[0]=tin0; | |
141 | c2l(in,tin1); tin[1]=tin1; | |
142 | RC2_decrypt(tin,ks); | |
143 | tout0=tin[0]^xor0; | |
144 | tout1=tin[1]^xor1; | |
145 | l2cn(tout0,tout1,out,l+8); | |
146 | xor0=tin0; | |
147 | xor1=tin1; | |
148 | } | |
149 | l2c(xor0,iv); | |
150 | l2c(xor1,iv); | |
151 | } | |
152 | tin0=tin1=tout0=tout1=xor0=xor1=0; | |
153 | tin[0]=tin[1]=0; | |
154 | } | |
155 | ||
156 | #endif /* _OPENSSL_APPLE_CDSA_ */ | |
157 | ||
158 | #ifdef _OPENSSL_APPLE_CDSA_ | |
159 | void RC2_encrypt(RC2_INT *d, RC2_KEY *key) | |
160 | #else | |
161 | void RC2_encrypt(unsigned long *d, RC2_KEY *key) | |
162 | #endif | |
163 | { | |
164 | int i,n; | |
165 | register RC2_INT *p0,*p1; | |
166 | register RC2_INT x0,x1,x2,x3,t; | |
167 | unsigned long l; | |
168 | ||
169 | l=d[0]; | |
170 | x0=(RC2_INT)l&0xffff; | |
171 | x1=(RC2_INT)(l>>16L); | |
172 | l=d[1]; | |
173 | x2=(RC2_INT)l&0xffff; | |
174 | x3=(RC2_INT)(l>>16L); | |
175 | ||
176 | n=3; | |
177 | i=5; | |
178 | ||
179 | p0=p1= &(key->data[0]); | |
180 | for (;;) | |
181 | { | |
182 | t=(x0+(x1& ~x3)+(x2&x3)+ *(p0++))&0xffff; | |
183 | x0=(t<<1)|(t>>15); | |
184 | t=(x1+(x2& ~x0)+(x3&x0)+ *(p0++))&0xffff; | |
185 | x1=(t<<2)|(t>>14); | |
186 | t=(x2+(x3& ~x1)+(x0&x1)+ *(p0++))&0xffff; | |
187 | x2=(t<<3)|(t>>13); | |
188 | t=(x3+(x0& ~x2)+(x1&x2)+ *(p0++))&0xffff; | |
189 | x3=(t<<5)|(t>>11); | |
190 | ||
191 | if (--i == 0) | |
192 | { | |
193 | if (--n == 0) break; | |
194 | i=(n == 2)?6:5; | |
195 | ||
196 | x0+=p1[x3&0x3f]; | |
197 | x1+=p1[x0&0x3f]; | |
198 | x2+=p1[x1&0x3f]; | |
199 | x3+=p1[x2&0x3f]; | |
200 | } | |
201 | } | |
202 | ||
203 | d[0]=(unsigned long)(x0&0xffff)|((unsigned long)(x1&0xffff)<<16L); | |
204 | d[1]=(unsigned long)(x2&0xffff)|((unsigned long)(x3&0xffff)<<16L); | |
205 | } | |
206 | ||
207 | #ifdef _OPENSSL_APPLE_CDSA_ | |
208 | void RC2_decrypt(RC2_INT *d, RC2_KEY *key) | |
209 | #else | |
210 | void RC2_decrypt(unsigned long *d, RC2_KEY *key) | |
211 | #endif | |
212 | { | |
213 | int i,n; | |
214 | register RC2_INT *p0,*p1; | |
215 | register RC2_INT x0,x1,x2,x3,t; | |
216 | unsigned long l; | |
217 | ||
218 | l=d[0]; | |
219 | x0=(RC2_INT)l&0xffff; | |
220 | x1=(RC2_INT)(l>>16L); | |
221 | l=d[1]; | |
222 | x2=(RC2_INT)l&0xffff; | |
223 | x3=(RC2_INT)(l>>16L); | |
224 | ||
225 | n=3; | |
226 | i=5; | |
227 | ||
228 | p0= &(key->data[63]); | |
229 | p1= &(key->data[0]); | |
230 | for (;;) | |
231 | { | |
232 | t=((x3<<11)|(x3>>5))&0xffff; | |
233 | x3=(t-(x0& ~x2)-(x1&x2)- *(p0--))&0xffff; | |
234 | t=((x2<<13)|(x2>>3))&0xffff; | |
235 | x2=(t-(x3& ~x1)-(x0&x1)- *(p0--))&0xffff; | |
236 | t=((x1<<14)|(x1>>2))&0xffff; | |
237 | x1=(t-(x2& ~x0)-(x3&x0)- *(p0--))&0xffff; | |
238 | t=((x0<<15)|(x0>>1))&0xffff; | |
239 | x0=(t-(x1& ~x3)-(x2&x3)- *(p0--))&0xffff; | |
240 | ||
241 | if (--i == 0) | |
242 | { | |
243 | if (--n == 0) break; | |
244 | i=(n == 2)?6:5; | |
245 | ||
246 | x3=(x3-p1[x2&0x3f])&0xffff; | |
247 | x2=(x2-p1[x1&0x3f])&0xffff; | |
248 | x1=(x1-p1[x0&0x3f])&0xffff; | |
249 | x0=(x0-p1[x3&0x3f])&0xffff; | |
250 | } | |
251 | } | |
252 | ||
253 | d[0]=(unsigned long)(x0&0xffff)|((unsigned long)(x1&0xffff)<<16L); | |
254 | d[1]=(unsigned long)(x2&0xffff)|((unsigned long)(x3&0xffff)<<16L); | |
255 | } | |
256 |