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
|
/*
* Lowest Level MPI Algorithms
* (C) 1999-2010 Jack Lloyd
* 2006 Luca Piccarreta
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#include <botan/internal/mp_core.h>
#include <botan/internal/mp_asmi.h>
#include <botan/internal/mp_core.h>
#include <botan/exceptn.h>
#include <botan/mem_ops.h>
namespace Botan {
/*
* Two Operand Addition, No Carry
*/
word bigint_add2_nc(word x[], size_t x_size, const word y[], size_t y_size)
{
word carry = 0;
BOTAN_ASSERT(x_size >= y_size, "Expected sizes");
const size_t blocks = y_size - (y_size % 8);
for(size_t i = 0; i != blocks; i += 8)
carry = word8_add2(x + i, y + i, carry);
for(size_t i = blocks; i != y_size; ++i)
x[i] = word_add(x[i], y[i], &carry);
for(size_t i = y_size; i != x_size; ++i)
x[i] = word_add(x[i], 0, &carry);
return carry;
}
/*
* Three Operand Addition, No Carry
*/
word bigint_add3_nc(word z[], const word x[], size_t x_size,
const word y[], size_t y_size)
{
if(x_size < y_size)
{ return bigint_add3_nc(z, y, y_size, x, x_size); }
word carry = 0;
const size_t blocks = y_size - (y_size % 8);
for(size_t i = 0; i != blocks; i += 8)
carry = word8_add3(z + i, x + i, y + i, carry);
for(size_t i = blocks; i != y_size; ++i)
z[i] = word_add(x[i], y[i], &carry);
for(size_t i = y_size; i != x_size; ++i)
z[i] = word_add(x[i], 0, &carry);
return carry;
}
/*
* Two Operand Addition
*/
void bigint_add2(word x[], size_t x_size, const word y[], size_t y_size)
{
if(bigint_add2_nc(x, x_size, y, y_size))
x[x_size] += 1;
}
/*
* Three Operand Addition
*/
void bigint_add3(word z[], const word x[], size_t x_size,
const word y[], size_t y_size)
{
z[(x_size > y_size ? x_size : y_size)] +=
bigint_add3_nc(z, x, x_size, y, y_size);
}
/*
* Two Operand Subtraction
*/
word bigint_sub2(word x[], size_t x_size, const word y[], size_t y_size)
{
word borrow = 0;
BOTAN_ASSERT(x_size >= y_size, "Expected sizes");
const size_t blocks = y_size - (y_size % 8);
for(size_t i = 0; i != blocks; i += 8)
borrow = word8_sub2(x + i, y + i, borrow);
for(size_t i = blocks; i != y_size; ++i)
x[i] = word_sub(x[i], y[i], &borrow);
for(size_t i = y_size; i != x_size; ++i)
x[i] = word_sub(x[i], 0, &borrow);
return borrow;
}
/*
* Two Operand Subtraction x = y - x
*/
void bigint_sub2_rev(word x[], const word y[], size_t y_size)
{
word borrow = 0;
const size_t blocks = y_size - (y_size % 8);
for(size_t i = 0; i != blocks; i += 8)
borrow = word8_sub2_rev(x + i, y + i, borrow);
for(size_t i = blocks; i != y_size; ++i)
x[i] = word_sub(y[i], x[i], &borrow);
BOTAN_ASSERT(!borrow, "y must be greater than x");
}
/*
* Three Operand Subtraction
*/
word bigint_sub3(word z[], const word x[], size_t x_size,
const word y[], size_t y_size)
{
word borrow = 0;
BOTAN_ASSERT(x_size >= y_size, "Expected sizes");
const size_t blocks = y_size - (y_size % 8);
for(size_t i = 0; i != blocks; i += 8)
borrow = word8_sub3(z + i, x + i, y + i, borrow);
for(size_t i = blocks; i != y_size; ++i)
z[i] = word_sub(x[i], y[i], &borrow);
for(size_t i = y_size; i != x_size; ++i)
z[i] = word_sub(x[i], 0, &borrow);
return borrow;
}
/*
* Two Operand Linear Multiply
*/
void bigint_linmul2(word x[], size_t x_size, word y)
{
const size_t blocks = x_size - (x_size % 8);
word carry = 0;
for(size_t i = 0; i != blocks; i += 8)
carry = word8_linmul2(x + i, y, carry);
for(size_t i = blocks; i != x_size; ++i)
x[i] = word_madd2(x[i], y, &carry);
x[x_size] = carry;
}
/*
* Three Operand Linear Multiply
*/
void bigint_linmul3(word z[], const word x[], size_t x_size, word y)
{
const size_t blocks = x_size - (x_size % 8);
word carry = 0;
for(size_t i = 0; i != blocks; i += 8)
carry = word8_linmul3(z + i, x + i, y, carry);
for(size_t i = blocks; i != x_size; ++i)
z[i] = word_madd2(x[i], y, &carry);
z[x_size] = carry;
}
}
|
