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
|
/*
* Copyright (c) 2012 Red Hat Inc.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above
* copyright notice, this list of conditions and the
* following disclaimer.
* * Redistributions in binary form must reproduce the
* above copyright notice, this list of conditions and
* the following disclaimer in the documentation and/or
* other materials provided with the distribution.
* * The names of contributors to this software may not be
* used to endorse or promote products derived from this
* software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
* THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
* DAMAGE.
*
* Author: Stef Walter <stefw@gnome.org>
*/
#include "config.h"
#include "compat.h"
#include "oid.h"
#include <libtasn1.h>
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "pkix.asn.h"
#define err_if_fail(ret, msg) \
do { if ((ret) != ASN1_SUCCESS) { \
fprintf (stderr, "%s: %s\n", msg, asn1_strerror (ret)); \
exit (1); \
} } while (0)
int
main (int argc,
char *argv[])
{
char message[ASN1_MAX_ERROR_DESCRIPTION_SIZE] = { 0, };
node_asn *definitions = NULL;
node_asn *ku = NULL;
unsigned int usage = 0;
char bits[2];
char *buf;
int len;
int ret;
int i;
for (i = 1; i < argc; i++) {
if (strcmp (argv[i], "digital-signature") == 0)
usage |= P11_KU_DIGITAL_SIGNATURE;
else if (strcmp (argv[i], "non-repudiation") == 0)
usage |= P11_KU_NON_REPUDIATION;
else if (strcmp (argv[i], "key-encipherment") == 0)
usage |= P11_KU_KEY_ENCIPHERMENT;
else if (strcmp (argv[i], "data-encipherment") == 0)
usage |= P11_KU_DATA_ENCIPHERMENT;
else if (strcmp (argv[i], "key-agreement") == 0)
usage |= P11_KU_KEY_AGREEMENT;
else if (strcmp (argv[i], "key-cert-sign") == 0)
usage |= P11_KU_KEY_CERT_SIGN;
else if (strcmp (argv[i], "crl-sign") == 0)
usage |= P11_KU_CRL_SIGN;
else {
fprintf (stderr, "unsupported or unknown key usage: %s\n", argv[i]);
return 2;
}
}
ret = asn1_array2tree (pkix_asn1_tab, &definitions, message);
if (ret != ASN1_SUCCESS) {
fprintf (stderr, "definitions: %s\n", message);
return 1;
}
ret = asn1_create_element (definitions, "PKIX1.KeyUsage", &ku);
err_if_fail (ret, "KeyUsage");
bits[0] = usage & 0xff;
bits[1] = (usage >> 8) & 0xff;
ret = asn1_write_value (ku, "", bits, 9);
err_if_fail (ret, "asn1_write_value");
len = 0;
ret = asn1_der_coding (ku, "", NULL, &len, message);
assert (ret == ASN1_MEM_ERROR);
buf = malloc (len);
assert (buf != NULL);
ret = asn1_der_coding (ku, "", buf, &len, message);
if (ret != ASN1_SUCCESS) {
fprintf (stderr, "asn1_der_coding: %s\n", message);
free (buf);
return 1;
}
fwrite (buf, 1, len, stdout);
fflush (stdout);
free (buf);
asn1_delete_structure (&ku);
asn1_delete_structure (&definitions);
return 0;
}
|
