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
|
/*
* ElGamal Operations
* (C) 1999-2009 Jack Lloyd
*
* Distributed under the terms of the Botan license
*/
#include <botan/elg_op.h>
#include <future>
namespace Botan {
/*
* Default_ELG_Op Constructor
*/
Default_ELG_Op::Default_ELG_Op(const DL_Group& group, const BigInt& y,
const BigInt& x) : p(group.get_p())
{
powermod_g_p = Fixed_Base_Power_Mod(group.get_g(), p);
powermod_y_p = Fixed_Base_Power_Mod(y, p);
mod_p = Modular_Reducer(p);
if(x != 0)
powermod_x_p = Fixed_Exponent_Power_Mod(x, p);
}
/*
* Default ElGamal Encrypt Operation
*/
SecureVector<byte> Default_ELG_Op::encrypt(const byte in[], u32bit length,
const BigInt& k) const
{
BigInt m(in, length);
if(m >= p)
throw Invalid_Argument("Default_ELG_Op::encrypt: Input is too large");
auto future_a = std::async(std::launch::async, powermod_g_p, k);
BigInt b = mod_p.multiply(m, powermod_y_p(k));
BigInt a = future_a.get();
SecureVector<byte> output(2*p.bytes());
a.binary_encode(output + (p.bytes() - a.bytes()));
b.binary_encode(output + output.size() / 2 + (p.bytes() - b.bytes()));
return output;
}
/*
* Default ElGamal Decrypt Operation
*/
BigInt Default_ELG_Op::decrypt(const BigInt& a, const BigInt& b) const
{
if(a >= p || b >= p)
throw Invalid_Argument("Default_ELG_Op: Invalid message");
return mod_p.multiply(b, inverse_mod(powermod_x_p(a), p));
}
}
|
