]>
Commit | Line | Data |
---|---|---|
58964a49 | 1 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) |
d02b48c6 RE |
2 | * All rights reserved. |
3 | * | |
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. | |
0f113f3e | 7 | * |
d02b48c6 RE |
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). | |
0f113f3e | 14 | * |
d02b48c6 RE |
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. | |
0f113f3e | 21 | * |
d02b48c6 RE |
22 | * Redistribution and use in source and binary forms, with or without |
23 | * modification, are permitted provided that the following conditions | |
24 | * are met: | |
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 :-). | |
0f113f3e | 36 | * 4. If you include any Windows specific code (or a derivative thereof) from |
d02b48c6 RE |
37 | * the apps directory (application code) you must include an acknowledgement: |
38 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | |
0f113f3e | 39 | * |
d02b48c6 RE |
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 | |
1921eaad | 49 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
d02b48c6 | 50 | * SUCH DAMAGE. |
0f113f3e | 51 | * |
d02b48c6 RE |
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.] | |
56 | */ | |
57 | ||
ec577822 | 58 | #include <openssl/idea.h> |
d02b48c6 RE |
59 | #include "idea_lcl.h" |
60 | ||
0f113f3e MC |
61 | void idea_cbc_encrypt(const unsigned char *in, unsigned char *out, |
62 | long length, IDEA_KEY_SCHEDULE *ks, unsigned char *iv, | |
63 | int encrypt) | |
64 | { | |
65 | register unsigned long tin0, tin1; | |
66 | register unsigned long tout0, tout1, xor0, xor1; | |
67 | register long l = length; | |
68 | unsigned long tin[2]; | |
d02b48c6 | 69 | |
0f113f3e MC |
70 | if (encrypt) { |
71 | n2l(iv, tout0); | |
72 | n2l(iv, tout1); | |
73 | iv -= 8; | |
74 | for (l -= 8; l >= 0; l -= 8) { | |
75 | n2l(in, tin0); | |
76 | n2l(in, tin1); | |
77 | tin0 ^= tout0; | |
78 | tin1 ^= tout1; | |
79 | tin[0] = tin0; | |
80 | tin[1] = tin1; | |
81 | idea_encrypt(tin, ks); | |
82 | tout0 = tin[0]; | |
83 | l2n(tout0, out); | |
84 | tout1 = tin[1]; | |
85 | l2n(tout1, out); | |
86 | } | |
87 | if (l != -8) { | |
88 | n2ln(in, tin0, tin1, l + 8); | |
89 | tin0 ^= tout0; | |
90 | tin1 ^= tout1; | |
91 | tin[0] = tin0; | |
92 | tin[1] = tin1; | |
93 | idea_encrypt(tin, ks); | |
94 | tout0 = tin[0]; | |
95 | l2n(tout0, out); | |
96 | tout1 = tin[1]; | |
97 | l2n(tout1, out); | |
98 | } | |
99 | l2n(tout0, iv); | |
100 | l2n(tout1, iv); | |
101 | } else { | |
102 | n2l(iv, xor0); | |
103 | n2l(iv, xor1); | |
104 | iv -= 8; | |
105 | for (l -= 8; l >= 0; l -= 8) { | |
106 | n2l(in, tin0); | |
107 | tin[0] = tin0; | |
108 | n2l(in, tin1); | |
109 | tin[1] = tin1; | |
110 | idea_encrypt(tin, ks); | |
111 | tout0 = tin[0] ^ xor0; | |
112 | tout1 = tin[1] ^ xor1; | |
113 | l2n(tout0, out); | |
114 | l2n(tout1, out); | |
115 | xor0 = tin0; | |
116 | xor1 = tin1; | |
117 | } | |
118 | if (l != -8) { | |
119 | n2l(in, tin0); | |
120 | tin[0] = tin0; | |
121 | n2l(in, tin1); | |
122 | tin[1] = tin1; | |
123 | idea_encrypt(tin, ks); | |
124 | tout0 = tin[0] ^ xor0; | |
125 | tout1 = tin[1] ^ xor1; | |
126 | l2nn(tout0, tout1, out, l + 8); | |
127 | xor0 = tin0; | |
128 | xor1 = tin1; | |
129 | } | |
130 | l2n(xor0, iv); | |
131 | l2n(xor1, iv); | |
132 | } | |
133 | tin0 = tin1 = tout0 = tout1 = xor0 = xor1 = 0; | |
134 | tin[0] = tin[1] = 0; | |
135 | } | |
d02b48c6 | 136 | |
6b691a5c | 137 | void idea_encrypt(unsigned long *d, IDEA_KEY_SCHEDULE *key) |
0f113f3e MC |
138 | { |
139 | register IDEA_INT *p; | |
140 | register unsigned long x1, x2, x3, x4, t0, t1, ul; | |
58964a49 | 141 | |
0f113f3e MC |
142 | x2 = d[0]; |
143 | x1 = (x2 >> 16); | |
144 | x4 = d[1]; | |
145 | x3 = (x4 >> 16); | |
58964a49 | 146 | |
0f113f3e | 147 | p = &(key->data[0][0]); |
58964a49 | 148 | |
0f113f3e MC |
149 | E_IDEA(0); |
150 | E_IDEA(1); | |
151 | E_IDEA(2); | |
152 | E_IDEA(3); | |
153 | E_IDEA(4); | |
154 | E_IDEA(5); | |
155 | E_IDEA(6); | |
156 | E_IDEA(7); | |
58964a49 | 157 | |
0f113f3e MC |
158 | x1 &= 0xffff; |
159 | idea_mul(x1, x1, *p, ul); | |
160 | p++; | |
58964a49 | 161 | |
0f113f3e MC |
162 | t0 = x3 + *(p++); |
163 | t1 = x2 + *(p++); | |
58964a49 | 164 | |
0f113f3e MC |
165 | x4 &= 0xffff; |
166 | idea_mul(x4, x4, *p, ul); | |
58964a49 | 167 | |
0f113f3e MC |
168 | d[0] = (t0 & 0xffff) | ((x1 & 0xffff) << 16); |
169 | d[1] = (x4 & 0xffff) | ((t1 & 0xffff) << 16); | |
170 | } |