idea_lcl.h revision 296465 
1/* crypto/idea/idea_lcl.h */
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/*
60 * The new form of this macro (check if the a*b == 0) was suggested by Colin
61 * Plumb <colin@nyx10.cs.du.edu>
62 */
63/* Removal of the inner if from from Wei Dai 24/4/96 */
64#define idea_mul(r,a,b,ul) \
65ul=(unsigned long)a*b; \
66if (ul != 0) \
67        { \
68        r=(ul&0xffff)-(ul>>16); \
69        r-=((r)>>16); \
70        } \
71else \
72        r=(-(int)a-b+1);        /* assuming a or b is 0 and in range */
73
74#ifdef undef
75# define idea_mul(r,a,b,ul,sl) \
76if (a == 0) r=(0x10001-b)&0xffff; \
77else if (b == 0) r=(0x10001-a)&0xffff; \
78else    { \
79        ul=(unsigned long)a*b; \
80        sl=(ul&0xffff)-(ul>>16); \
81        if (sl <= 0) sl+=0x10001; \
82        r=sl; \
83        }
84#endif
85
86/*
87 * 7/12/95 - Many thanks to Rhys Weatherley <rweather@us.oracle.com> for
88 * pointing out that I was assuming little endian byte order for all
89 * quantities what idea actually used bigendian.  No where in the spec does
90 * it mention this, it is all in terms of 16 bit numbers and even the example
91 * does not use byte streams for the input example :-(. If you byte swap each
92 * pair of input, keys and iv, the functions would produce the output as the
93 * old version :-(.
94 */
95
96/* NOTE - c is not incremented as per n2l */
97#define n2ln(c,l1,l2,n) { \
98                        c+=n; \
99                        l1=l2=0; \
100                        switch (n) { \
101                        case 8: l2 =((unsigned long)(*(--(c))))    ; \
102                        case 7: l2|=((unsigned long)(*(--(c))))<< 8; \
103                        case 6: l2|=((unsigned long)(*(--(c))))<<16; \
104                        case 5: l2|=((unsigned long)(*(--(c))))<<24; \
105                        case 4: l1 =((unsigned long)(*(--(c))))    ; \
106                        case 3: l1|=((unsigned long)(*(--(c))))<< 8; \
107                        case 2: l1|=((unsigned long)(*(--(c))))<<16; \
108                        case 1: l1|=((unsigned long)(*(--(c))))<<24; \
109                                } \
110                        }
111
112/* NOTE - c is not incremented as per l2n */
113#define l2nn(l1,l2,c,n) { \
114                        c+=n; \
115                        switch (n) { \
116                        case 8: *(--(c))=(unsigned char)(((l2)    )&0xff); \
117                        case 7: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \
118                        case 6: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \
119                        case 5: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \
120                        case 4: *(--(c))=(unsigned char)(((l1)    )&0xff); \
121                        case 3: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \
122                        case 2: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
123                        case 1: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
124                                } \
125                        }
126
127#undef n2l
128#define n2l(c,l)        (l =((unsigned long)(*((c)++)))<<24L, \
129                         l|=((unsigned long)(*((c)++)))<<16L, \
130                         l|=((unsigned long)(*((c)++)))<< 8L, \
131                         l|=((unsigned long)(*((c)++))))
132
133#undef l2n
134#define l2n(l,c)        (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \
135                         *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
136                         *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
137                         *((c)++)=(unsigned char)(((l)     )&0xff))
138
139#undef s2n
140#define s2n(l,c)        (*((c)++)=(unsigned char)(((l)     )&0xff), \
141                         *((c)++)=(unsigned char)(((l)>> 8L)&0xff))
142
143#undef n2s
144#define n2s(c,l)        (l =((IDEA_INT)(*((c)++)))<< 8L, \
145                         l|=((IDEA_INT)(*((c)++)))      )
146
147#ifdef undef
148/* NOTE - c is not incremented as per c2l */
149# define c2ln(c,l1,l2,n) { \
150                        c+=n; \
151                        l1=l2=0; \
152                        switch (n) { \
153                        case 8: l2 =((unsigned long)(*(--(c))))<<24; \
154                        case 7: l2|=((unsigned long)(*(--(c))))<<16; \
155                        case 6: l2|=((unsigned long)(*(--(c))))<< 8; \
156                        case 5: l2|=((unsigned long)(*(--(c))));     \
157                        case 4: l1 =((unsigned long)(*(--(c))))<<24; \
158                        case 3: l1|=((unsigned long)(*(--(c))))<<16; \
159                        case 2: l1|=((unsigned long)(*(--(c))))<< 8; \
160                        case 1: l1|=((unsigned long)(*(--(c))));     \
161                                } \
162                        }
163
164/* NOTE - c is not incremented as per l2c */
165# define l2cn(l1,l2,c,n) { \
166                        c+=n; \
167                        switch (n) { \
168                        case 8: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \
169                        case 7: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \
170                        case 6: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \
171                        case 5: *(--(c))=(unsigned char)(((l2)    )&0xff); \
172                        case 4: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
173                        case 3: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
174                        case 2: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \
175                        case 1: *(--(c))=(unsigned char)(((l1)    )&0xff); \
176                                } \
177                        }
178
179# undef c2s
180# define c2s(c,l)        (l =((unsigned long)(*((c)++)))    , \
181                         l|=((unsigned long)(*((c)++)))<< 8L)
182
183# undef s2c
184# define s2c(l,c)        (*((c)++)=(unsigned char)(((l)     )&0xff), \
185                         *((c)++)=(unsigned char)(((l)>> 8L)&0xff))
186
187# undef c2l
188# define c2l(c,l)        (l =((unsigned long)(*((c)++)))     , \
189                         l|=((unsigned long)(*((c)++)))<< 8L, \
190                         l|=((unsigned long)(*((c)++)))<<16L, \
191                         l|=((unsigned long)(*((c)++)))<<24L)
192
193# undef l2c
194# define l2c(l,c)        (*((c)++)=(unsigned char)(((l)     )&0xff), \
195                         *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
196                         *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
197                         *((c)++)=(unsigned char)(((l)>>24L)&0xff))
198#endif
199
200#define E_IDEA(num) \
201        x1&=0xffff; \
202        idea_mul(x1,x1,*p,ul); p++; \
203        x2+= *(p++); \
204        x3+= *(p++); \
205        x4&=0xffff; \
206        idea_mul(x4,x4,*p,ul); p++; \
207        t0=(x1^x3)&0xffff; \
208        idea_mul(t0,t0,*p,ul); p++; \
209        t1=(t0+(x2^x4))&0xffff; \
210        idea_mul(t1,t1,*p,ul); p++; \
211        t0+=t1; \
212        x1^=t1; \
213        x4^=t0; \
214        ul=x2^t0; /* do the swap to x3 */ \
215        x2=x3^t1; \
216        x3=ul;
217