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
|
/*
* Montgomery Exponentiation
* (C) 1999-2007 Jack Lloyd
*
* Distributed under the terms of the Botan license
*/
#include <botan/internal/def_powm.h>
#include <botan/numthry.h>
#include <botan/internal/mp_core.h>
namespace Botan {
namespace {
/*
* Montgomery Reduction
*/
inline void montgomery_reduce(BigInt& out, MemoryRegion<word>& z_buf,
const BigInt& x_bn, u32bit x_size, word u)
{
const word* x = x_bn.data();
word* z = &z_buf[0];
u32bit z_size = z_buf.size();
bigint_monty_redc(z, z_size, x, x_size, u);
out.get_reg().set(z + x_size, x_size + 1);
}
}
/*
* Set the exponent
*/
void Montgomery_Exponentiator::set_exponent(const BigInt& exp)
{
this->exp = exp;
exp_bits = exp.bits();
}
/*
* Set the base
*/
void Montgomery_Exponentiator::set_base(const BigInt& base)
{
window_bits = Power_Mod::window_bits(exp.bits(), base.bits(), hints);
g.resize((1 << window_bits) - 1);
SecureVector<word> z(2 * (mod_words + 1));
SecureVector<word> workspace(z.size());
g[0] = (base >= modulus) ? (base % modulus) : base;
bigint_mul(&z[0], z.size(), &workspace[0],
g[0].data(), g[0].size(), g[0].sig_words(),
R2.data(), R2.size(), R2.sig_words());
montgomery_reduce(g[0], z, modulus, mod_words, mod_prime);
const BigInt& x = g[0];
const u32bit x_sig = x.sig_words();
for(u32bit j = 1; j != g.size(); ++j)
{
const BigInt& y = g[j-1];
const u32bit y_sig = y.sig_words();
zeroise(z);
bigint_mul(&z[0], z.size(), &workspace[0],
x.data(), x.size(), x_sig,
y.data(), y.size(), y_sig);
montgomery_reduce(g[j], z, modulus, mod_words, mod_prime);
}
}
/*
* Compute the result
*/
BigInt Montgomery_Exponentiator::execute() const
{
const u32bit exp_nibbles = (exp_bits + window_bits - 1) / window_bits;
BigInt x = R_mod;
SecureVector<word> z(2 * (mod_words + 1));
SecureVector<word> workspace(2 * (mod_words + 1));
for(u32bit j = exp_nibbles; j > 0; --j)
{
for(u32bit k = 0; k != window_bits; ++k)
{
zeroise(z);
bigint_sqr(&z[0], z.size(), &workspace[0],
x.data(), x.size(), x.sig_words());
montgomery_reduce(x, z, modulus, mod_words, mod_prime);
}
u32bit nibble = exp.get_substring(window_bits*(j-1), window_bits);
if(nibble)
{
const BigInt& y = g[nibble-1];
zeroise(z);
bigint_mul(&z[0], z.size(), &workspace[0],
x.data(), x.size(), x.sig_words(),
y.data(), y.size(), y.sig_words());
montgomery_reduce(x, z, modulus, mod_words, mod_prime);
}
}
zeroise(z);
z.copy(x.data(), x.size());
montgomery_reduce(x, z, modulus, mod_words, mod_prime);
return x;
}
/*
* Montgomery_Exponentiator Constructor
*/
Montgomery_Exponentiator::Montgomery_Exponentiator(const BigInt& mod,
Power_Mod::Usage_Hints hints)
{
// Montgomery reduction only works for positive odd moduli
if(!mod.is_positive() || mod.is_even())
throw Invalid_Argument("Montgomery_Exponentiator: invalid modulus");
window_bits = 0;
this->hints = hints;
modulus = mod;
mod_words = modulus.sig_words();
BigInt mod_prime_bn(BigInt::Power2, MP_WORD_BITS);
mod_prime = (mod_prime_bn - inverse_mod(modulus, mod_prime_bn)).word_at(0);
R_mod = BigInt(BigInt::Power2, MP_WORD_BITS * mod_words);
R_mod %= modulus;
R2 = BigInt(BigInt::Power2, 2 * MP_WORD_BITS * mod_words);
R2 %= modulus;
}
}
|
