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
|
/*
* Copyright 2015 The Chromium OS Authors. All rights reserved.
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#define OPENSSL_NO_SHA
#include <openssl/pem.h>
#include "2sysincludes.h"
#include "2common.h"
#include "2id.h"
#include "2rsa.h"
#include "util_misc.h"
#include "vb2_common.h"
#include "vb2_struct.h"
#include "host_common.h"
#include "host_key2.h"
#include "host_misc2.h"
#include "file_type.h"
#include "futility.h"
#include "traversal.h"
enum futil_file_type ft_recognize_vb2_key(uint8_t *buf, uint32_t len)
{
struct vb2_public_key pubkey;
struct vb2_private_key *privkey = 0;
/* The pubkey points into buf, so nothing to free */
if (VB2_SUCCESS == vb2_unpack_key(&pubkey, buf, len))
return FILE_TYPE_VB2_PUBKEY;
/* The private key unpacks into new structs */
if (VB2_SUCCESS == vb2_private_key_unpack(&privkey, buf, len)) {
vb2_private_key_free(privkey);
return FILE_TYPE_VB2_PRIVKEY;
}
return FILE_TYPE_UNKNOWN;
}
static inline void vb2_print_bytes(const void *ptr, uint32_t len)
{
const uint8_t *buf = (const uint8_t *)ptr;
int i;
for (i = 0; i < len; i++)
printf("%02x", *buf++);
}
static uint8_t *vb2_public_key_sha1sum(struct vb2_public_key *key)
{
struct vb2_packed_key *pkey;
uint8_t *digest;
if (vb2_public_key_pack(&pkey, key))
return 0;
digest = DigestBuf((uint8_t *)pkey + pkey->key_offset,
pkey->key_size, SHA1_DIGEST_ALGORITHM);
free(pkey);
return digest;
}
int futil_cb_show_vb2_pubkey(struct futil_traverse_state_s *state)
{
struct vb2_public_key key;
const struct vb2_text_vs_enum *entry;
uint8_t *sha1sum;
/* The key's members will point into the state buffer after this. Don't
* free anything. */
if (VB2_SUCCESS != vb2_unpack_key(&key, state->my_area->buf,
state->my_area->len))
return 1;
sha1sum = vb2_public_key_sha1sum(&key);
printf("Public Key file: %s\n", state->in_filename);
printf(" Vboot API: 2.1\n");
printf(" Desc: \"%s\"\n", key.desc);
entry = vb2_lookup_by_num(vb2_text_vs_sig, key.sig_alg);
printf(" Signature Algorithm: %d %s\n", key.sig_alg,
entry ? entry->name : "(invalid)");
entry = vb2_lookup_by_num(vb2_text_vs_hash, key.hash_alg);
printf(" Hash Algorithm: %d %s\n", key.hash_alg,
entry ? entry->name : "(invalid)");
printf(" Version: 0x%08x\n", key.version);
printf(" ID: ");
vb2_print_bytes(key.id, sizeof(*key.id));
printf("\n");
if (sha1sum && memcmp(key.id, sha1sum, sizeof(*key.id))) {
printf(" Key sha1sum: ");
vb2_print_bytes(sha1sum, SHA1_DIGEST_SIZE);
printf("\n");
}
free(sha1sum);
return 0;
}
static uint8_t *vb2_private_key_sha1sum(struct vb2_private_key *key)
{
uint8_t *buf, *digest;
uint32_t buflen;
if (vb_keyb_from_rsa(key->rsa_private_key, &buf, &buflen))
return 0;
digest = DigestBuf(buf, buflen, SHA1_DIGEST_ALGORITHM);
free(buf);
return digest;
}
int futil_cb_show_vb2_privkey(struct futil_traverse_state_s *state)
{
struct vb2_private_key *key = 0;
const struct vb2_text_vs_enum *entry;
uint8_t *sha1sum;
if (VB2_SUCCESS != vb2_private_key_unpack(&key, state->my_area->buf,
state->my_area->len))
return 1;
sha1sum = vb2_private_key_sha1sum(key);
printf("Private key file: %s\n", state->in_filename);
printf(" Vboot API: 2.1\n");
printf(" Desc: \"%s\"\n", key->desc ? key->desc : "");
entry = vb2_lookup_by_num(vb2_text_vs_sig, key->sig_alg);
printf(" Signature Algorithm: %d %s\n", key->sig_alg,
entry ? entry->name : "(invalid)");
entry = vb2_lookup_by_num(vb2_text_vs_hash, key->hash_alg);
printf(" Hash Algorithm: %d %s\n", key->hash_alg,
entry ? entry->name : "(invalid)");
printf(" ID: ");
vb2_print_bytes(&key->id, sizeof(key->id));
printf("\n");
if (sha1sum && memcmp(&key->id, sha1sum, sizeof(key->id))) {
printf(" Key sha1sum: ");
vb2_print_bytes(sha1sum, SHA1_DIGEST_SIZE);
printf("\n");
}
free(sha1sum);
vb2_private_key_free(key);
return 0;
}
static RSA *rsa_from_buffer(uint8_t *buf, uint32_t len)
{
BIO *bp;
RSA *rsa_key;
bp = BIO_new_mem_buf(buf, len);
if (!bp)
return 0;
rsa_key = PEM_read_bio_RSAPrivateKey(bp, NULL, NULL, NULL);
if (!rsa_key) {
BIO_free(bp);
return 0;
}
BIO_free(bp);
return rsa_key;
}
enum futil_file_type ft_recognize_pem(uint8_t *buf, uint32_t len)
{
RSA *rsa_key = rsa_from_buffer(buf, len);
if (rsa_key) {
RSA_free(rsa_key);
return FILE_TYPE_PEM;
}
return FILE_TYPE_UNKNOWN;
}
int futil_cb_show_pem(struct futil_traverse_state_s *state)
{
RSA *rsa_key;
uint8_t *keyb, *digest;
uint32_t keyb_len;
int i, bits;
printf("Private Key file: %s\n", state->in_filename);
/* We're called only after ft_recognize_pem, so this should work. */
rsa_key = rsa_from_buffer(state->my_area->buf, state->my_area->len);
if (!rsa_key)
DIE;
bits = BN_num_bits(rsa_key->n);
printf(" Key length: %d\n", bits);
if (vb_keyb_from_rsa(rsa_key, &keyb, &keyb_len)) {
printf(" Key sha1sum: <error>");
RSA_free(rsa_key);
return 1;
}
printf(" Key sha1sum: ");
digest = DigestBuf(keyb, keyb_len, SHA1_DIGEST_ALGORITHM);
for (i = 0; i < SHA1_DIGEST_SIZE; i++)
printf("%02x", digest[i]);
printf("\n");
free(digest);
free(keyb);
RSA_free(rsa_key);
return 0;
}
|
