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
|
/*
* DL Scheme
* (C) 1999-2007 Jack Lloyd
*
* Distributed under the terms of the Botan license
*/
#include <botan/dl_algo.h>
#include <botan/numthry.h>
#include <botan/der_enc.h>
#include <botan/ber_dec.h>
namespace Botan {
AlgorithmIdentifier DL_Scheme_PublicKey::algorithm_identifier() const
{
return AlgorithmIdentifier(get_oid(),
group.DER_encode(group_format()));
}
MemoryVector<byte> DL_Scheme_PublicKey::x509_subject_public_key() const
{
return DER_Encoder().encode(y).get_contents();
}
DL_Scheme_PublicKey::DL_Scheme_PublicKey(const AlgorithmIdentifier& alg_id,
const MemoryRegion<byte>& key_bits,
DL_Group::Format format)
{
DataSource_Memory source(alg_id.parameters);
group.BER_decode(source, format);
BER_Decoder(key_bits).decode(y);
}
MemoryVector<byte> DL_Scheme_PrivateKey::pkcs8_private_key() const
{
return DER_Encoder().encode(x).get_contents();
}
DL_Scheme_PrivateKey::DL_Scheme_PrivateKey(const AlgorithmIdentifier& alg_id,
const MemoryRegion<byte>& key_bits,
DL_Group::Format format)
{
DataSource_Memory source(alg_id.parameters);
group.BER_decode(source, format);
BER_Decoder(key_bits).decode(x);
}
/*
* Return the PKCS #8 private key decoder
*/
PKCS8_Decoder* DL_Scheme_PrivateKey::pkcs8_decoder(RandomNumberGenerator& rng)
{
class DL_Scheme_Decoder : public PKCS8_Decoder
{
public:
void alg_id(const AlgorithmIdentifier& alg_id)
{
DataSource_Memory source(alg_id.parameters);
key->group.BER_decode(source, key->group_format());
}
void key_bits(const MemoryRegion<byte>& bits)
{
BER_Decoder(bits).decode(key->x);
key->PKCS8_load_hook(rng);
}
DL_Scheme_Decoder(DL_Scheme_PrivateKey* k, RandomNumberGenerator& r) :
key(k), rng(r) {}
private:
DL_Scheme_PrivateKey* key;
RandomNumberGenerator& rng;
};
return new DL_Scheme_Decoder(this, rng);
}
/*
* Check Public DL Parameters
*/
bool DL_Scheme_PublicKey::check_key(RandomNumberGenerator& rng,
bool strong) const
{
if(y < 2 || y >= group_p())
return false;
if(!group.verify_group(rng, strong))
return false;
return true;
}
/*
* Check DL Scheme Private Parameters
*/
bool DL_Scheme_PrivateKey::check_key(RandomNumberGenerator& rng,
bool strong) const
{
const BigInt& p = group_p();
const BigInt& g = group_g();
if(y < 2 || y >= p || x < 2 || x >= p)
return false;
if(!group.verify_group(rng, strong))
return false;
if(!strong)
return true;
if(y != power_mod(g, x, p))
return false;
return true;
}
}
|
