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
|
/*
* Integer Factorization Scheme (RSA/RW) Operation
* (C) 1999-2009 Jack Lloyd
*
* Distributed under the terms of the Botan license
*/
#include <botan/if_op.h>
#include <botan/numthry.h>
#include <botan/async.h>
namespace Botan {
/*
* Default_IF_Op Constructor
*/
Default_IF_Op::Default_IF_Op(const BigInt& e, const BigInt& n, const BigInt&,
const BigInt& p, const BigInt& q,
const BigInt& d1, const BigInt& d2,
const BigInt& c)
{
powermod_e_n = Fixed_Exponent_Power_Mod(e, n);
if(d1 != 0 && d2 != 0 && p != 0 && q != 0)
{
powermod_d1_p = Fixed_Exponent_Power_Mod(d1, p);
powermod_d2_q = Fixed_Exponent_Power_Mod(d2, q);
reducer = Modular_Reducer(p);
this->c = c;
this->q = q;
}
}
/*
* Default IF Private Operation
*/
BigInt Default_IF_Op::private_op(const BigInt& i) const
{
if(q == 0)
throw Internal_Error("Default_IF_Op::private_op: No private key");
/*
* A simple std::bind(powermod_d1_p, i) would work instead of a
* lambda but GCC 4.5's std::result_of doesn't use decltype and gets
* confused
*/
auto future_j1 = std_async([&]() { return powermod_d1_p(i); });
BigInt j2 = powermod_d2_q(i);
BigInt j1 = future_j1.get();
j1 = reducer.reduce(sub_mul(j1, j2, c));
return mul_add(j1, q, j2);
}
}
|
