/src/libressl/crypto/modes/cbc128.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* $OpenBSD: cbc128.c,v 1.5 2022/01/22 00:45:17 inoguchi Exp $ */ |
2 | | /* ==================================================================== |
3 | | * Copyright (c) 2008 The OpenSSL Project. All rights reserved. |
4 | | * |
5 | | * Redistribution and use in source and binary forms, with or without |
6 | | * modification, are permitted provided that the following conditions |
7 | | * are met: |
8 | | * |
9 | | * 1. Redistributions of source code must retain the above copyright |
10 | | * notice, this list of conditions and the following disclaimer. |
11 | | * |
12 | | * 2. Redistributions in binary form must reproduce the above copyright |
13 | | * notice, this list of conditions and the following disclaimer in |
14 | | * the documentation and/or other materials provided with the |
15 | | * distribution. |
16 | | * |
17 | | * 3. All advertising materials mentioning features or use of this |
18 | | * software must display the following acknowledgment: |
19 | | * "This product includes software developed by the OpenSSL Project |
20 | | * for use in the OpenSSL Toolkit. (http://www.openssl.org/)" |
21 | | * |
22 | | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to |
23 | | * endorse or promote products derived from this software without |
24 | | * prior written permission. For written permission, please contact |
25 | | * openssl-core@openssl.org. |
26 | | * |
27 | | * 5. Products derived from this software may not be called "OpenSSL" |
28 | | * nor may "OpenSSL" appear in their names without prior written |
29 | | * permission of the OpenSSL Project. |
30 | | * |
31 | | * 6. Redistributions of any form whatsoever must retain the following |
32 | | * acknowledgment: |
33 | | * "This product includes software developed by the OpenSSL Project |
34 | | * for use in the OpenSSL Toolkit (http://www.openssl.org/)" |
35 | | * |
36 | | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY |
37 | | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
38 | | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
39 | | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR |
40 | | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
41 | | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
42 | | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
43 | | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
44 | | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, |
45 | | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
46 | | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED |
47 | | * OF THE POSSIBILITY OF SUCH DAMAGE. |
48 | | * ==================================================================== |
49 | | * |
50 | | */ |
51 | | |
52 | | #include <openssl/crypto.h> |
53 | | #include "modes_lcl.h" |
54 | | #include <string.h> |
55 | | |
56 | | #ifndef MODES_DEBUG |
57 | | # ifndef NDEBUG |
58 | | # define NDEBUG |
59 | | # endif |
60 | | #endif |
61 | | |
62 | | #undef STRICT_ALIGNMENT |
63 | | #ifdef __STRICT_ALIGNMENT |
64 | | #define STRICT_ALIGNMENT 1 |
65 | | #else |
66 | 0 | #define STRICT_ALIGNMENT 0 |
67 | | #endif |
68 | | |
69 | | void CRYPTO_cbc128_encrypt(const unsigned char *in, unsigned char *out, |
70 | | size_t len, const void *key, |
71 | | unsigned char ivec[16], block128_f block) |
72 | 0 | { |
73 | 0 | size_t n; |
74 | 0 | const unsigned char *iv = ivec; |
75 | |
|
76 | 0 | #if !defined(OPENSSL_SMALL_FOOTPRINT) |
77 | 0 | if (STRICT_ALIGNMENT && |
78 | 0 | ((size_t)in|(size_t)out|(size_t)ivec)%sizeof(size_t) != 0) { |
79 | 0 | while (len>=16) { |
80 | 0 | for(n=0; n<16; ++n) |
81 | 0 | out[n] = in[n] ^ iv[n]; |
82 | 0 | (*block)(out, out, key); |
83 | 0 | iv = out; |
84 | 0 | len -= 16; |
85 | 0 | in += 16; |
86 | 0 | out += 16; |
87 | 0 | } |
88 | 0 | } else { |
89 | 0 | while (len>=16) { |
90 | 0 | for(n=0; n<16; n+=sizeof(size_t)) |
91 | 0 | *(size_t*)(out+n) = |
92 | 0 | *(size_t*)(in+n) ^ *(size_t*)(iv+n); |
93 | 0 | (*block)(out, out, key); |
94 | 0 | iv = out; |
95 | 0 | len -= 16; |
96 | 0 | in += 16; |
97 | 0 | out += 16; |
98 | 0 | } |
99 | 0 | } |
100 | 0 | #endif |
101 | 0 | while (len) { |
102 | 0 | for(n=0; n<16 && n<len; ++n) |
103 | 0 | out[n] = in[n] ^ iv[n]; |
104 | 0 | for(; n<16; ++n) |
105 | 0 | out[n] = iv[n]; |
106 | 0 | (*block)(out, out, key); |
107 | 0 | iv = out; |
108 | 0 | if (len<=16) break; |
109 | 0 | len -= 16; |
110 | 0 | in += 16; |
111 | 0 | out += 16; |
112 | 0 | } |
113 | 0 | memmove(ivec,iv,16); |
114 | 0 | } |
115 | | |
116 | | void CRYPTO_cbc128_decrypt(const unsigned char *in, unsigned char *out, |
117 | | size_t len, const void *key, |
118 | | unsigned char ivec[16], block128_f block) |
119 | 0 | { |
120 | 0 | size_t n; |
121 | 0 | union { size_t t[16/sizeof(size_t)]; unsigned char c[16]; } tmp; |
122 | |
|
123 | 0 | #if !defined(OPENSSL_SMALL_FOOTPRINT) |
124 | 0 | if (in != out) { |
125 | 0 | const unsigned char *iv = ivec; |
126 | |
|
127 | 0 | if (STRICT_ALIGNMENT && |
128 | 0 | ((size_t)in|(size_t)out|(size_t)ivec)%sizeof(size_t) != 0) { |
129 | 0 | while (len>=16) { |
130 | 0 | (*block)(in, out, key); |
131 | 0 | for(n=0; n<16; ++n) |
132 | 0 | out[n] ^= iv[n]; |
133 | 0 | iv = in; |
134 | 0 | len -= 16; |
135 | 0 | in += 16; |
136 | 0 | out += 16; |
137 | 0 | } |
138 | 0 | } else if (16%sizeof(size_t) == 0) { /* always true */ |
139 | 0 | while (len>=16) { |
140 | 0 | size_t *out_t=(size_t *)out, *iv_t=(size_t *)iv; |
141 | |
|
142 | 0 | (*block)(in, out, key); |
143 | 0 | for(n=0; n<16/sizeof(size_t); n++) |
144 | 0 | out_t[n] ^= iv_t[n]; |
145 | 0 | iv = in; |
146 | 0 | len -= 16; |
147 | 0 | in += 16; |
148 | 0 | out += 16; |
149 | 0 | } |
150 | 0 | } |
151 | 0 | memmove(ivec,iv,16); |
152 | 0 | } else { |
153 | 0 | if (STRICT_ALIGNMENT && |
154 | 0 | ((size_t)in|(size_t)out|(size_t)ivec)%sizeof(size_t) != 0) { |
155 | 0 | unsigned char c; |
156 | 0 | while (len>=16) { |
157 | 0 | (*block)(in, tmp.c, key); |
158 | 0 | for(n=0; n<16; ++n) { |
159 | 0 | c = in[n]; |
160 | 0 | out[n] = tmp.c[n] ^ ivec[n]; |
161 | 0 | ivec[n] = c; |
162 | 0 | } |
163 | 0 | len -= 16; |
164 | 0 | in += 16; |
165 | 0 | out += 16; |
166 | 0 | } |
167 | 0 | } else if (16%sizeof(size_t) == 0) { /* always true */ |
168 | 0 | while (len>=16) { |
169 | 0 | size_t c, *out_t=(size_t *)out, *ivec_t=(size_t *)ivec; |
170 | 0 | const size_t *in_t=(const size_t *)in; |
171 | |
|
172 | 0 | (*block)(in, tmp.c, key); |
173 | 0 | for(n=0; n<16/sizeof(size_t); n++) { |
174 | 0 | c = in_t[n]; |
175 | 0 | out_t[n] = tmp.t[n] ^ ivec_t[n]; |
176 | 0 | ivec_t[n] = c; |
177 | 0 | } |
178 | 0 | len -= 16; |
179 | 0 | in += 16; |
180 | 0 | out += 16; |
181 | 0 | } |
182 | 0 | } |
183 | 0 | } |
184 | 0 | #endif |
185 | 0 | while (len) { |
186 | 0 | unsigned char c; |
187 | 0 | (*block)(in, tmp.c, key); |
188 | 0 | for(n=0; n<16 && n<len; ++n) { |
189 | 0 | c = in[n]; |
190 | 0 | out[n] = tmp.c[n] ^ ivec[n]; |
191 | 0 | ivec[n] = c; |
192 | 0 | } |
193 | 0 | if (len<=16) { |
194 | 0 | for (; n<16; ++n) |
195 | 0 | ivec[n] = in[n]; |
196 | 0 | break; |
197 | 0 | } |
198 | 0 | len -= 16; |
199 | 0 | in += 16; |
200 | 0 | out += 16; |
201 | 0 | } |
202 | 0 | } |