2016-05-17 18:51:04 +00:00
|
|
|
/*
|
|
|
|
* Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.
|
1998-12-21 10:52:47 +00:00
|
|
|
*
|
2016-05-17 18:51:04 +00:00
|
|
|
* Licensed under the OpenSSL license (the "License"). You may not use
|
|
|
|
* this file except in compliance with the License. You can obtain a copy
|
|
|
|
* in the file LICENSE in the source distribution or at
|
|
|
|
* https://www.openssl.org/source/license.html
|
1998-12-21 10:52:47 +00:00
|
|
|
*/
|
|
|
|
|
2015-05-14 14:56:48 +00:00
|
|
|
#include "internal/cryptlib.h"
|
1998-12-21 10:52:47 +00:00
|
|
|
#include "bn_lcl.h"
|
|
|
|
|
|
|
|
/* r can == a or b */
|
2000-01-23 22:06:24 +00:00
|
|
|
int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
|
|
|
int a_neg = a->neg, ret;
|
|
|
|
|
|
|
|
bn_check_top(a);
|
|
|
|
bn_check_top(b);
|
|
|
|
|
2015-01-05 11:30:03 +00:00
|
|
|
/*-
|
|
|
|
* a + b a+b
|
|
|
|
* a + -b a-b
|
|
|
|
* -a + b b-a
|
|
|
|
* -a + -b -(a+b)
|
|
|
|
*/
|
2015-01-22 03:40:55 +00:00
|
|
|
if (a_neg ^ b->neg) {
|
|
|
|
/* only one is negative */
|
|
|
|
if (a_neg) {
|
2016-06-12 10:34:46 +00:00
|
|
|
const BIGNUM *tmp;
|
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
tmp = a;
|
|
|
|
a = b;
|
|
|
|
b = tmp;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* we are now a - b */
|
|
|
|
|
|
|
|
if (BN_ucmp(a, b) < 0) {
|
|
|
|
if (!BN_usub(r, b, a))
|
2016-06-12 10:34:46 +00:00
|
|
|
return 0;
|
2015-01-22 03:40:55 +00:00
|
|
|
r->neg = 1;
|
|
|
|
} else {
|
|
|
|
if (!BN_usub(r, a, b))
|
2016-06-12 10:34:46 +00:00
|
|
|
return 0;
|
2015-01-22 03:40:55 +00:00
|
|
|
r->neg = 0;
|
|
|
|
}
|
2016-06-12 10:34:46 +00:00
|
|
|
return 1;
|
2015-01-22 03:40:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
ret = BN_uadd(r, a, b);
|
|
|
|
r->neg = a_neg;
|
|
|
|
bn_check_top(r);
|
|
|
|
return ret;
|
|
|
|
}
|
1998-12-21 10:52:47 +00:00
|
|
|
|
2003-12-06 11:55:46 +00:00
|
|
|
/* unsigned add of b to a */
|
1999-06-04 22:23:10 +00:00
|
|
|
int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
|
|
|
int max, min, dif;
|
|
|
|
const BN_ULONG *ap, *bp;
|
|
|
|
BN_ULONG *rp, carry, t1, t2;
|
|
|
|
|
|
|
|
bn_check_top(a);
|
|
|
|
bn_check_top(b);
|
|
|
|
|
|
|
|
if (a->top < b->top) {
|
2016-06-12 10:34:46 +00:00
|
|
|
const BIGNUM *tmp;
|
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
tmp = a;
|
|
|
|
a = b;
|
|
|
|
b = tmp;
|
|
|
|
}
|
|
|
|
max = a->top;
|
|
|
|
min = b->top;
|
|
|
|
dif = max - min;
|
|
|
|
|
|
|
|
if (bn_wexpand(r, max + 1) == NULL)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
r->top = max;
|
|
|
|
|
|
|
|
ap = a->d;
|
|
|
|
bp = b->d;
|
|
|
|
rp = r->d;
|
|
|
|
|
|
|
|
carry = bn_add_words(rp, ap, bp, min);
|
|
|
|
rp += min;
|
|
|
|
ap += min;
|
2016-06-12 10:34:46 +00:00
|
|
|
|
|
|
|
while (dif) {
|
|
|
|
dif--;
|
|
|
|
t1 = *(ap++);
|
|
|
|
t2 = (t1 + carry) & BN_MASK2;
|
|
|
|
*(rp++) = t2;
|
|
|
|
carry &= (t2 == 0);
|
2015-01-22 03:40:55 +00:00
|
|
|
}
|
2016-06-12 10:34:46 +00:00
|
|
|
*rp = carry;
|
|
|
|
r->top += carry;
|
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
r->neg = 0;
|
|
|
|
bn_check_top(r);
|
|
|
|
return 1;
|
|
|
|
}
|
1998-12-21 11:00:56 +00:00
|
|
|
|
|
|
|
/* unsigned subtraction of b from a, a must be larger than b. */
|
1999-06-04 22:23:10 +00:00
|
|
|
int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
|
|
|
int max, min, dif;
|
2016-06-12 10:34:46 +00:00
|
|
|
BN_ULONG t1, t2, borrow, *rp;
|
|
|
|
const BN_ULONG *ap, *bp;
|
1998-12-21 11:00:56 +00:00
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
bn_check_top(a);
|
|
|
|
bn_check_top(b);
|
1998-12-21 11:00:56 +00:00
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
max = a->top;
|
|
|
|
min = b->top;
|
|
|
|
dif = max - min;
|
2003-12-06 11:55:46 +00:00
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
if (dif < 0) { /* hmm... should not be happening */
|
|
|
|
BNerr(BN_F_BN_USUB, BN_R_ARG2_LT_ARG3);
|
2016-06-12 10:34:46 +00:00
|
|
|
return 0;
|
2015-01-22 03:40:55 +00:00
|
|
|
}
|
1998-12-21 11:00:56 +00:00
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
if (bn_wexpand(r, max) == NULL)
|
2016-06-12 10:34:46 +00:00
|
|
|
return 0;
|
1998-12-21 11:00:56 +00:00
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
ap = a->d;
|
|
|
|
bp = b->d;
|
|
|
|
rp = r->d;
|
1998-12-21 11:00:56 +00:00
|
|
|
|
2016-06-12 10:34:46 +00:00
|
|
|
borrow = bn_sub_words(rp, ap, bp, min);
|
2015-01-22 03:40:55 +00:00
|
|
|
ap += min;
|
|
|
|
rp += min;
|
2016-06-12 10:34:46 +00:00
|
|
|
|
|
|
|
while (dif) {
|
|
|
|
dif--;
|
|
|
|
t1 = *(ap++);
|
|
|
|
t2 = (t1 - borrow) & BN_MASK2;
|
|
|
|
*(rp++) = t2;
|
|
|
|
borrow &= (t1 == 0);
|
2015-01-22 03:40:55 +00:00
|
|
|
}
|
1998-12-21 11:00:56 +00:00
|
|
|
|
2017-11-15 11:25:02 +00:00
|
|
|
while (max && *--rp == 0)
|
|
|
|
max--;
|
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
r->top = max;
|
|
|
|
r->neg = 0;
|
2017-11-15 11:25:02 +00:00
|
|
|
bn_pollute(r);
|
|
|
|
|
2016-06-12 10:34:46 +00:00
|
|
|
return 1;
|
2015-01-22 03:40:55 +00:00
|
|
|
}
|
1998-12-21 11:00:56 +00:00
|
|
|
|
1999-06-04 22:23:10 +00:00
|
|
|
int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
|
2015-01-22 03:40:55 +00:00
|
|
|
{
|
|
|
|
int max;
|
|
|
|
int add = 0, neg = 0;
|
|
|
|
|
|
|
|
bn_check_top(a);
|
|
|
|
bn_check_top(b);
|
|
|
|
|
2015-01-05 11:30:03 +00:00
|
|
|
/*-
|
|
|
|
* a - b a-b
|
|
|
|
* a - -b a+b
|
|
|
|
* -a - b -(a+b)
|
|
|
|
* -a - -b b-a
|
|
|
|
*/
|
2015-01-22 03:40:55 +00:00
|
|
|
if (a->neg) {
|
|
|
|
if (b->neg) {
|
2016-06-12 10:34:46 +00:00
|
|
|
const BIGNUM *tmp;
|
|
|
|
|
2015-01-22 03:40:55 +00:00
|
|
|
tmp = a;
|
|
|
|
a = b;
|
|
|
|
b = tmp;
|
|
|
|
} else {
|
|
|
|
add = 1;
|
|
|
|
neg = 1;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (b->neg) {
|
|
|
|
add = 1;
|
|
|
|
neg = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (add) {
|
|
|
|
if (!BN_uadd(r, a, b))
|
2016-06-12 10:34:46 +00:00
|
|
|
return 0;
|
2015-01-22 03:40:55 +00:00
|
|
|
r->neg = neg;
|
2016-06-12 10:34:46 +00:00
|
|
|
return 1;
|
2015-01-22 03:40:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* We are actually doing a - b :-) */
|
|
|
|
|
|
|
|
max = (a->top > b->top) ? a->top : b->top;
|
|
|
|
if (bn_wexpand(r, max) == NULL)
|
2016-06-12 10:34:46 +00:00
|
|
|
return 0;
|
2015-01-22 03:40:55 +00:00
|
|
|
if (BN_ucmp(a, b) < 0) {
|
|
|
|
if (!BN_usub(r, b, a))
|
2016-06-12 10:34:46 +00:00
|
|
|
return 0;
|
2015-01-22 03:40:55 +00:00
|
|
|
r->neg = 1;
|
|
|
|
} else {
|
|
|
|
if (!BN_usub(r, a, b))
|
2016-06-12 10:34:46 +00:00
|
|
|
return 0;
|
2015-01-22 03:40:55 +00:00
|
|
|
r->neg = 0;
|
|
|
|
}
|
|
|
|
bn_check_top(r);
|
2016-06-12 10:34:46 +00:00
|
|
|
return 1;
|
2015-01-22 03:40:55 +00:00
|
|
|
}
|