xref: /onnv-gate/usr/src/common/openssl/crypto/idea/i_skey.c (revision 0:68f95e015346)
1*0Sstevel@tonic-gate /* crypto/idea/i_skey.c */
2*0Sstevel@tonic-gate /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
3*0Sstevel@tonic-gate  * All rights reserved.
4*0Sstevel@tonic-gate  *
5*0Sstevel@tonic-gate  * This package is an SSL implementation written
6*0Sstevel@tonic-gate  * by Eric Young (eay@cryptsoft.com).
7*0Sstevel@tonic-gate  * The implementation was written so as to conform with Netscapes SSL.
8*0Sstevel@tonic-gate  *
9*0Sstevel@tonic-gate  * This library is free for commercial and non-commercial use as long as
10*0Sstevel@tonic-gate  * the following conditions are aheared to.  The following conditions
11*0Sstevel@tonic-gate  * apply to all code found in this distribution, be it the RC4, RSA,
12*0Sstevel@tonic-gate  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
13*0Sstevel@tonic-gate  * included with this distribution is covered by the same copyright terms
14*0Sstevel@tonic-gate  * except that the holder is Tim Hudson (tjh@cryptsoft.com).
15*0Sstevel@tonic-gate  *
16*0Sstevel@tonic-gate  * Copyright remains Eric Young's, and as such any Copyright notices in
17*0Sstevel@tonic-gate  * the code are not to be removed.
18*0Sstevel@tonic-gate  * If this package is used in a product, Eric Young should be given attribution
19*0Sstevel@tonic-gate  * as the author of the parts of the library used.
20*0Sstevel@tonic-gate  * This can be in the form of a textual message at program startup or
21*0Sstevel@tonic-gate  * in documentation (online or textual) provided with the package.
22*0Sstevel@tonic-gate  *
23*0Sstevel@tonic-gate  * Redistribution and use in source and binary forms, with or without
24*0Sstevel@tonic-gate  * modification, are permitted provided that the following conditions
25*0Sstevel@tonic-gate  * are met:
26*0Sstevel@tonic-gate  * 1. Redistributions of source code must retain the copyright
27*0Sstevel@tonic-gate  *    notice, this list of conditions and the following disclaimer.
28*0Sstevel@tonic-gate  * 2. Redistributions in binary form must reproduce the above copyright
29*0Sstevel@tonic-gate  *    notice, this list of conditions and the following disclaimer in the
30*0Sstevel@tonic-gate  *    documentation and/or other materials provided with the distribution.
31*0Sstevel@tonic-gate  * 3. All advertising materials mentioning features or use of this software
32*0Sstevel@tonic-gate  *    must display the following acknowledgement:
33*0Sstevel@tonic-gate  *    "This product includes cryptographic software written by
34*0Sstevel@tonic-gate  *     Eric Young (eay@cryptsoft.com)"
35*0Sstevel@tonic-gate  *    The word 'cryptographic' can be left out if the rouines from the library
36*0Sstevel@tonic-gate  *    being used are not cryptographic related :-).
37*0Sstevel@tonic-gate  * 4. If you include any Windows specific code (or a derivative thereof) from
38*0Sstevel@tonic-gate  *    the apps directory (application code) you must include an acknowledgement:
39*0Sstevel@tonic-gate  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
40*0Sstevel@tonic-gate  *
41*0Sstevel@tonic-gate  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
42*0Sstevel@tonic-gate  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
43*0Sstevel@tonic-gate  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
44*0Sstevel@tonic-gate  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
45*0Sstevel@tonic-gate  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
46*0Sstevel@tonic-gate  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
47*0Sstevel@tonic-gate  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48*0Sstevel@tonic-gate  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
49*0Sstevel@tonic-gate  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
50*0Sstevel@tonic-gate  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
51*0Sstevel@tonic-gate  * SUCH DAMAGE.
52*0Sstevel@tonic-gate  *
53*0Sstevel@tonic-gate  * The licence and distribution terms for any publically available version or
54*0Sstevel@tonic-gate  * derivative of this code cannot be changed.  i.e. this code cannot simply be
55*0Sstevel@tonic-gate  * copied and put under another distribution licence
56*0Sstevel@tonic-gate  * [including the GNU Public Licence.]
57*0Sstevel@tonic-gate  */
58*0Sstevel@tonic-gate 
59*0Sstevel@tonic-gate #include <openssl/idea.h>
60*0Sstevel@tonic-gate #include "idea_lcl.h"
61*0Sstevel@tonic-gate 
62*0Sstevel@tonic-gate static IDEA_INT inverse(unsigned int xin);
idea_set_encrypt_key(const unsigned char * key,IDEA_KEY_SCHEDULE * ks)63*0Sstevel@tonic-gate void idea_set_encrypt_key(const unsigned char *key, IDEA_KEY_SCHEDULE *ks)
64*0Sstevel@tonic-gate 	{
65*0Sstevel@tonic-gate 	int i;
66*0Sstevel@tonic-gate 	register IDEA_INT *kt,*kf,r0,r1,r2;
67*0Sstevel@tonic-gate 
68*0Sstevel@tonic-gate 	kt= &(ks->data[0][0]);
69*0Sstevel@tonic-gate 	n2s(key,kt[0]); n2s(key,kt[1]); n2s(key,kt[2]); n2s(key,kt[3]);
70*0Sstevel@tonic-gate 	n2s(key,kt[4]); n2s(key,kt[5]); n2s(key,kt[6]); n2s(key,kt[7]);
71*0Sstevel@tonic-gate 
72*0Sstevel@tonic-gate 	kf=kt;
73*0Sstevel@tonic-gate 	kt+=8;
74*0Sstevel@tonic-gate 	for (i=0; i<6; i++)
75*0Sstevel@tonic-gate 		{
76*0Sstevel@tonic-gate 		r2= kf[1];
77*0Sstevel@tonic-gate 		r1= kf[2];
78*0Sstevel@tonic-gate 		*(kt++)= ((r2<<9) | (r1>>7))&0xffff;
79*0Sstevel@tonic-gate 		r0= kf[3];
80*0Sstevel@tonic-gate 		*(kt++)= ((r1<<9) | (r0>>7))&0xffff;
81*0Sstevel@tonic-gate 		r1= kf[4];
82*0Sstevel@tonic-gate 		*(kt++)= ((r0<<9) | (r1>>7))&0xffff;
83*0Sstevel@tonic-gate 		r0= kf[5];
84*0Sstevel@tonic-gate 		*(kt++)= ((r1<<9) | (r0>>7))&0xffff;
85*0Sstevel@tonic-gate 		r1= kf[6];
86*0Sstevel@tonic-gate 		*(kt++)= ((r0<<9) | (r1>>7))&0xffff;
87*0Sstevel@tonic-gate 		r0= kf[7];
88*0Sstevel@tonic-gate 		*(kt++)= ((r1<<9) | (r0>>7))&0xffff;
89*0Sstevel@tonic-gate 		r1= kf[0];
90*0Sstevel@tonic-gate 		if (i >= 5) break;
91*0Sstevel@tonic-gate 		*(kt++)= ((r0<<9) | (r1>>7))&0xffff;
92*0Sstevel@tonic-gate 		*(kt++)= ((r1<<9) | (r2>>7))&0xffff;
93*0Sstevel@tonic-gate 		kf+=8;
94*0Sstevel@tonic-gate 		}
95*0Sstevel@tonic-gate 	}
96*0Sstevel@tonic-gate 
idea_set_decrypt_key(IDEA_KEY_SCHEDULE * ek,IDEA_KEY_SCHEDULE * dk)97*0Sstevel@tonic-gate void idea_set_decrypt_key(IDEA_KEY_SCHEDULE *ek, IDEA_KEY_SCHEDULE *dk)
98*0Sstevel@tonic-gate 	{
99*0Sstevel@tonic-gate 	int r;
100*0Sstevel@tonic-gate 	register IDEA_INT *fp,*tp,t;
101*0Sstevel@tonic-gate 
102*0Sstevel@tonic-gate 	tp= &(dk->data[0][0]);
103*0Sstevel@tonic-gate 	fp= &(ek->data[8][0]);
104*0Sstevel@tonic-gate 	for (r=0; r<9; r++)
105*0Sstevel@tonic-gate 		{
106*0Sstevel@tonic-gate 		*(tp++)=inverse(fp[0]);
107*0Sstevel@tonic-gate 		*(tp++)=((int)(0x10000L-fp[2])&0xffff);
108*0Sstevel@tonic-gate 		*(tp++)=((int)(0x10000L-fp[1])&0xffff);
109*0Sstevel@tonic-gate 		*(tp++)=inverse(fp[3]);
110*0Sstevel@tonic-gate 		if (r == 8) break;
111*0Sstevel@tonic-gate 		fp-=6;
112*0Sstevel@tonic-gate 		*(tp++)=fp[4];
113*0Sstevel@tonic-gate 		*(tp++)=fp[5];
114*0Sstevel@tonic-gate 		}
115*0Sstevel@tonic-gate 
116*0Sstevel@tonic-gate 	tp= &(dk->data[0][0]);
117*0Sstevel@tonic-gate 	t=tp[1];
118*0Sstevel@tonic-gate 	tp[1]=tp[2];
119*0Sstevel@tonic-gate 	tp[2]=t;
120*0Sstevel@tonic-gate 
121*0Sstevel@tonic-gate 	t=tp[49];
122*0Sstevel@tonic-gate 	tp[49]=tp[50];
123*0Sstevel@tonic-gate 	tp[50]=t;
124*0Sstevel@tonic-gate 	}
125*0Sstevel@tonic-gate 
126*0Sstevel@tonic-gate /* taken directly from the 'paper' I'll have a look at it later */
inverse(unsigned int xin)127*0Sstevel@tonic-gate static IDEA_INT inverse(unsigned int xin)
128*0Sstevel@tonic-gate 	{
129*0Sstevel@tonic-gate 	long n1,n2,q,r,b1,b2,t;
130*0Sstevel@tonic-gate 
131*0Sstevel@tonic-gate 	if (xin == 0)
132*0Sstevel@tonic-gate 		b2=0;
133*0Sstevel@tonic-gate 	else
134*0Sstevel@tonic-gate 		{
135*0Sstevel@tonic-gate 		n1=0x10001;
136*0Sstevel@tonic-gate 		n2=xin;
137*0Sstevel@tonic-gate 		b2=1;
138*0Sstevel@tonic-gate 		b1=0;
139*0Sstevel@tonic-gate 
140*0Sstevel@tonic-gate 		do	{
141*0Sstevel@tonic-gate 			r=(n1%n2);
142*0Sstevel@tonic-gate 			q=(n1-r)/n2;
143*0Sstevel@tonic-gate 			if (r == 0)
144*0Sstevel@tonic-gate 				{ if (b2 < 0) b2=0x10001+b2; }
145*0Sstevel@tonic-gate 			else
146*0Sstevel@tonic-gate 				{
147*0Sstevel@tonic-gate 				n1=n2;
148*0Sstevel@tonic-gate 				n2=r;
149*0Sstevel@tonic-gate 				t=b2;
150*0Sstevel@tonic-gate 				b2=b1-q*b2;
151*0Sstevel@tonic-gate 				b1=t;
152*0Sstevel@tonic-gate 				}
153*0Sstevel@tonic-gate 			} while (r != 0);
154*0Sstevel@tonic-gate 		}
155*0Sstevel@tonic-gate 	return((IDEA_INT)b2);
156*0Sstevel@tonic-gate 	}
157