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
|
/*
* IF Scheme
* (C) 1999-2007 Jack Lloyd
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#include <botan/if_algo.h>
#include <botan/numthry.h>
#include <botan/workfactor.h>
#include <botan/der_enc.h>
#include <botan/ber_dec.h>
namespace Botan {
size_t IF_Scheme_PublicKey::estimated_strength() const
{
return dl_work_factor(n.bits());
}
AlgorithmIdentifier IF_Scheme_PublicKey::algorithm_identifier() const
{
return AlgorithmIdentifier(get_oid(),
AlgorithmIdentifier::USE_NULL_PARAM);
}
std::vector<byte> IF_Scheme_PublicKey::x509_subject_public_key() const
{
return DER_Encoder()
.start_cons(SEQUENCE)
.encode(n)
.encode(e)
.end_cons()
.get_contents_unlocked();
}
IF_Scheme_PublicKey::IF_Scheme_PublicKey(const AlgorithmIdentifier&,
const secure_vector<byte>& key_bits)
{
BER_Decoder(key_bits)
.start_cons(SEQUENCE)
.decode(n)
.decode(e)
.verify_end()
.end_cons();
}
/*
* Check IF Scheme Public Parameters
*/
bool IF_Scheme_PublicKey::check_key(RandomNumberGenerator&, bool) const
{
if(n < 35 || n.is_even() || e < 2)
return false;
return true;
}
secure_vector<byte> IF_Scheme_PrivateKey::pkcs8_private_key() const
{
return DER_Encoder()
.start_cons(SEQUENCE)
.encode(static_cast<size_t>(0))
.encode(n)
.encode(e)
.encode(d)
.encode(p)
.encode(q)
.encode(d1)
.encode(d2)
.encode(c)
.end_cons()
.get_contents();
}
IF_Scheme_PrivateKey::IF_Scheme_PrivateKey(RandomNumberGenerator& rng,
const AlgorithmIdentifier&,
const secure_vector<byte>& key_bits)
{
BER_Decoder(key_bits)
.start_cons(SEQUENCE)
.decode_and_check<size_t>(0, "Unknown PKCS #1 key format version")
.decode(n)
.decode(e)
.decode(d)
.decode(p)
.decode(q)
.decode(d1)
.decode(d2)
.decode(c)
.end_cons();
load_check(rng);
}
IF_Scheme_PrivateKey::IF_Scheme_PrivateKey(RandomNumberGenerator& rng,
const BigInt& prime1,
const BigInt& prime2,
const BigInt& exp,
const BigInt& d_exp,
const BigInt& mod)
{
p = prime1;
q = prime2;
e = exp;
d = d_exp;
n = mod.is_nonzero() ? mod : p * q;
if(d == 0)
{
BigInt inv_for_d = lcm(p - 1, q - 1);
if(e.is_even())
inv_for_d >>= 1;
d = inverse_mod(e, inv_for_d);
}
d1 = d % (p - 1);
d2 = d % (q - 1);
c = inverse_mod(q, p);
load_check(rng);
}
/*
* Check IF Scheme Private Parameters
*/
bool IF_Scheme_PrivateKey::check_key(RandomNumberGenerator& rng,
bool strong) const
{
if(n < 35 || n.is_even() || e < 2 || d < 2 || p < 3 || q < 3 || p*q != n)
return false;
if(d1 != d % (p - 1) || d2 != d % (q - 1) || c != inverse_mod(q, p))
return false;
const size_t prob = (strong) ? 56 : 12;
if(!is_prime(p, rng, prob) || !is_prime(q, rng, prob))
return false;
return true;
}
}
|
