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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
|
/*
Copyright (C) 2012-2014 Carl Hetherington <cth@carlh.net>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
/** @file src/certificates.cc
* @brief Certificate and CertificateChain classes.
*/
#include "KM_util.h"
#include "certificates.h"
#include "compose.hpp"
#include "exceptions.h"
#include "util.h"
#include "dcp_assert.h"
#include <libxml++/nodes/element.h>
#include <openssl/x509.h>
#include <openssl/ssl.h>
#include <openssl/asn1.h>
#include <openssl/err.h>
#include <boost/algorithm/string.hpp>
#include <cerrno>
#include <algorithm>
using std::list;
using std::string;
using std::ostream;
using namespace dcp;
/** @param c X509 certificate, which this object will take ownership of */
Certificate::Certificate (X509* c)
: _certificate (c)
, _public_key (0)
{
}
/** Load an X509 certificate from a string.
* @param cert String to read from.
*/
Certificate::Certificate (string cert)
: _certificate (0)
, _public_key (0)
{
read_string (cert);
}
/** Copy constructor.
* @param other Certificate to copy.
*/
Certificate::Certificate (Certificate const & other)
: _certificate (0)
, _public_key (0)
{
read_string (other.certificate (true));
}
/** Read a certificate from a string.
* @param cert String to read.
*/
void
Certificate::read_string (string cert)
{
BIO* bio = BIO_new_mem_buf (const_cast<char *> (cert.c_str ()), -1);
if (!bio) {
throw MiscError ("could not create memory BIO");
}
_certificate = PEM_read_bio_X509 (bio, 0, 0, 0);
if (!_certificate) {
throw MiscError ("could not read X509 certificate from memory BIO");
}
BIO_free (bio);
}
/** Destructor */
Certificate::~Certificate ()
{
X509_free (_certificate);
RSA_free (_public_key);
}
/** operator= for Certificate.
* @param other Certificate to read from.
*/
Certificate &
Certificate::operator= (Certificate const & other)
{
if (this == &other) {
return *this;
}
X509_free (_certificate);
_certificate = 0;
RSA_free (_public_key);
_public_key = 0;
read_string (other.certificate (true));
return *this;
}
/** Return the certificate as a string.
* @param with_begin_end true to include the -----BEGIN CERTIFICATE--- / -----END CERTIFICATE----- markers.
* @return Certificate string.
*/
string
Certificate::certificate (bool with_begin_end) const
{
DCP_ASSERT (_certificate);
BIO* bio = BIO_new (BIO_s_mem ());
if (!bio) {
throw MiscError ("could not create memory BIO");
}
PEM_write_bio_X509 (bio, _certificate);
string s;
char* data;
long int const data_length = BIO_get_mem_data (bio, &data);
for (long int i = 0; i < data_length; ++i) {
s += data[i];
}
BIO_free (bio);
if (!with_begin_end) {
boost::replace_all (s, "-----BEGIN CERTIFICATE-----\n", "");
boost::replace_all (s, "\n-----END CERTIFICATE-----\n", "");
}
return s;
}
/** @return Certificate's issuer, in the form
* dnqualifier=<dnQualififer>,CN=<commonName>,OU=<organizationalUnitName>,O=<organizationName>
* and with + signs escaped to \+
*/
string
Certificate::issuer () const
{
DCP_ASSERT (_certificate);
return name_for_xml (X509_get_issuer_name (_certificate));
}
string
Certificate::asn_to_utf8 (ASN1_STRING* s)
{
unsigned char* buf = 0;
ASN1_STRING_to_UTF8 (&buf, s);
string const u (reinterpret_cast<char *> (buf));
OPENSSL_free (buf);
return u;
}
string
Certificate::get_name_part (X509_NAME* n, int nid)
{
int p = -1;
p = X509_NAME_get_index_by_NID (n, nid, p);
DCP_ASSERT (p != -1);
return asn_to_utf8 (X509_NAME_ENTRY_get_data (X509_NAME_get_entry (n, p)));
}
string
Certificate::name_for_xml (X509_NAME* name)
{
assert (name);
BIO* bio = BIO_new (BIO_s_mem ());
if (!bio) {
throw MiscError ("could not create memory BIO");
}
X509_NAME_print_ex (bio, name, 0, XN_FLAG_RFC2253);
int n = BIO_pending (bio);
char* result = new char[n + 1];
n = BIO_read (bio, result, n);
result[n] = '\0';
BIO_free (bio);
string s = result;
delete[] result;
return s;
}
string
Certificate::subject () const
{
DCP_ASSERT (_certificate);
return name_for_xml (X509_get_subject_name (_certificate));
}
string
Certificate::common_name () const
{
DCP_ASSERT (_certificate);
return get_name_part (X509_get_subject_name (_certificate), NID_commonName);
}
string
Certificate::serial () const
{
DCP_ASSERT (_certificate);
ASN1_INTEGER* s = X509_get_serialNumber (_certificate);
DCP_ASSERT (s);
BIGNUM* b = ASN1_INTEGER_to_BN (s, 0);
char* c = BN_bn2dec (b);
BN_free (b);
string st (c);
OPENSSL_free (c);
return st;
}
string
Certificate::thumbprint () const
{
DCP_ASSERT (_certificate);
uint8_t buffer[8192];
uint8_t* p = buffer;
i2d_X509_CINF (_certificate->cert_info, &p);
unsigned int const length = p - buffer;
if (length > sizeof (buffer)) {
throw MiscError ("buffer too small to generate thumbprint");
}
SHA_CTX sha;
SHA1_Init (&sha);
SHA1_Update (&sha, buffer, length);
uint8_t digest[20];
SHA1_Final (digest, &sha);
char digest_base64[64];
return Kumu::base64encode (digest, 20, digest_base64, 64);
}
/** @return RSA public key from this Certificate. Caller must not free the returned value. */
RSA *
Certificate::public_key () const
{
DCP_ASSERT (_certificate);
if (_public_key) {
return _public_key;
}
EVP_PKEY* key = X509_get_pubkey (_certificate);
if (!key) {
throw MiscError ("could not get public key from certificate");
}
_public_key = EVP_PKEY_get1_RSA (key);
if (!_public_key) {
throw MiscError (String::compose ("could not get RSA public key (%1)", ERR_error_string (ERR_get_error(), 0)));
}
return _public_key;
}
bool
dcp::operator== (Certificate const & a, Certificate const & b)
{
return a.certificate() == b.certificate();
}
bool
dcp::operator< (Certificate const & a, Certificate const & b)
{
return a.certificate() < b.certificate();
}
ostream&
dcp::operator<< (ostream& s, Certificate const & c)
{
s << c.certificate();
return s;
}
/** @return Root certificate */
Certificate
CertificateChain::root () const
{
DCP_ASSERT (!_certificates.empty());
return _certificates.front ();
}
/** @return Leaf certificate */
Certificate
CertificateChain::leaf () const
{
DCP_ASSERT (_certificates.size() >= 2);
return _certificates.back ();
}
/** @return Certificates in order from root to leaf */
CertificateChain::List
CertificateChain::root_to_leaf () const
{
return _certificates;
}
/** @return Certificates in order from leaf to root */
CertificateChain::List
CertificateChain::leaf_to_root () const
{
List c = _certificates;
c.reverse ();
return c;
}
/** Add a certificate to the end of the chain.
* @param c Certificate to add.
*/
void
CertificateChain::add (Certificate c)
{
_certificates.push_back (c);
}
/** Remove a certificate from the chain.
* @param c Certificate to remove.
*/
void
CertificateChain::remove (Certificate c)
{
_certificates.remove (c);
}
/** Remove the i'th certificate in the list, as listed
* from root to leaf.
*/
void
CertificateChain::remove (int i)
{
List::iterator j = _certificates.begin ();
while (j != _certificates.end () && i > 0) {
--i;
++j;
}
if (j != _certificates.end ()) {
_certificates.erase (j);
}
}
/** Check to see if the chain is valid (i.e. root signs the intermediate, intermediate
* signs the leaf and so on).
* @return true if it's ok, false if not.
*/
bool
CertificateChain::valid () const
{
X509_STORE* store = X509_STORE_new ();
if (!store) {
return false;
}
for (List::const_iterator i = _certificates.begin(); i != _certificates.end(); ++i) {
List::const_iterator j = i;
++j;
if (j == _certificates.end ()) {
break;
}
if (!X509_STORE_add_cert (store, i->x509 ())) {
X509_STORE_free (store);
return false;
}
X509_STORE_CTX* ctx = X509_STORE_CTX_new ();
if (!ctx) {
X509_STORE_free (store);
return false;
}
X509_STORE_set_flags (store, 0);
if (!X509_STORE_CTX_init (ctx, store, j->x509 (), 0)) {
X509_STORE_CTX_free (ctx);
X509_STORE_free (store);
return false;
}
int v = X509_verify_cert (ctx);
X509_STORE_CTX_free (ctx);
if (v == 0) {
X509_STORE_free (store);
return false;
}
}
X509_STORE_free (store);
return true;
}
/** @return true if the chain is now in order from root to leaf,
* false if no correct order was found.
*/
bool
CertificateChain::attempt_reorder ()
{
List original = _certificates;
_certificates.sort ();
do {
if (valid ()) {
return true;
}
} while (std::next_permutation (_certificates.begin(), _certificates.end ()));
_certificates = original;
return false;
}
|