os/ossrv/ssl/libcrypto/src/crypto/rc2/rc2_cbc.c
changeset 0 bde4ae8d615e
     1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/os/ossrv/ssl/libcrypto/src/crypto/rc2/rc2_cbc.c	Fri Jun 15 03:10:57 2012 +0200
     1.3 @@ -0,0 +1,226 @@
     1.4 +/* crypto/rc2/rc2_cbc.c */
     1.5 +/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
     1.6 + * All rights reserved.
     1.7 + *
     1.8 + * This package is an SSL implementation written
     1.9 + * by Eric Young (eay@cryptsoft.com).
    1.10 + * The implementation was written so as to conform with Netscapes SSL.
    1.11 + * 
    1.12 + * This library is free for commercial and non-commercial use as long as
    1.13 + * the following conditions are aheared to.  The following conditions
    1.14 + * apply to all code found in this distribution, be it the RC4, RSA,
    1.15 + * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
    1.16 + * included with this distribution is covered by the same copyright terms
    1.17 + * except that the holder is Tim Hudson (tjh@cryptsoft.com).
    1.18 + * 
    1.19 + * Copyright remains Eric Young's, and as such any Copyright notices in
    1.20 + * the code are not to be removed.
    1.21 + * If this package is used in a product, Eric Young should be given attribution
    1.22 + * as the author of the parts of the library used.
    1.23 + * This can be in the form of a textual message at program startup or
    1.24 + * in documentation (online or textual) provided with the package.
    1.25 + * 
    1.26 + * Redistribution and use in source and binary forms, with or without
    1.27 + * modification, are permitted provided that the following conditions
    1.28 + * are met:
    1.29 + * 1. Redistributions of source code must retain the copyright
    1.30 + *    notice, this list of conditions and the following disclaimer.
    1.31 + * 2. Redistributions in binary form must reproduce the above copyright
    1.32 + *    notice, this list of conditions and the following disclaimer in the
    1.33 + *    documentation and/or other materials provided with the distribution.
    1.34 + * 3. All advertising materials mentioning features or use of this software
    1.35 + *    must display the following acknowledgement:
    1.36 + *    "This product includes cryptographic software written by
    1.37 + *     Eric Young (eay@cryptsoft.com)"
    1.38 + *    The word 'cryptographic' can be left out if the rouines from the library
    1.39 + *    being used are not cryptographic related :-).
    1.40 + * 4. If you include any Windows specific code (or a derivative thereof) from 
    1.41 + *    the apps directory (application code) you must include an acknowledgement:
    1.42 + *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
    1.43 + * 
    1.44 + * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
    1.45 + * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
    1.46 + * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
    1.47 + * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
    1.48 + * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
    1.49 + * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
    1.50 + * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
    1.51 + * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
    1.52 + * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
    1.53 + * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
    1.54 + * SUCH DAMAGE.
    1.55 + * 
    1.56 + * The licence and distribution terms for any publically available version or
    1.57 + * derivative of this code cannot be changed.  i.e. this code cannot simply be
    1.58 + * copied and put under another distribution licence
    1.59 + * [including the GNU Public Licence.]
    1.60 + */
    1.61 +
    1.62 +#include <openssl/rc2.h>
    1.63 +#include "rc2_locl.h"
    1.64 +
    1.65 +EXPORT_C void RC2_cbc_encrypt(const unsigned char *in, unsigned char *out, long length,
    1.66 +	     RC2_KEY *ks, unsigned char *iv, int encrypt)
    1.67 +	{
    1.68 +	register unsigned long tin0,tin1;
    1.69 +	register unsigned long tout0,tout1,xor0,xor1;
    1.70 +	register long l=length;
    1.71 +	unsigned long tin[2];
    1.72 +
    1.73 +	if (encrypt)
    1.74 +		{
    1.75 +		c2l(iv,tout0);
    1.76 +		c2l(iv,tout1);
    1.77 +		iv-=8;
    1.78 +		for (l-=8; l>=0; l-=8)
    1.79 +			{
    1.80 +			c2l(in,tin0);
    1.81 +			c2l(in,tin1);
    1.82 +			tin0^=tout0;
    1.83 +			tin1^=tout1;
    1.84 +			tin[0]=tin0;
    1.85 +			tin[1]=tin1;
    1.86 +			RC2_encrypt(tin,ks);
    1.87 +			tout0=tin[0]; l2c(tout0,out);
    1.88 +			tout1=tin[1]; l2c(tout1,out);
    1.89 +			}
    1.90 +		if (l != -8)
    1.91 +			{
    1.92 +			c2ln(in,tin0,tin1,l+8);
    1.93 +			tin0^=tout0;
    1.94 +			tin1^=tout1;
    1.95 +			tin[0]=tin0;
    1.96 +			tin[1]=tin1;
    1.97 +			RC2_encrypt(tin,ks);
    1.98 +			tout0=tin[0]; l2c(tout0,out);
    1.99 +			tout1=tin[1]; l2c(tout1,out);
   1.100 +			}
   1.101 +		l2c(tout0,iv);
   1.102 +		l2c(tout1,iv);
   1.103 +		}
   1.104 +	else
   1.105 +		{
   1.106 +		c2l(iv,xor0);
   1.107 +		c2l(iv,xor1);
   1.108 +		iv-=8;
   1.109 +		for (l-=8; l>=0; l-=8)
   1.110 +			{
   1.111 +			c2l(in,tin0); tin[0]=tin0;
   1.112 +			c2l(in,tin1); tin[1]=tin1;
   1.113 +			RC2_decrypt(tin,ks);
   1.114 +			tout0=tin[0]^xor0;
   1.115 +			tout1=tin[1]^xor1;
   1.116 +			l2c(tout0,out);
   1.117 +			l2c(tout1,out);
   1.118 +			xor0=tin0;
   1.119 +			xor1=tin1;
   1.120 +			}
   1.121 +		if (l != -8)
   1.122 +			{
   1.123 +			c2l(in,tin0); tin[0]=tin0;
   1.124 +			c2l(in,tin1); tin[1]=tin1;
   1.125 +			RC2_decrypt(tin,ks);
   1.126 +			tout0=tin[0]^xor0;
   1.127 +			tout1=tin[1]^xor1;
   1.128 +			l2cn(tout0,tout1,out,l+8);
   1.129 +			xor0=tin0;
   1.130 +			xor1=tin1;
   1.131 +			}
   1.132 +		l2c(xor0,iv);
   1.133 +		l2c(xor1,iv);
   1.134 +		}
   1.135 +	tin0=tin1=tout0=tout1=xor0=xor1=0;
   1.136 +	tin[0]=tin[1]=0;
   1.137 +	}
   1.138 +
   1.139 +EXPORT_C void RC2_encrypt(unsigned long *d, RC2_KEY *key)
   1.140 +	{
   1.141 +	int i,n;
   1.142 +	register RC2_INT *p0,*p1;
   1.143 +	register RC2_INT x0,x1,x2,x3,t;
   1.144 +	unsigned long l;
   1.145 +
   1.146 +	l=d[0];
   1.147 +	x0=(RC2_INT)l&0xffff;
   1.148 +	x1=(RC2_INT)(l>>16L);
   1.149 +	l=d[1];
   1.150 +	x2=(RC2_INT)l&0xffff;
   1.151 +	x3=(RC2_INT)(l>>16L);
   1.152 +
   1.153 +	n=3;
   1.154 +	i=5;
   1.155 +
   1.156 +	p0=p1= &(key->data[0]);
   1.157 +	for (;;)
   1.158 +		{
   1.159 +		t=(x0+(x1& ~x3)+(x2&x3)+ *(p0++))&0xffff;
   1.160 +		x0=(t<<1)|(t>>15);
   1.161 +		t=(x1+(x2& ~x0)+(x3&x0)+ *(p0++))&0xffff;
   1.162 +		x1=(t<<2)|(t>>14);
   1.163 +		t=(x2+(x3& ~x1)+(x0&x1)+ *(p0++))&0xffff;
   1.164 +		x2=(t<<3)|(t>>13);
   1.165 +		t=(x3+(x0& ~x2)+(x1&x2)+ *(p0++))&0xffff;
   1.166 +		x3=(t<<5)|(t>>11);
   1.167 +
   1.168 +		if (--i == 0)
   1.169 +			{
   1.170 +			if (--n == 0) break;
   1.171 +			i=(n == 2)?6:5;
   1.172 +
   1.173 +			x0+=p1[x3&0x3f];
   1.174 +			x1+=p1[x0&0x3f];
   1.175 +			x2+=p1[x1&0x3f];
   1.176 +			x3+=p1[x2&0x3f];
   1.177 +			}
   1.178 +		}
   1.179 +
   1.180 +	d[0]=(unsigned long)(x0&0xffff)|((unsigned long)(x1&0xffff)<<16L);
   1.181 +	d[1]=(unsigned long)(x2&0xffff)|((unsigned long)(x3&0xffff)<<16L);
   1.182 +	}
   1.183 +
   1.184 +EXPORT_C void RC2_decrypt(unsigned long *d, RC2_KEY *key)
   1.185 +	{
   1.186 +	int i,n;
   1.187 +	register RC2_INT *p0,*p1;
   1.188 +	register RC2_INT x0,x1,x2,x3,t;
   1.189 +	unsigned long l;
   1.190 +
   1.191 +	l=d[0];
   1.192 +	x0=(RC2_INT)l&0xffff;
   1.193 +	x1=(RC2_INT)(l>>16L);
   1.194 +	l=d[1];
   1.195 +	x2=(RC2_INT)l&0xffff;
   1.196 +	x3=(RC2_INT)(l>>16L);
   1.197 +
   1.198 +	n=3;
   1.199 +	i=5;
   1.200 +
   1.201 +	p0= &(key->data[63]);
   1.202 +	p1= &(key->data[0]);
   1.203 +	for (;;)
   1.204 +		{
   1.205 +		t=((x3<<11)|(x3>>5))&0xffff;
   1.206 +		x3=(t-(x0& ~x2)-(x1&x2)- *(p0--))&0xffff;
   1.207 +		t=((x2<<13)|(x2>>3))&0xffff;
   1.208 +		x2=(t-(x3& ~x1)-(x0&x1)- *(p0--))&0xffff;
   1.209 +		t=((x1<<14)|(x1>>2))&0xffff;
   1.210 +		x1=(t-(x2& ~x0)-(x3&x0)- *(p0--))&0xffff;
   1.211 +		t=((x0<<15)|(x0>>1))&0xffff;
   1.212 +		x0=(t-(x1& ~x3)-(x2&x3)- *(p0--))&0xffff;
   1.213 +
   1.214 +		if (--i == 0)
   1.215 +			{
   1.216 +			if (--n == 0) break;
   1.217 +			i=(n == 2)?6:5;
   1.218 +
   1.219 +			x3=(x3-p1[x2&0x3f])&0xffff;
   1.220 +			x2=(x2-p1[x1&0x3f])&0xffff;
   1.221 +			x1=(x1-p1[x0&0x3f])&0xffff;
   1.222 +			x0=(x0-p1[x3&0x3f])&0xffff;
   1.223 +			}
   1.224 +		}
   1.225 +
   1.226 +	d[0]=(unsigned long)(x0&0xffff)|((unsigned long)(x1&0xffff)<<16L);
   1.227 +	d[1]=(unsigned long)(x2&0xffff)|((unsigned long)(x3&0xffff)<<16L);
   1.228 +	}
   1.229 +