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
|
/*
* IF Scheme
* (C) 1999-2007 Jack Lloyd
*
* Distributed under the terms of the Botan license
*/
#ifndef BOTAN_IF_ALGO_H__
#define BOTAN_IF_ALGO_H__
#include <botan/if_core.h>
#include <botan/x509_key.h>
#include <botan/pkcs8.h>
#include <botan/pk_ops.h>
namespace Botan {
/**
* This class represents public keys
* of integer factorization based (IF) public key schemes.
*/
class BOTAN_DLL IF_Scheme_PublicKey : public virtual Public_Key
{
public:
IF_Scheme_PublicKey(const AlgorithmIdentifier& alg_id,
const MemoryRegion<byte>& key_bits);
IF_Scheme_PublicKey(const BigInt& n, const BigInt& e) :
n(n), e(e) {}
bool check_key(RandomNumberGenerator& rng, bool) const;
AlgorithmIdentifier algorithm_identifier() const;
MemoryVector<byte> x509_subject_public_key() const;
/**
* Get n = p * q.
* @return n
*/
const BigInt& get_n() const { return n; }
/**
* Get the public exponent used by the key.
* @return the public exponent
*/
const BigInt& get_e() const { return e; }
u32bit max_input_bits() const { return (n.bits() - 1); }
protected:
IF_Scheme_PublicKey() {}
BigInt n, e;
IF_Core core;
};
/**
* This class represents public keys
* of integer factorization based (IF) public key schemes.
*/
class BOTAN_DLL IF_Scheme_PrivateKey : public virtual IF_Scheme_PublicKey,
public virtual Private_Key
{
public:
IF_Scheme_PrivateKey(RandomNumberGenerator& rng,
const BigInt& prime1, const BigInt& prime2,
const BigInt& exp, const BigInt& d_exp,
const BigInt& mod);
IF_Scheme_PrivateKey(RandomNumberGenerator& rng,
const AlgorithmIdentifier& alg_id,
const MemoryRegion<byte>& key_bits);
bool check_key(RandomNumberGenerator& rng, bool) const;
/**
* Get the first prime p.
* @return the prime p
*/
const BigInt& get_p() const { return p; }
/**
* Get the second prime q.
* @return the prime q
*/
const BigInt& get_q() const { return q; }
/**
* Get d with exp * d = 1 mod (p - 1, q - 1).
* @return d
*/
const BigInt& get_d() const { return d; }
const BigInt& get_c() const { return c; }
const BigInt& get_d1() const { return d1; }
const BigInt& get_d2() const { return d2; }
MemoryVector<byte> pkcs8_private_key() const;
protected:
IF_Scheme_PrivateKey() {}
BigInt d, p, q, d1, d2, c;
};
}
#endif
|
