1 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
4 * This package is an SSL implementation written
5 * by Eric Young (eay@cryptsoft.com).
6 * The implementation was written so as to conform with Netscapes SSL.
8 * This library is free for commercial and non-commercial use as long as
9 * the following conditions are aheared to. The following conditions
10 * apply to all code found in this distribution, be it the RC4, RSA,
11 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
12 * included with this distribution is covered by the same copyright terms
13 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
15 * Copyright remains Eric Young's, and as such any Copyright notices in
16 * the code are not to be removed.
17 * If this package is used in a product, Eric Young should be given attribution
18 * as the author of the parts of the library used.
19 * This can be in the form of a textual message at program startup or
20 * in documentation (online or textual) provided with the package.
22 * Redistribution and use in source and binary forms, with or without
23 * modification, are permitted provided that the following conditions
25 * 1. Redistributions of source code must retain the copyright
26 * notice, this list of conditions and the following disclaimer.
27 * 2. Redistributions in binary form must reproduce the above copyright
28 * notice, this list of conditions and the following disclaimer in the
29 * documentation and/or other materials provided with the distribution.
30 * 3. All advertising materials mentioning features or use of this software
31 * must display the following acknowledgement:
32 * "This product includes cryptographic software written by
33 * Eric Young (eay@cryptsoft.com)"
34 * The word 'cryptographic' can be left out if the rouines from the library
35 * being used are not cryptographic related :-).
36 * 4. If you include any Windows specific code (or a derivative thereof) from
37 * the apps directory (application code) you must include an acknowledgement:
38 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
40 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
41 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
42 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
43 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
44 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
45 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
46 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
48 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
49 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
52 * The licence and distribution terms for any publically available version or
53 * derivative of this code cannot be changed. i.e. this code cannot simply be
54 * copied and put under another distribution licence
55 * [including the GNU Public Licence.]
59 * The new form of this macro (check if the a*b == 0) was suggested by Colin
60 * Plumb <colin@nyx10.cs.du.edu>
62 /* Removal of the inner if from from Wei Dai 24/4/96 */
63 #define idea_mul(r,a,b,ul) \
64 ul=(unsigned long)a*b; \
67 r=(ul&0xffff)-(ul>>16); \
71 r=(-(int)a-b+1); /* assuming a or b is 0 and in range */
74 * 7/12/95 - Many thanks to Rhys Weatherley <rweather@us.oracle.com> for
75 * pointing out that I was assuming little endian byte order for all
76 * quantities what idea actually used bigendian. No where in the spec does
77 * it mention this, it is all in terms of 16 bit numbers and even the example
78 * does not use byte streams for the input example :-(. If you byte swap each
79 * pair of input, keys and iv, the functions would produce the output as the
83 /* NOTE - c is not incremented as per n2l */
84 #define n2ln(c,l1,l2,n) { \
88 case 8: l2 =((unsigned long)(*(--(c)))) ; \
89 case 7: l2|=((unsigned long)(*(--(c))))<< 8; \
90 case 6: l2|=((unsigned long)(*(--(c))))<<16; \
91 case 5: l2|=((unsigned long)(*(--(c))))<<24; \
92 case 4: l1 =((unsigned long)(*(--(c)))) ; \
93 case 3: l1|=((unsigned long)(*(--(c))))<< 8; \
94 case 2: l1|=((unsigned long)(*(--(c))))<<16; \
95 case 1: l1|=((unsigned long)(*(--(c))))<<24; \
99 /* NOTE - c is not incremented as per l2n */
100 #define l2nn(l1,l2,c,n) { \
103 case 8: *(--(c))=(unsigned char)(((l2) )&0xff); \
104 case 7: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \
105 case 6: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \
106 case 5: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \
107 case 4: *(--(c))=(unsigned char)(((l1) )&0xff); \
108 case 3: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \
109 case 2: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
110 case 1: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
115 #define n2l(c,l) (l =((unsigned long)(*((c)++)))<<24L, \
116 l|=((unsigned long)(*((c)++)))<<16L, \
117 l|=((unsigned long)(*((c)++)))<< 8L, \
118 l|=((unsigned long)(*((c)++))))
121 #define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \
122 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
123 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
124 *((c)++)=(unsigned char)(((l) )&0xff))
127 #define s2n(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \
128 *((c)++)=(unsigned char)(((l)>> 8L)&0xff))
131 #define n2s(c,l) (l =((IDEA_INT)(*((c)++)))<< 8L, \
132 l|=((IDEA_INT)(*((c)++))) )
135 #define E_IDEA(num) \
137 idea_mul(x1,x1,*p,ul); p++; \
141 idea_mul(x4,x4,*p,ul); p++; \
143 idea_mul(t0,t0,*p,ul); p++; \
144 t1=(t0+(x2^x4))&0xffff; \
145 idea_mul(t1,t1,*p,ul); p++; \
149 ul=x2^t0; /* do the swap to x3 */ \