2016-05-18 02:51:04 +08:00
|
|
|
/*
|
|
|
|
* Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.
|
1998-12-21 18:52:47 +08:00
|
|
|
*
|
2018-12-06 20:22:12 +08:00
|
|
|
* Licensed under the Apache License 2.0 (the "License"). You may not use
|
2016-05-18 02:51:04 +08:00
|
|
|
* 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 18:52:47 +08:00
|
|
|
*/
|
|
|
|
|
2015-05-14 22:56:48 +08:00
|
|
|
#include "internal/cryptlib.h"
|
1998-12-21 18:52:47 +08:00
|
|
|
#include "bn_lcl.h"
|
|
|
|
|
2000-02-03 09:26:07 +08:00
|
|
|
BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w)
|
2015-01-22 11:40:55 +08:00
|
|
|
{
|
1998-12-21 18:52:47 +08:00
|
|
|
#ifndef BN_LLONG
|
2015-01-22 11:40:55 +08:00
|
|
|
BN_ULONG ret = 0;
|
1998-12-21 18:52:47 +08:00
|
|
|
#else
|
2015-01-22 11:40:55 +08:00
|
|
|
BN_ULLONG ret = 0;
|
1998-12-21 18:52:47 +08:00
|
|
|
#endif
|
2015-01-22 11:40:55 +08:00
|
|
|
int i;
|
1998-12-21 18:52:47 +08:00
|
|
|
|
2015-01-22 11:40:55 +08:00
|
|
|
if (w == 0)
|
|
|
|
return (BN_ULONG)-1;
|
2005-07-26 06:57:54 +08:00
|
|
|
|
2016-05-31 18:28:14 +08:00
|
|
|
#ifndef BN_LLONG
|
|
|
|
/*
|
|
|
|
* If |w| is too long and we don't have BN_ULLONG then we need to fall
|
|
|
|
* back to using BN_div_word
|
|
|
|
*/
|
|
|
|
if (w > ((BN_ULONG)1 << BN_BITS4)) {
|
|
|
|
BIGNUM *tmp = BN_dup(a);
|
|
|
|
if (tmp == NULL)
|
|
|
|
return (BN_ULONG)-1;
|
|
|
|
|
|
|
|
ret = BN_div_word(tmp, w);
|
|
|
|
BN_free(tmp);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2015-01-22 11:40:55 +08:00
|
|
|
bn_check_top(a);
|
|
|
|
w &= BN_MASK2;
|
|
|
|
for (i = a->top - 1; i >= 0; i--) {
|
1998-12-21 18:52:47 +08:00
|
|
|
#ifndef BN_LLONG
|
2016-05-31 18:28:14 +08:00
|
|
|
/*
|
|
|
|
* We can assume here that | w <= ((BN_ULONG)1 << BN_BITS4) | and so
|
|
|
|
* | ret < ((BN_ULONG)1 << BN_BITS4) | and therefore the shifts here are
|
|
|
|
* safe and will not overflow
|
|
|
|
*/
|
2015-01-22 11:40:55 +08:00
|
|
|
ret = ((ret << BN_BITS4) | ((a->d[i] >> BN_BITS4) & BN_MASK2l)) % w;
|
|
|
|
ret = ((ret << BN_BITS4) | (a->d[i] & BN_MASK2l)) % w;
|
1998-12-21 18:52:47 +08:00
|
|
|
#else
|
2015-01-22 11:40:55 +08:00
|
|
|
ret = (BN_ULLONG) (((ret << (BN_ULLONG) BN_BITS2) | a->d[i]) %
|
|
|
|
(BN_ULLONG) w);
|
1998-12-21 18:52:47 +08:00
|
|
|
#endif
|
2015-01-22 11:40:55 +08:00
|
|
|
}
|
2017-10-17 22:04:09 +08:00
|
|
|
return (BN_ULONG)ret;
|
2015-01-22 11:40:55 +08:00
|
|
|
}
|
1998-12-21 18:52:47 +08:00
|
|
|
|
1999-04-20 05:31:43 +08:00
|
|
|
BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w)
|
2015-01-22 11:40:55 +08:00
|
|
|
{
|
|
|
|
BN_ULONG ret = 0;
|
|
|
|
int i, j;
|
|
|
|
|
|
|
|
bn_check_top(a);
|
|
|
|
w &= BN_MASK2;
|
|
|
|
|
|
|
|
if (!w)
|
|
|
|
/* actually this an error (division by zero) */
|
|
|
|
return (BN_ULONG)-1;
|
|
|
|
if (a->top == 0)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* normalize input (so bn_div_words doesn't complain) */
|
|
|
|
j = BN_BITS2 - BN_num_bits_word(w);
|
|
|
|
w <<= j;
|
|
|
|
if (!BN_lshift(a, a, j))
|
|
|
|
return (BN_ULONG)-1;
|
|
|
|
|
|
|
|
for (i = a->top - 1; i >= 0; i--) {
|
|
|
|
BN_ULONG l, d;
|
|
|
|
|
|
|
|
l = a->d[i];
|
|
|
|
d = bn_div_words(ret, l, w);
|
|
|
|
ret = (l - ((d * w) & BN_MASK2)) & BN_MASK2;
|
|
|
|
a->d[i] = d;
|
|
|
|
}
|
|
|
|
if ((a->top > 0) && (a->d[a->top - 1] == 0))
|
|
|
|
a->top--;
|
|
|
|
ret >>= j;
|
2016-10-06 23:04:56 +08:00
|
|
|
if (!a->top)
|
|
|
|
a->neg = 0; /* don't allow negative zero */
|
2015-01-22 11:40:55 +08:00
|
|
|
bn_check_top(a);
|
2017-10-17 22:04:09 +08:00
|
|
|
return ret;
|
2015-01-22 11:40:55 +08:00
|
|
|
}
|
1998-12-21 18:52:47 +08:00
|
|
|
|
1999-04-20 05:31:43 +08:00
|
|
|
int BN_add_word(BIGNUM *a, BN_ULONG w)
|
2015-01-22 11:40:55 +08:00
|
|
|
{
|
|
|
|
BN_ULONG l;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
bn_check_top(a);
|
|
|
|
w &= BN_MASK2;
|
|
|
|
|
|
|
|
/* degenerate case: w is zero */
|
|
|
|
if (!w)
|
|
|
|
return 1;
|
|
|
|
/* degenerate case: a is zero */
|
|
|
|
if (BN_is_zero(a))
|
|
|
|
return BN_set_word(a, w);
|
|
|
|
/* handle 'a' when negative */
|
|
|
|
if (a->neg) {
|
|
|
|
a->neg = 0;
|
|
|
|
i = BN_sub_word(a, w);
|
|
|
|
if (!BN_is_zero(a))
|
|
|
|
a->neg = !(a->neg);
|
2017-10-17 22:04:09 +08:00
|
|
|
return i;
|
2015-01-22 11:40:55 +08:00
|
|
|
}
|
|
|
|
for (i = 0; w != 0 && i < a->top; i++) {
|
|
|
|
a->d[i] = l = (a->d[i] + w) & BN_MASK2;
|
|
|
|
w = (w > l) ? 1 : 0;
|
|
|
|
}
|
|
|
|
if (w && i == a->top) {
|
|
|
|
if (bn_wexpand(a, a->top + 1) == NULL)
|
|
|
|
return 0;
|
|
|
|
a->top++;
|
|
|
|
a->d[i] = w;
|
|
|
|
}
|
|
|
|
bn_check_top(a);
|
2017-10-09 19:05:58 +08:00
|
|
|
return 1;
|
2015-01-22 11:40:55 +08:00
|
|
|
}
|
1998-12-21 18:52:47 +08:00
|
|
|
|
1999-04-20 05:31:43 +08:00
|
|
|
int BN_sub_word(BIGNUM *a, BN_ULONG w)
|
2015-01-22 11:40:55 +08:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
bn_check_top(a);
|
|
|
|
w &= BN_MASK2;
|
|
|
|
|
|
|
|
/* degenerate case: w is zero */
|
|
|
|
if (!w)
|
|
|
|
return 1;
|
|
|
|
/* degenerate case: a is zero */
|
|
|
|
if (BN_is_zero(a)) {
|
|
|
|
i = BN_set_word(a, w);
|
|
|
|
if (i != 0)
|
|
|
|
BN_set_negative(a, 1);
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
/* handle 'a' when negative */
|
|
|
|
if (a->neg) {
|
|
|
|
a->neg = 0;
|
|
|
|
i = BN_add_word(a, w);
|
|
|
|
a->neg = 1;
|
2017-10-17 22:04:09 +08:00
|
|
|
return i;
|
2015-01-22 11:40:55 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
if ((a->top == 1) && (a->d[0] < w)) {
|
|
|
|
a->d[0] = w - a->d[0];
|
|
|
|
a->neg = 1;
|
2017-10-09 19:05:58 +08:00
|
|
|
return 1;
|
2015-01-22 11:40:55 +08:00
|
|
|
}
|
|
|
|
i = 0;
|
|
|
|
for (;;) {
|
|
|
|
if (a->d[i] >= w) {
|
|
|
|
a->d[i] -= w;
|
|
|
|
break;
|
|
|
|
} else {
|
|
|
|
a->d[i] = (a->d[i] - w) & BN_MASK2;
|
|
|
|
i++;
|
|
|
|
w = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if ((a->d[i] == 0) && (i == (a->top - 1)))
|
|
|
|
a->top--;
|
|
|
|
bn_check_top(a);
|
2017-10-09 19:05:58 +08:00
|
|
|
return 1;
|
2015-01-22 11:40:55 +08:00
|
|
|
}
|
1998-12-21 18:52:47 +08:00
|
|
|
|
1999-04-20 05:31:43 +08:00
|
|
|
int BN_mul_word(BIGNUM *a, BN_ULONG w)
|
2015-01-22 11:40:55 +08:00
|
|
|
{
|
|
|
|
BN_ULONG ll;
|
|
|
|
|
|
|
|
bn_check_top(a);
|
|
|
|
w &= BN_MASK2;
|
|
|
|
if (a->top) {
|
|
|
|
if (w == 0)
|
|
|
|
BN_zero(a);
|
|
|
|
else {
|
|
|
|
ll = bn_mul_words(a->d, a->d, a->top, w);
|
|
|
|
if (ll) {
|
|
|
|
if (bn_wexpand(a, a->top + 1) == NULL)
|
2017-10-17 22:04:09 +08:00
|
|
|
return 0;
|
2015-01-22 11:40:55 +08:00
|
|
|
a->d[a->top++] = ll;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
bn_check_top(a);
|
2017-10-09 19:05:58 +08:00
|
|
|
return 1;
|
2015-01-22 11:40:55 +08:00
|
|
|
}
|