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