2014-06-20 20:00:00 +01:00
|
|
|
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* This package is an SSL implementation written
|
|
|
|
* by Eric Young (eay@cryptsoft.com).
|
|
|
|
* The implementation was written so as to conform with Netscapes SSL.
|
|
|
|
*
|
|
|
|
* This library is free for commercial and non-commercial use as long as
|
|
|
|
* the following conditions are aheared to. The following conditions
|
|
|
|
* apply to all code found in this distribution, be it the RC4, RSA,
|
|
|
|
* lhash, DES, etc., code; not just the SSL code. The SSL documentation
|
|
|
|
* included with this distribution is covered by the same copyright terms
|
|
|
|
* except that the holder is Tim Hudson (tjh@cryptsoft.com).
|
|
|
|
*
|
|
|
|
* Copyright remains Eric Young's, and as such any Copyright notices in
|
|
|
|
* the code are not to be removed.
|
|
|
|
* If this package is used in a product, Eric Young should be given attribution
|
|
|
|
* as the author of the parts of the library used.
|
|
|
|
* This can be in the form of a textual message at program startup or
|
|
|
|
* in documentation (online or textual) provided with the package.
|
|
|
|
*
|
|
|
|
* 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 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 acknowledgement:
|
|
|
|
* "This product includes cryptographic software written by
|
|
|
|
* Eric Young (eay@cryptsoft.com)"
|
|
|
|
* The word 'cryptographic' can be left out if the rouines from the library
|
|
|
|
* being used are not cryptographic related :-).
|
|
|
|
* 4. If you include any Windows specific code (or a derivative thereof) from
|
|
|
|
* the apps directory (application code) you must include an acknowledgement:
|
|
|
|
* "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
|
|
|
|
* ANY EXPRESS 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 AUTHOR OR 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.
|
|
|
|
*
|
|
|
|
* The licence and distribution terms for any publically available version or
|
|
|
|
* derivative of this code cannot be changed. i.e. this code cannot simply be
|
|
|
|
* copied and put under another distribution licence
|
|
|
|
* [including the GNU Public Licence.] */
|
|
|
|
|
|
|
|
#include <openssl/bn.h>
|
|
|
|
|
2015-08-11 16:47:56 +01:00
|
|
|
#include <assert.h>
|
|
|
|
#include <limits.h>
|
2014-06-20 20:00:00 +01:00
|
|
|
|
|
|
|
#include "internal.h"
|
|
|
|
|
2017-04-28 22:47:06 +01:00
|
|
|
|
2014-06-20 20:00:00 +01:00
|
|
|
BIGNUM *BN_bin2bn(const uint8_t *in, size_t len, BIGNUM *ret) {
|
2015-08-11 17:05:02 +01:00
|
|
|
size_t num_words;
|
|
|
|
unsigned m;
|
2014-06-20 20:00:00 +01:00
|
|
|
BN_ULONG word = 0;
|
|
|
|
BIGNUM *bn = NULL;
|
|
|
|
|
|
|
|
if (ret == NULL) {
|
|
|
|
ret = bn = BN_new();
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ret == NULL) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (len == 0) {
|
2018-01-15 10:23:24 +00:00
|
|
|
ret->width = 0;
|
2014-06-20 20:00:00 +01:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
num_words = ((len - 1) / BN_BYTES) + 1;
|
|
|
|
m = (len - 1) % BN_BYTES;
|
2017-04-21 16:26:30 +01:00
|
|
|
if (!bn_wexpand(ret, num_words)) {
|
2014-06-20 20:00:00 +01:00
|
|
|
if (bn) {
|
|
|
|
BN_free(bn);
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2017-08-18 19:06:02 +01:00
|
|
|
// |bn_wexpand| must check bounds on |num_words| to write it into
|
|
|
|
// |ret->dmax|.
|
2015-08-11 17:05:02 +01:00
|
|
|
assert(num_words <= INT_MAX);
|
2018-01-15 10:23:24 +00:00
|
|
|
ret->width = (int)num_words;
|
2014-06-20 20:00:00 +01:00
|
|
|
ret->neg = 0;
|
|
|
|
|
|
|
|
while (len--) {
|
|
|
|
word = (word << 8) | *(in++);
|
|
|
|
if (m-- == 0) {
|
|
|
|
ret->d[--num_words] = word;
|
|
|
|
word = 0;
|
|
|
|
m = BN_BYTES - 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2016-12-08 04:53:22 +00:00
|
|
|
BIGNUM *BN_le2bn(const uint8_t *in, size_t len, BIGNUM *ret) {
|
|
|
|
BIGNUM *bn = NULL;
|
|
|
|
if (ret == NULL) {
|
|
|
|
bn = BN_new();
|
|
|
|
ret = bn;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ret == NULL) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (len == 0) {
|
2018-01-15 10:23:24 +00:00
|
|
|
ret->width = 0;
|
2016-12-08 04:53:22 +00:00
|
|
|
ret->neg = 0;
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2017-08-18 19:06:02 +01:00
|
|
|
// Reserve enough space in |ret|.
|
2016-12-08 04:53:22 +00:00
|
|
|
size_t num_words = ((len - 1) / BN_BYTES) + 1;
|
|
|
|
if (!bn_wexpand(ret, num_words)) {
|
|
|
|
BN_free(bn);
|
|
|
|
return NULL;
|
|
|
|
}
|
2018-01-15 10:23:24 +00:00
|
|
|
ret->width = num_words;
|
2016-12-08 04:53:22 +00:00
|
|
|
|
2017-08-18 19:06:02 +01:00
|
|
|
// Make sure the top bytes will be zeroed.
|
2016-12-08 04:53:22 +00:00
|
|
|
ret->d[num_words - 1] = 0;
|
|
|
|
|
2017-08-18 19:06:02 +01:00
|
|
|
// We only support little-endian platforms, so we can simply memcpy the
|
|
|
|
// internal representation.
|
2016-12-08 04:53:22 +00:00
|
|
|
OPENSSL_memcpy(ret->d, in, len);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2014-06-20 20:00:00 +01:00
|
|
|
size_t BN_bn2bin(const BIGNUM *in, uint8_t *out) {
|
|
|
|
size_t n, i;
|
|
|
|
BN_ULONG l;
|
|
|
|
|
|
|
|
n = i = BN_num_bytes(in);
|
|
|
|
while (i--) {
|
|
|
|
l = in->d[i / BN_BYTES];
|
|
|
|
*(out++) = (unsigned char)(l >> (8 * (i % BN_BYTES))) & 0xff;
|
|
|
|
}
|
|
|
|
return n;
|
|
|
|
}
|
|
|
|
|
2018-01-26 03:29:02 +00:00
|
|
|
static int fits_in_bytes(const uint8_t *bytes, size_t num_bytes, size_t len) {
|
|
|
|
uint8_t mask = 0;
|
|
|
|
for (size_t i = len; i < num_bytes; i++) {
|
|
|
|
mask |= bytes[i];
|
2018-01-23 04:09:16 +00:00
|
|
|
}
|
|
|
|
return mask == 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int BN_bn2le_padded(uint8_t *out, size_t len, const BIGNUM *in) {
|
2018-01-26 03:29:02 +00:00
|
|
|
const uint8_t *bytes = (const uint8_t *)in->d;
|
|
|
|
size_t num_bytes = in->width * BN_BYTES;
|
|
|
|
if (len < num_bytes) {
|
|
|
|
if (!fits_in_bytes(bytes, num_bytes, len)) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
num_bytes = len;
|
2018-01-23 04:09:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// We only support little-endian platforms, so we can simply memcpy into the
|
|
|
|
// internal representation.
|
2018-01-26 03:29:02 +00:00
|
|
|
OPENSSL_memcpy(out, bytes, num_bytes);
|
2018-01-23 04:09:16 +00:00
|
|
|
// Pad out the rest of the buffer with zeroes.
|
2018-01-26 03:29:02 +00:00
|
|
|
OPENSSL_memset(out + num_bytes, 0, len - num_bytes);
|
2018-01-23 04:09:16 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
int BN_bn2bin_padded(uint8_t *out, size_t len, const BIGNUM *in) {
|
2018-01-26 03:29:02 +00:00
|
|
|
const uint8_t *bytes = (const uint8_t *)in->d;
|
|
|
|
size_t num_bytes = in->width * BN_BYTES;
|
|
|
|
if (len < num_bytes) {
|
|
|
|
if (!fits_in_bytes(bytes, num_bytes, len)) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
num_bytes = len;
|
2014-06-20 20:00:00 +01:00
|
|
|
}
|
|
|
|
|
2018-01-26 03:29:02 +00:00
|
|
|
// We only support little-endian platforms, so we can simply write the buffer
|
|
|
|
// in reverse.
|
|
|
|
for (size_t i = 0; i < num_bytes; i++) {
|
|
|
|
out[len - i - 1] = bytes[i];
|
2014-06-20 20:00:00 +01:00
|
|
|
}
|
2018-01-26 03:29:02 +00:00
|
|
|
// Pad out the rest of the buffer with zeroes.
|
|
|
|
OPENSSL_memset(out, 0, len - num_bytes);
|
2014-06-20 20:00:00 +01:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2014-06-20 20:00:00 +01:00
|
|
|
BN_ULONG BN_get_word(const BIGNUM *bn) {
|
Add initial support for non-minimal BIGNUMs.
Thanks to Andres Erbsen for extremely helpful suggestions on how finally
plug this long-standing hole!
OpenSSL BIGNUMs are currently minimal-width, which means they cannot be
constant-time. We'll need to either excise BIGNUM from RSA and EC or
somehow fix BIGNUM. EC_SCALAR and later EC_FELEM work will excise it
from EC, but RSA's BIGNUMs are more transparent. Teaching BIGNUM to
handle non-minimal word widths is probably simpler.
The main constraint is BIGNUM's large "calculator" API surface. One
could, in theory, do arbitrary math on RSA components, which means all
public functions must tolerate non-minimal inputs. This is also useful
for EC; https://boringssl-review.googlesource.com/c/boringssl/+/24445 is
silly.
As a first step, fix comparison-type functions that were assuming
minimal BIGNUMs. I've also added bn_resize_words, but it is testing-only
until the rest of the library is fixed.
bn->top is now a loose upper bound we carry around. It does not affect
numerical results, only performance and secrecy. This is a departure
from the original meaning, and compiler help in auditing everything is
nice, so the final change in this series will rename bn->top to
bn->width. Thus these new functions are named per "width", not "top".
Looking further ahead, how are output BIGNUM widths determined? There's
three notions of correctness here:
1. Do I compute the right answer for all widths?
2. Do I handle secret data in constant time?
3. Does my memory usage not balloon absurdly?
For (1), a BIGNUM function must give the same answer for all input
widths. BN_mod_add_quick may assume |a| < |m|, but |a| may still be
wider than |m| by way of leading zeres. The simplest approach is to
write code in a width-agnostic way and rely on functions to accept all
widths. Where functions need to look at bn->d, we'll a few helper
functions to smooth over funny widths.
For (2), (1) is little cumbersome. Consider constant-time modular
addition. A sane type system would guarantee input widths match. But C
is weak here, and bifurcating the internals is a lot of work. Thus, at
least for now, I do not propose we move RSA's internal computation out
of BIGNUM. (EC_SCALAR/EC_FELEM are valuable for EC because we get to
stack-allocate, curves were already specialized, and EC only has two
types with many operations on those types. None of these apply to RSA.
We've got numbers mod n, mod p, mod q, and their corresponding
exponents, each of which is used for basically one operation.)
Instead, constant-time BIGNUM functions will output non-minimal widths.
This is trivial for BN_bin2bn or modular arithmetic. But for BN_mul,
constant-time[*] would dictate r->top = a->top + b->top. A calculator
repeatedly multiplying by one would then run out of memory. Those we'll
split into a private BN_mul_fixed for crypto, leaving BN_mul for
calculators. BN_mul is just BN_mul_fixed followed by bn_correct_top.
[*] BN_mul is not constant-time for other reasons, but that will be
fixed separately.
Bug: 232
Change-Id: Ide2258ae8c09a9a41bb71d6777908d1c27917069
Reviewed-on: https://boringssl-review.googlesource.com/25244
Reviewed-by: Adam Langley <agl@google.com>
2018-01-20 20:56:53 +00:00
|
|
|
switch (bn_minimal_width(bn)) {
|
2014-06-20 20:00:00 +01:00
|
|
|
case 0:
|
|
|
|
return 0;
|
|
|
|
case 1:
|
|
|
|
return bn->d[0];
|
|
|
|
default:
|
|
|
|
return BN_MASK2;
|
|
|
|
}
|
|
|
|
}
|
2015-08-12 01:17:28 +01:00
|
|
|
|
2016-12-16 00:28:44 +00:00
|
|
|
int BN_get_u64(const BIGNUM *bn, uint64_t *out) {
|
Add initial support for non-minimal BIGNUMs.
Thanks to Andres Erbsen for extremely helpful suggestions on how finally
plug this long-standing hole!
OpenSSL BIGNUMs are currently minimal-width, which means they cannot be
constant-time. We'll need to either excise BIGNUM from RSA and EC or
somehow fix BIGNUM. EC_SCALAR and later EC_FELEM work will excise it
from EC, but RSA's BIGNUMs are more transparent. Teaching BIGNUM to
handle non-minimal word widths is probably simpler.
The main constraint is BIGNUM's large "calculator" API surface. One
could, in theory, do arbitrary math on RSA components, which means all
public functions must tolerate non-minimal inputs. This is also useful
for EC; https://boringssl-review.googlesource.com/c/boringssl/+/24445 is
silly.
As a first step, fix comparison-type functions that were assuming
minimal BIGNUMs. I've also added bn_resize_words, but it is testing-only
until the rest of the library is fixed.
bn->top is now a loose upper bound we carry around. It does not affect
numerical results, only performance and secrecy. This is a departure
from the original meaning, and compiler help in auditing everything is
nice, so the final change in this series will rename bn->top to
bn->width. Thus these new functions are named per "width", not "top".
Looking further ahead, how are output BIGNUM widths determined? There's
three notions of correctness here:
1. Do I compute the right answer for all widths?
2. Do I handle secret data in constant time?
3. Does my memory usage not balloon absurdly?
For (1), a BIGNUM function must give the same answer for all input
widths. BN_mod_add_quick may assume |a| < |m|, but |a| may still be
wider than |m| by way of leading zeres. The simplest approach is to
write code in a width-agnostic way and rely on functions to accept all
widths. Where functions need to look at bn->d, we'll a few helper
functions to smooth over funny widths.
For (2), (1) is little cumbersome. Consider constant-time modular
addition. A sane type system would guarantee input widths match. But C
is weak here, and bifurcating the internals is a lot of work. Thus, at
least for now, I do not propose we move RSA's internal computation out
of BIGNUM. (EC_SCALAR/EC_FELEM are valuable for EC because we get to
stack-allocate, curves were already specialized, and EC only has two
types with many operations on those types. None of these apply to RSA.
We've got numbers mod n, mod p, mod q, and their corresponding
exponents, each of which is used for basically one operation.)
Instead, constant-time BIGNUM functions will output non-minimal widths.
This is trivial for BN_bin2bn or modular arithmetic. But for BN_mul,
constant-time[*] would dictate r->top = a->top + b->top. A calculator
repeatedly multiplying by one would then run out of memory. Those we'll
split into a private BN_mul_fixed for crypto, leaving BN_mul for
calculators. BN_mul is just BN_mul_fixed followed by bn_correct_top.
[*] BN_mul is not constant-time for other reasons, but that will be
fixed separately.
Bug: 232
Change-Id: Ide2258ae8c09a9a41bb71d6777908d1c27917069
Reviewed-on: https://boringssl-review.googlesource.com/25244
Reviewed-by: Adam Langley <agl@google.com>
2018-01-20 20:56:53 +00:00
|
|
|
switch (bn_minimal_width(bn)) {
|
2016-12-16 00:28:44 +00:00
|
|
|
case 0:
|
|
|
|
*out = 0;
|
|
|
|
return 1;
|
|
|
|
case 1:
|
|
|
|
*out = bn->d[0];
|
|
|
|
return 1;
|
|
|
|
#if defined(OPENSSL_32_BIT)
|
|
|
|
case 2:
|
|
|
|
*out = (uint64_t) bn->d[0] | (((uint64_t) bn->d[1]) << 32);
|
|
|
|
return 1;
|
|
|
|
#endif
|
|
|
|
default:
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|