1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
|
/*
* BigInt Binary Operators
* (C) 1999-2007 Jack Lloyd
* 2016 Matthias Gierlings
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#include <botan/bigint.h>
#include <botan/divide.h>
#include <botan/internal/mp_core.h>
#include <botan/internal/bit_ops.h>
#include <algorithm>
namespace Botan {
namespace {
BigInt bigint_add(const BigInt& x, const word y[], size_t y_sw, BigInt::Sign y_sign)
{
const size_t x_sw = x.sig_words();
BigInt z(x.sign(), std::max(x_sw, y_sw) + 1);
if(x.sign() == y_sign)
bigint_add3(z.mutable_data(), x.data(), x_sw, y, y_sw);
else
{
int32_t relative_size = bigint_cmp(x.data(), x_sw, y, y_sw);
if(relative_size < 0)
{
bigint_sub3(z.mutable_data(), y, y_sw, x.data(), x_sw);
z.set_sign(y_sign);
}
else if(relative_size == 0)
z.set_sign(BigInt::Positive);
else if(relative_size > 0)
bigint_sub3(z.mutable_data(), x.data(), x_sw, y, y_sw);
}
return z;
}
BigInt bigint_sub(const BigInt& x, const word y[], size_t y_sw, BigInt::Sign y_sign)
{
const size_t x_sw = x.sig_words();
int32_t relative_size = bigint_cmp(x.data(), x_sw, y, y_sw);
BigInt z(BigInt::Positive, std::max(x_sw, y_sw) + 1);
if(relative_size < 0)
{
if(x.sign() == y_sign)
bigint_sub3(z.mutable_data(), y, y_sw, x.data(), x_sw);
else
bigint_add3(z.mutable_data(), x.data(), x_sw, y, y_sw);
z.set_sign(y_sign == BigInt::Positive ? BigInt::Negative : BigInt::Positive);
}
else if(relative_size == 0)
{
if(x.sign() != y_sign)
bigint_shl2(z.mutable_data(), x.data(), x_sw, 0, 1);
z.set_sign(y_sign == BigInt::Positive ? BigInt::Negative : BigInt::Positive);
}
else if(relative_size > 0)
{
if(x.sign() == y_sign)
bigint_sub3(z.mutable_data(), x.data(), x_sw, y, y_sw);
else
bigint_add3(z.mutable_data(), x.data(), x_sw, y, y_sw);
z.set_sign(x.sign());
}
return z;
}
}
BigInt operator+(const BigInt& x, const BigInt& y)
{
return bigint_add(x, y.data(), y.sig_words(), y.sign());
}
BigInt operator+(const BigInt& x, word y)
{
return bigint_add(x, &y, 1, BigInt::Positive);
}
BigInt operator+(word y, const BigInt& x)
{
return bigint_add(x, &y, 1, BigInt::Positive);
}
BigInt operator-(const BigInt& x, const BigInt& y)
{
return bigint_sub(x, y.data(), y.sig_words(), y.sign());
}
BigInt operator-(const BigInt& x, word y)
{
return bigint_sub(x, &y, 1, BigInt::Positive);
}
/*
* Multiplication Operator
*/
BigInt operator*(const BigInt& x, const BigInt& y)
{
const size_t x_sw = x.sig_words(), y_sw = y.sig_words();
BigInt z(BigInt::Positive, x.size() + y.size());
if(x_sw == 1 && y_sw)
bigint_linmul3(z.mutable_data(), y.data(), y_sw, x.word_at(0));
else if(y_sw == 1 && x_sw)
bigint_linmul3(z.mutable_data(), x.data(), x_sw, y.word_at(0));
else if(x_sw && y_sw)
{
secure_vector<word> workspace(z.size());
bigint_mul(z.mutable_data(), z.size(),
x.data(), x.size(), x_sw,
y.data(), y.size(), y_sw,
workspace.data(), workspace.size());
}
if(x_sw && y_sw && x.sign() != y.sign())
z.flip_sign();
return z;
}
/*
* Division Operator
*/
BigInt operator/(const BigInt& x, const BigInt& y)
{
if(y.sig_words() == 1 && is_power_of_2(y.word_at(0)))
return (x >> (y.bits() - 1));
BigInt q, r;
divide(x, y, q, r);
return q;
}
/*
* Modulo Operator
*/
BigInt operator%(const BigInt& n, const BigInt& mod)
{
if(mod.is_zero())
throw BigInt::DivideByZero();
if(mod.is_negative())
throw Invalid_Argument("BigInt::operator%: modulus must be > 0");
if(n.is_positive() && mod.is_positive() && n < mod)
return n;
BigInt q, r;
divide(n, mod, q, r);
return r;
}
/*
* Modulo Operator
*/
word operator%(const BigInt& n, word mod)
{
if(mod == 0)
throw BigInt::DivideByZero();
if(mod == 1)
return 0;
if(is_power_of_2(mod))
return (n.word_at(0) & (mod - 1));
word remainder = 0;
for(size_t j = n.sig_words(); j > 0; --j)
remainder = bigint_modop(remainder, n.word_at(j-1), mod);
if(remainder && n.sign() == BigInt::Negative)
return mod - remainder;
return remainder;
}
/*
* Left Shift Operator
*/
BigInt operator<<(const BigInt& x, size_t shift)
{
if(shift == 0)
return x;
const size_t shift_words = shift / BOTAN_MP_WORD_BITS,
shift_bits = shift % BOTAN_MP_WORD_BITS;
const size_t x_sw = x.sig_words();
BigInt y(x.sign(), x_sw + shift_words + (shift_bits ? 1 : 0));
bigint_shl2(y.mutable_data(), x.data(), x_sw, shift_words, shift_bits);
return y;
}
/*
* Right Shift Operator
*/
BigInt operator>>(const BigInt& x, size_t shift)
{
if(shift == 0)
return x;
if(x.bits() <= shift)
return 0;
const size_t shift_words = shift / BOTAN_MP_WORD_BITS,
shift_bits = shift % BOTAN_MP_WORD_BITS,
x_sw = x.sig_words();
BigInt y(x.sign(), x_sw - shift_words);
bigint_shr2(y.mutable_data(), x.data(), x_sw, shift_words, shift_bits);
return y;
}
}
|
