2014-06-20 20:00:00 +01:00
|
|
|
/* ====================================================================
|
|
|
|
* Copyright (c) 2008 The OpenSSL Project. All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
*
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
*
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in
|
|
|
|
* the documentation and/or other materials provided with the
|
|
|
|
* distribution.
|
|
|
|
*
|
|
|
|
* 3. All advertising materials mentioning features or use of this
|
|
|
|
* software must display the following acknowledgment:
|
|
|
|
* "This product includes software developed by the OpenSSL Project
|
|
|
|
* for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
|
|
|
|
*
|
|
|
|
* 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
|
|
|
|
* endorse or promote products derived from this software without
|
|
|
|
* prior written permission. For written permission, please contact
|
|
|
|
* openssl-core@openssl.org.
|
|
|
|
*
|
|
|
|
* 5. Products derived from this software may not be called "OpenSSL"
|
|
|
|
* nor may "OpenSSL" appear in their names without prior written
|
|
|
|
* permission of the OpenSSL Project.
|
|
|
|
*
|
|
|
|
* 6. Redistributions of any form whatsoever must retain the following
|
|
|
|
* acknowledgment:
|
|
|
|
* "This product includes software developed by the OpenSSL Project
|
|
|
|
* for use in the OpenSSL Toolkit (http://www.openssl.org/)"
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
|
|
|
|
* EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
|
|
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
|
|
|
|
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
|
|
|
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
|
|
|
|
* OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
* ==================================================================== */
|
2015-10-26 23:21:37 +00:00
|
|
|
|
2015-09-30 23:24:05 +01:00
|
|
|
#include <openssl/type_check.h>
|
2014-06-20 20:00:00 +01:00
|
|
|
|
|
|
|
#include <assert.h>
|
2015-01-31 01:08:37 +00:00
|
|
|
#include <string.h>
|
2014-06-20 20:00:00 +01:00
|
|
|
|
|
|
|
#include "internal.h"
|
|
|
|
|
|
|
|
|
2017-08-18 19:06:02 +01:00
|
|
|
// NOTE: the IV/counter CTR mode is big-endian. The code itself
|
|
|
|
// is endian-neutral.
|
2014-06-20 20:00:00 +01:00
|
|
|
|
2017-08-18 19:06:02 +01:00
|
|
|
// increment counter (128-bit int) by 1
|
2014-06-20 20:00:00 +01:00
|
|
|
static void ctr128_inc(uint8_t *counter) {
|
2016-02-29 15:14:11 +00:00
|
|
|
uint32_t n = 16, c = 1;
|
2014-06-20 20:00:00 +01:00
|
|
|
|
|
|
|
do {
|
|
|
|
--n;
|
2016-02-29 15:14:11 +00:00
|
|
|
c += counter[n];
|
|
|
|
counter[n] = (uint8_t) c;
|
|
|
|
c >>= 8;
|
2014-06-20 20:00:00 +01:00
|
|
|
} while (n);
|
|
|
|
}
|
|
|
|
|
2018-10-24 23:08:00 +01:00
|
|
|
OPENSSL_STATIC_ASSERT(16 % sizeof(size_t) == 0,
|
|
|
|
"block cannot be divided into size_t");
|
2015-09-30 23:24:05 +01:00
|
|
|
|
2017-08-18 19:06:02 +01:00
|
|
|
// The input encrypted as though 128bit counter mode is being used. The extra
|
|
|
|
// state information to record how much of the 128bit block we have used is
|
|
|
|
// contained in *num, and the encrypted counter is kept in ecount_buf. Both
|
|
|
|
// *num and ecount_buf must be initialised with zeros before the first call to
|
|
|
|
// CRYPTO_ctr128_encrypt().
|
|
|
|
//
|
|
|
|
// This algorithm assumes that the counter is in the x lower bits of the IV
|
|
|
|
// (ivec), and that the application has full control over overflow and the rest
|
|
|
|
// of the IV. This implementation takes NO responsibility for checking that
|
|
|
|
// the counter doesn't overflow into the rest of the IV when incremented.
|
2014-06-20 20:00:00 +01:00
|
|
|
void CRYPTO_ctr128_encrypt(const uint8_t *in, uint8_t *out, size_t len,
|
Fix undefined block128_f, etc., casts.
This one is a little thorny. All the various block cipher modes
functions and callbacks take a void *key. This allows them to be used
with multiple kinds of block ciphers.
However, the implementations of those callbacks are the normal typed
functions, like AES_encrypt. Those take AES_KEY *key. While, at the ABI
level, this is perfectly fine, C considers this undefined behavior.
If we wish to preserve this genericness, we could either instantiate
multiple versions of these mode functions or create wrappers of
AES_encrypt, etc., that take void *key.
The former means more code and is tedious without C++ templates (maybe
someday...). The latter would not be difficult for a compiler to
optimize out. C mistakenly allowed comparing function pointers for
equality, which means a compiler cannot replace pointers to wrapper
functions with the real thing. (That said, the performance-sensitive
bits already act in chunks, e.g. ctr128_f, so the function call overhead
shouldn't matter.)
But our only 128-bit block cipher is AES anyway, so I just switched
things to use AES_KEY throughout. AES is doing fine, and hopefully we
would have the sense not to pair a hypothetical future block cipher with
so many modes!
Change-Id: Ied3e843f0e3042a439f09e655b29847ade9d4c7d
Reviewed-on: https://boringssl-review.googlesource.com/32107
Reviewed-by: Adam Langley <agl@google.com>
2018-09-23 02:37:01 +01:00
|
|
|
const AES_KEY *key, uint8_t ivec[16],
|
2014-06-20 20:00:00 +01:00
|
|
|
uint8_t ecount_buf[16], unsigned int *num,
|
|
|
|
block128_f block) {
|
|
|
|
unsigned int n;
|
|
|
|
|
2015-05-12 04:26:40 +01:00
|
|
|
assert(key && ecount_buf && num);
|
|
|
|
assert(len == 0 || (in && out));
|
2014-06-20 20:00:00 +01:00
|
|
|
assert(*num < 16);
|
|
|
|
|
|
|
|
n = *num;
|
|
|
|
|
|
|
|
while (n && len) {
|
|
|
|
*(out++) = *(in++) ^ ecount_buf[n];
|
|
|
|
--len;
|
|
|
|
n = (n + 1) % 16;
|
|
|
|
}
|
|
|
|
while (len >= 16) {
|
|
|
|
(*block)(ivec, ecount_buf, key);
|
|
|
|
ctr128_inc(ivec);
|
2016-02-29 15:14:11 +00:00
|
|
|
for (n = 0; n < 16; n += sizeof(size_t)) {
|
2017-11-07 22:24:10 +00:00
|
|
|
store_word_le(out + n,
|
|
|
|
load_word_le(in + n) ^ load_word_le(ecount_buf + n));
|
2015-02-11 06:17:41 +00:00
|
|
|
}
|
2014-06-20 20:00:00 +01:00
|
|
|
len -= 16;
|
|
|
|
out += 16;
|
|
|
|
in += 16;
|
|
|
|
n = 0;
|
|
|
|
}
|
|
|
|
if (len) {
|
|
|
|
(*block)(ivec, ecount_buf, key);
|
|
|
|
ctr128_inc(ivec);
|
|
|
|
while (len--) {
|
|
|
|
out[n] = in[n] ^ ecount_buf[n];
|
|
|
|
++n;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
*num = n;
|
|
|
|
}
|
|
|
|
|
2017-08-18 19:06:02 +01:00
|
|
|
// increment upper 96 bits of 128-bit counter by 1
|
2014-06-20 20:00:00 +01:00
|
|
|
static void ctr96_inc(uint8_t *counter) {
|
2016-02-29 15:14:11 +00:00
|
|
|
uint32_t n = 12, c = 1;
|
2014-06-20 20:00:00 +01:00
|
|
|
|
|
|
|
do {
|
|
|
|
--n;
|
2016-02-29 15:14:11 +00:00
|
|
|
c += counter[n];
|
|
|
|
counter[n] = (uint8_t) c;
|
|
|
|
c >>= 8;
|
2014-06-20 20:00:00 +01:00
|
|
|
} while (n);
|
|
|
|
}
|
|
|
|
|
Fix undefined block128_f, etc., casts.
This one is a little thorny. All the various block cipher modes
functions and callbacks take a void *key. This allows them to be used
with multiple kinds of block ciphers.
However, the implementations of those callbacks are the normal typed
functions, like AES_encrypt. Those take AES_KEY *key. While, at the ABI
level, this is perfectly fine, C considers this undefined behavior.
If we wish to preserve this genericness, we could either instantiate
multiple versions of these mode functions or create wrappers of
AES_encrypt, etc., that take void *key.
The former means more code and is tedious without C++ templates (maybe
someday...). The latter would not be difficult for a compiler to
optimize out. C mistakenly allowed comparing function pointers for
equality, which means a compiler cannot replace pointers to wrapper
functions with the real thing. (That said, the performance-sensitive
bits already act in chunks, e.g. ctr128_f, so the function call overhead
shouldn't matter.)
But our only 128-bit block cipher is AES anyway, so I just switched
things to use AES_KEY throughout. AES is doing fine, and hopefully we
would have the sense not to pair a hypothetical future block cipher with
so many modes!
Change-Id: Ied3e843f0e3042a439f09e655b29847ade9d4c7d
Reviewed-on: https://boringssl-review.googlesource.com/32107
Reviewed-by: Adam Langley <agl@google.com>
2018-09-23 02:37:01 +01:00
|
|
|
void CRYPTO_ctr128_encrypt_ctr32(const uint8_t *in, uint8_t *out, size_t len,
|
|
|
|
const AES_KEY *key, uint8_t ivec[16],
|
|
|
|
uint8_t ecount_buf[16], unsigned int *num,
|
|
|
|
ctr128_f func) {
|
2014-06-20 20:00:00 +01:00
|
|
|
unsigned int n, ctr32;
|
|
|
|
|
2015-05-10 06:50:11 +01:00
|
|
|
assert(key && ecount_buf && num);
|
|
|
|
assert(len == 0 || (in && out));
|
2014-06-20 20:00:00 +01:00
|
|
|
assert(*num < 16);
|
|
|
|
|
|
|
|
n = *num;
|
|
|
|
|
|
|
|
while (n && len) {
|
|
|
|
*(out++) = *(in++) ^ ecount_buf[n];
|
|
|
|
--len;
|
|
|
|
n = (n + 1) % 16;
|
|
|
|
}
|
|
|
|
|
|
|
|
ctr32 = GETU32(ivec + 12);
|
|
|
|
while (len >= 16) {
|
|
|
|
size_t blocks = len / 16;
|
2017-08-18 19:06:02 +01:00
|
|
|
// 1<<28 is just a not-so-small yet not-so-large number...
|
|
|
|
// Below condition is practically never met, but it has to
|
|
|
|
// be checked for code correctness.
|
2015-02-11 06:17:41 +00:00
|
|
|
if (sizeof(size_t) > sizeof(unsigned int) && blocks > (1U << 28)) {
|
2014-06-20 20:00:00 +01:00
|
|
|
blocks = (1U << 28);
|
2015-02-11 06:17:41 +00:00
|
|
|
}
|
2017-08-18 19:06:02 +01:00
|
|
|
// As (*func) operates on 32-bit counter, caller
|
|
|
|
// has to handle overflow. 'if' below detects the
|
|
|
|
// overflow, which is then handled by limiting the
|
|
|
|
// amount of blocks to the exact overflow point...
|
2014-06-20 20:00:00 +01:00
|
|
|
ctr32 += (uint32_t)blocks;
|
|
|
|
if (ctr32 < blocks) {
|
|
|
|
blocks -= ctr32;
|
|
|
|
ctr32 = 0;
|
|
|
|
}
|
|
|
|
(*func)(in, out, blocks, key, ivec);
|
2017-08-18 19:06:02 +01:00
|
|
|
// (*func) does not update ivec, caller does:
|
2014-06-20 20:00:00 +01:00
|
|
|
PUTU32(ivec + 12, ctr32);
|
2017-08-18 19:06:02 +01:00
|
|
|
// ... overflow was detected, propogate carry.
|
2015-02-11 06:17:41 +00:00
|
|
|
if (ctr32 == 0) {
|
2014-06-20 20:00:00 +01:00
|
|
|
ctr96_inc(ivec);
|
2015-02-11 06:17:41 +00:00
|
|
|
}
|
2014-06-20 20:00:00 +01:00
|
|
|
blocks *= 16;
|
|
|
|
len -= blocks;
|
|
|
|
out += blocks;
|
|
|
|
in += blocks;
|
|
|
|
}
|
|
|
|
if (len) {
|
2016-12-13 06:07:13 +00:00
|
|
|
OPENSSL_memset(ecount_buf, 0, 16);
|
2014-06-20 20:00:00 +01:00
|
|
|
(*func)(ecount_buf, ecount_buf, 1, key, ivec);
|
|
|
|
++ctr32;
|
|
|
|
PUTU32(ivec + 12, ctr32);
|
|
|
|
if (ctr32 == 0) {
|
|
|
|
ctr96_inc(ivec);
|
|
|
|
}
|
|
|
|
while (len--) {
|
|
|
|
out[n] = in[n] ^ ecount_buf[n];
|
|
|
|
++n;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
*num = n;
|
|
|
|
}
|