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