/src/libressl/crypto/idea/i_cbc.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* $OpenBSD: i_cbc.c,v 1.3 2014/10/28 07:35:58 jsg 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 | | #include <openssl/idea.h> |
60 | | #include "idea_lcl.h" |
61 | | |
62 | | void idea_cbc_encrypt(const unsigned char *in, unsigned char *out, long length, |
63 | | IDEA_KEY_SCHEDULE *ks, unsigned char *iv, int encrypt) |
64 | 0 | { |
65 | 0 | unsigned long tin0,tin1; |
66 | 0 | unsigned long tout0,tout1,xor0,xor1; |
67 | 0 | long l=length; |
68 | 0 | unsigned long tin[2]; |
69 | |
|
70 | 0 | if (encrypt) |
71 | 0 | { |
72 | 0 | n2l(iv,tout0); |
73 | 0 | n2l(iv,tout1); |
74 | 0 | iv-=8; |
75 | 0 | for (l-=8; l>=0; l-=8) |
76 | 0 | { |
77 | 0 | n2l(in,tin0); |
78 | 0 | n2l(in,tin1); |
79 | 0 | tin0^=tout0; |
80 | 0 | tin1^=tout1; |
81 | 0 | tin[0]=tin0; |
82 | 0 | tin[1]=tin1; |
83 | 0 | idea_encrypt(tin,ks); |
84 | 0 | tout0=tin[0]; l2n(tout0,out); |
85 | 0 | tout1=tin[1]; l2n(tout1,out); |
86 | 0 | } |
87 | 0 | if (l != -8) |
88 | 0 | { |
89 | 0 | n2ln(in,tin0,tin1,l+8); |
90 | 0 | tin0^=tout0; |
91 | 0 | tin1^=tout1; |
92 | 0 | tin[0]=tin0; |
93 | 0 | tin[1]=tin1; |
94 | 0 | idea_encrypt(tin,ks); |
95 | 0 | tout0=tin[0]; l2n(tout0,out); |
96 | 0 | tout1=tin[1]; l2n(tout1,out); |
97 | 0 | } |
98 | 0 | l2n(tout0,iv); |
99 | 0 | l2n(tout1,iv); |
100 | 0 | } |
101 | 0 | else |
102 | 0 | { |
103 | 0 | n2l(iv,xor0); |
104 | 0 | n2l(iv,xor1); |
105 | 0 | iv-=8; |
106 | 0 | for (l-=8; l>=0; l-=8) |
107 | 0 | { |
108 | 0 | n2l(in,tin0); tin[0]=tin0; |
109 | 0 | n2l(in,tin1); tin[1]=tin1; |
110 | 0 | idea_encrypt(tin,ks); |
111 | 0 | tout0=tin[0]^xor0; |
112 | 0 | tout1=tin[1]^xor1; |
113 | 0 | l2n(tout0,out); |
114 | 0 | l2n(tout1,out); |
115 | 0 | xor0=tin0; |
116 | 0 | xor1=tin1; |
117 | 0 | } |
118 | 0 | if (l != -8) |
119 | 0 | { |
120 | 0 | n2l(in,tin0); tin[0]=tin0; |
121 | 0 | n2l(in,tin1); tin[1]=tin1; |
122 | 0 | idea_encrypt(tin,ks); |
123 | 0 | tout0=tin[0]^xor0; |
124 | 0 | tout1=tin[1]^xor1; |
125 | 0 | l2nn(tout0,tout1,out,l+8); |
126 | 0 | xor0=tin0; |
127 | 0 | xor1=tin1; |
128 | 0 | } |
129 | 0 | l2n(xor0,iv); |
130 | 0 | l2n(xor1,iv); |
131 | 0 | } |
132 | 0 | tin0=tin1=tout0=tout1=xor0=xor1=0; |
133 | 0 | tin[0]=tin[1]=0; |
134 | 0 | } |
135 | | |
136 | | void idea_encrypt(unsigned long *d, IDEA_KEY_SCHEDULE *key) |
137 | 0 | { |
138 | 0 | IDEA_INT *p; |
139 | 0 | unsigned long x1,x2,x3,x4,t0,t1,ul; |
140 | |
|
141 | 0 | x2=d[0]; |
142 | 0 | x1=(x2>>16); |
143 | 0 | x4=d[1]; |
144 | 0 | x3=(x4>>16); |
145 | |
|
146 | 0 | p= &(key->data[0][0]); |
147 | |
|
148 | 0 | E_IDEA(0); |
149 | 0 | E_IDEA(1); |
150 | 0 | E_IDEA(2); |
151 | 0 | E_IDEA(3); |
152 | 0 | E_IDEA(4); |
153 | 0 | E_IDEA(5); |
154 | 0 | E_IDEA(6); |
155 | 0 | E_IDEA(7); |
156 | |
|
157 | 0 | x1&=0xffff; |
158 | 0 | idea_mul(x1,x1,*p,ul); p++; |
159 | |
|
160 | 0 | t0= x3+ *(p++); |
161 | 0 | t1= x2+ *(p++); |
162 | |
|
163 | 0 | x4&=0xffff; |
164 | 0 | idea_mul(x4,x4,*p,ul); |
165 | |
|
166 | 0 | d[0]=(t0&0xffff)|((x1&0xffff)<<16); |
167 | 0 | d[1]=(x4&0xffff)|((t1&0xffff)<<16); |
168 | 0 | } |