1 /* $OpenBSD: idea_lcl.h,v 1.2 2014/06/12 15:49:29 deraadt Exp $ */ 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 /* The new form of this macro (check if the a*b == 0) was suggested by 60 * Colin Plumb <colin@nyx10.cs.du.edu> */ 61 /* Removal of the inner if from from Wei Dai 24/4/96 */ 62 #define idea_mul(r,a,b,ul) \ 63 ul=(unsigned long)a*b; \ 64 if (ul != 0) \ 65 { \ 66 r=(ul&0xffff)-(ul>>16); \ 67 r-=((r)>>16); \ 68 } \ 69 else \ 70 r=(-(int)a-b+1); /* assuming a or b is 0 and in range */ 71 72 /* 7/12/95 - Many thanks to Rhys Weatherley <rweather@us.oracle.com> 73 * for pointing out that I was assuming little endian 74 * byte order for all quantities what idea 75 * actually used bigendian. No where in the spec does it mention 76 * this, it is all in terms of 16 bit numbers and even the example 77 * does not use byte streams for the input example :-(. 78 * If you byte swap each pair of input, keys and iv, the functions 79 * would produce the output as the old version :-(. 80 */ 81 82 /* NOTE - c is not incremented as per n2l */ 83 #define n2ln(c,l1,l2,n) { \ 84 c+=n; \ 85 l1=l2=0; \ 86 switch (n) { \ 87 case 8: l2 =((unsigned long)(*(--(c)))) ; \ 88 case 7: l2|=((unsigned long)(*(--(c))))<< 8; \ 89 case 6: l2|=((unsigned long)(*(--(c))))<<16; \ 90 case 5: l2|=((unsigned long)(*(--(c))))<<24; \ 91 case 4: l1 =((unsigned long)(*(--(c)))) ; \ 92 case 3: l1|=((unsigned long)(*(--(c))))<< 8; \ 93 case 2: l1|=((unsigned long)(*(--(c))))<<16; \ 94 case 1: l1|=((unsigned long)(*(--(c))))<<24; \ 95 } \ 96 } 97 98 /* NOTE - c is not incremented as per l2n */ 99 #define l2nn(l1,l2,c,n) { \ 100 c+=n; \ 101 switch (n) { \ 102 case 8: *(--(c))=(unsigned char)(((l2) )&0xff); \ 103 case 7: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \ 104 case 6: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \ 105 case 5: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \ 106 case 4: *(--(c))=(unsigned char)(((l1) )&0xff); \ 107 case 3: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \ 108 case 2: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \ 109 case 1: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \ 110 } \ 111 } 112 113 #undef n2l 114 #define n2l(c,l) (l =((unsigned long)(*((c)++)))<<24L, \ 115 l|=((unsigned long)(*((c)++)))<<16L, \ 116 l|=((unsigned long)(*((c)++)))<< 8L, \ 117 l|=((unsigned long)(*((c)++)))) 118 119 #undef l2n 120 #define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \ 121 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \ 122 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ 123 *((c)++)=(unsigned char)(((l) )&0xff)) 124 125 #undef s2n 126 #define s2n(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \ 127 *((c)++)=(unsigned char)(((l)>> 8L)&0xff)) 128 129 #undef n2s 130 #define n2s(c,l) (l =((IDEA_INT)(*((c)++)))<< 8L, \ 131 l|=((IDEA_INT)(*((c)++))) ) 132 133 #define E_IDEA(num) \ 134 x1&=0xffff; \ 135 idea_mul(x1,x1,*p,ul); p++; \ 136 x2+= *(p++); \ 137 x3+= *(p++); \ 138 x4&=0xffff; \ 139 idea_mul(x4,x4,*p,ul); p++; \ 140 t0=(x1^x3)&0xffff; \ 141 idea_mul(t0,t0,*p,ul); p++; \ 142 t1=(t0+(x2^x4))&0xffff; \ 143 idea_mul(t1,t1,*p,ul); p++; \ 144 t0+=t1; \ 145 x1^=t1; \ 146 x4^=t0; \ 147 ul=x2^t0; /* do the swap to x3 */ \ 148 x2=x3^t1; \ 149 x3=ul; 150 151