• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /* ====================================================================
2  * Copyright (c) 2008 The OpenSSL Project.  All rights reserved.
3  *
4  * Redistribution and use in source and binary forms, with or without
5  * modification, are permitted provided that the following conditions
6  * are met:
7  *
8  * 1. Redistributions of source code must retain the above copyright
9  *    notice, this list of conditions and the following disclaimer.
10  *
11  * 2. Redistributions in binary form must reproduce the above copyright
12  *    notice, this list of conditions and the following disclaimer in
13  *    the documentation and/or other materials provided with the
14  *    distribution.
15  *
16  * 3. All advertising materials mentioning features or use of this
17  *    software must display the following acknowledgment:
18  *    "This product includes software developed by the OpenSSL Project
19  *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
20  *
21  * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
22  *    endorse or promote products derived from this software without
23  *    prior written permission. For written permission, please contact
24  *    openssl-core@openssl.org.
25  *
26  * 5. Products derived from this software may not be called "OpenSSL"
27  *    nor may "OpenSSL" appear in their names without prior written
28  *    permission of the OpenSSL Project.
29  *
30  * 6. Redistributions of any form whatsoever must retain the following
31  *    acknowledgment:
32  *    "This product includes software developed by the OpenSSL Project
33  *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
34  *
35  * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
36  * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
37  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
38  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
39  * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
40  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
41  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
42  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
43  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
44  * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
45  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
46  * OF THE POSSIBILITY OF SUCH DAMAGE.
47  * ==================================================================== */
48 
49 #include <assert.h>
50 #include <string.h>
51 
52 #include <openssl/type_check.h>
53 
54 #include "internal.h"
55 
56 
CRYPTO_cbc128_encrypt(const uint8_t * in,uint8_t * out,size_t len,const AES_KEY * key,uint8_t ivec[16],block128_f block)57 void CRYPTO_cbc128_encrypt(const uint8_t *in, uint8_t *out, size_t len,
58                            const AES_KEY *key, uint8_t ivec[16],
59                            block128_f block) {
60   size_t n;
61   const uint8_t *iv = ivec;
62 
63   assert(key != NULL && ivec != NULL);
64   assert(len == 0 || (in != NULL && out != NULL));
65 
66   while (len >= 16) {
67     for (n = 0; n < 16; n += sizeof(size_t)) {
68       store_word_le(out + n, load_word_le(in + n) ^ load_word_le(iv + n));
69     }
70     (*block)(out, out, key);
71     iv = out;
72     len -= 16;
73     in += 16;
74     out += 16;
75   }
76 
77   while (len) {
78     for (n = 0; n < 16 && n < len; ++n) {
79       out[n] = in[n] ^ iv[n];
80     }
81     for (; n < 16; ++n) {
82       out[n] = iv[n];
83     }
84     (*block)(out, out, key);
85     iv = out;
86     if (len <= 16) {
87       break;
88     }
89     len -= 16;
90     in += 16;
91     out += 16;
92   }
93 
94   OPENSSL_memcpy(ivec, iv, 16);
95 }
96 
CRYPTO_cbc128_decrypt(const uint8_t * in,uint8_t * out,size_t len,const AES_KEY * key,uint8_t ivec[16],block128_f block)97 void CRYPTO_cbc128_decrypt(const uint8_t *in, uint8_t *out, size_t len,
98                            const AES_KEY *key, uint8_t ivec[16],
99                            block128_f block) {
100   size_t n;
101   union {
102     size_t t[16 / sizeof(size_t)];
103     uint8_t c[16];
104   } tmp;
105 
106   assert(key != NULL && ivec != NULL);
107   assert(len == 0 || (in != NULL && out != NULL));
108 
109   const uintptr_t inptr = (uintptr_t) in;
110   const uintptr_t outptr = (uintptr_t) out;
111   // If |in| and |out| alias, |in| must be ahead.
112   assert(inptr >= outptr || inptr + len <= outptr);
113 
114   if ((inptr >= 32 && outptr <= inptr - 32) || inptr < outptr) {
115     // If |out| is at least two blocks behind |in| or completely disjoint, there
116     // is no need to decrypt to a temporary block.
117     OPENSSL_STATIC_ASSERT(16 % sizeof(size_t) == 0,
118                           "block cannot be evenly divided into words");
119     const uint8_t *iv = ivec;
120     while (len >= 16) {
121       (*block)(in, out, key);
122       for (n = 0; n < 16; n += sizeof(size_t)) {
123         store_word_le(out + n, load_word_le(out + n) ^ load_word_le(iv + n));
124       }
125       iv = in;
126       len -= 16;
127       in += 16;
128       out += 16;
129     }
130     OPENSSL_memcpy(ivec, iv, 16);
131   } else {
132     OPENSSL_STATIC_ASSERT(16 % sizeof(size_t) == 0,
133                           "block cannot be evenly divided into words");
134 
135     while (len >= 16) {
136       (*block)(in, tmp.c, key);
137       for (n = 0; n < 16; n += sizeof(size_t)) {
138         size_t c = load_word_le(in + n);
139         store_word_le(out + n,
140                       tmp.t[n / sizeof(size_t)] ^ load_word_le(ivec + n));
141         store_word_le(ivec + n, c);
142       }
143       len -= 16;
144       in += 16;
145       out += 16;
146     }
147   }
148 
149   while (len) {
150     uint8_t c;
151     (*block)(in, tmp.c, key);
152     for (n = 0; n < 16 && n < len; ++n) {
153       c = in[n];
154       out[n] = tmp.c[n] ^ ivec[n];
155       ivec[n] = c;
156     }
157     if (len <= 16) {
158       for (; n < 16; ++n) {
159         ivec[n] = in[n];
160       }
161       break;
162     }
163     len -= 16;
164     in += 16;
165     out += 16;
166   }
167 }
168