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
|
/*
* Copyright 2014 Intel Corporation. All Rights Reserved.
*
* 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.
*
* Neither the name Intel Corporation nor the names of its contributors may 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.
*/
#ifndef __TXT_LCP2_HELPER_H__
#define __TXT_LCP2_HELPER_H__
static inline lcp_signature_t *get_tpm12_signature(const lcp_policy_list_t *pollist)
{
if ( pollist == NULL )
return NULL;
if ( pollist->sig_alg != LCP_POLSALG_RSA_PKCS_15 )
return NULL;
return (lcp_signature_t *)((const void *)&pollist->policy_elements +
pollist->policy_elements_size);
}
static inline size_t get_tpm12_signature_size(const lcp_signature_t *sig)
{
if ( sig == NULL )
return 0;
return offsetof(lcp_signature_t, pubkey_value) + 2*sig->pubkey_size;
}
static inline size_t get_tpm12_policy_list_size(const lcp_policy_list_t *pollist)
{
size_t size = 0;
if ( pollist == NULL )
return 0;
size = offsetof(lcp_policy_list_t, policy_elements) +
pollist->policy_elements_size;
/* add sig size */
if ( pollist->sig_alg == LCP_POLSALG_RSA_PKCS_15 )
size += get_tpm12_signature_size(get_tpm12_signature(pollist));
return size;
}
static inline lcp_signature_t2 *get_tpm20_signature(const lcp_policy_list_t2 *pollist)
{
if ( pollist == NULL || pollist->sig_alg == TPM_ALG_NULL )
return NULL;
return (lcp_signature_t2 *)((const void *)&pollist->policy_elements +
pollist->policy_elements_size);
}
static inline lcp_signature_2_1 *get_tpm20_signature_2_1(
const lcp_policy_list_t2_1 *pollist)
{
if (pollist == NULL || pollist->KeySignatureOffset == 0)
return NULL;
return (lcp_signature_2_1 *) ((const void *)&pollist->PolicyElements +
pollist->PolicyElementsSize);
}
static inline size_t get_tpm20_signature_size(const lcp_signature_t2 *sig,
const uint16_t sig_alg)
{
if ( sig == NULL )
return 0;
if ( sig_alg == TPM_ALG_RSASSA)
return offsetof(lcp_rsa_signature_t, pubkey_value) +
2*sig->rsa_signature.pubkey_size;
else if ( sig_alg == TPM_ALG_ECDSA || sig_alg == TPM_ALG_SM2)
return offsetof(lcp_ecc_signature_t, qx) +
4*sig->ecc_signature.pubkey_size;
return 0;
}
static inline size_t get_tpm20_policy_list_size(const lcp_policy_list_t2 *pollist)
{
size_t size = 0;
if ( pollist == NULL )
return 0;
size = offsetof(lcp_policy_list_t2, policy_elements) +
pollist->policy_elements_size;
/* add sig size */
if ( pollist->sig_alg == TPM_ALG_RSASSA ||
pollist->sig_alg == TPM_ALG_ECDSA ||
pollist->sig_alg == TPM_ALG_SM2 )
size += get_tpm20_signature_size(get_tpm20_signature(pollist),
pollist->sig_alg);
return size;
}
static inline size_t get_raw_tpm20_sig_2_1_size(const lcp_key_and_sig *key_and_sig) {
/*
Calculate key and signature size treating it as a contigous buffer (
i.e. read from file). Will return physical size of signature and key,
not size of lcp_key_and_sig structure.
*/
typedef struct __packed {
uint8_t Version;
uint16_t KeyAlg;
uint8_t Version2;
uint16_t KeySize;
} sig_hdr;
sig_hdr *this_hdr = NULL;
if (key_and_sig == NULL) {
return 0;
}
this_hdr = (sig_hdr *) key_and_sig;
if (this_hdr->KeyAlg == TPM_ALG_RSA) {
return sizeof(rsa_key_and_signature) -
2*(MAX_RSA_KEY_SIZE - (this_hdr->KeySize/8));
}
else if (this_hdr->KeyAlg == TPM_ALG_ECC) {
return sizeof(ecc_key_and_signature) -
4*(MAX_ECC_KEY_SIZE - (this_hdr->KeySize/8));
}
else {
return 0;
}
}
static inline size_t get_raw_tpm20_list_2_1_size(const lcp_policy_list_t2_1 *pollist)
{
/*
Calculate size of a list in a contiguous buffer (i.e. read from file).
*/
size_t size = 0;
if (pollist == NULL) {
return 0;
}
if (pollist->KeySignatureOffset != 0) {
size = pollist->KeySignatureOffset +
get_raw_tpm20_sig_2_1_size((const lcp_key_and_sig *) ((void *) pollist+pollist->KeySignatureOffset));
}
else {
size = offsetof(lcp_policy_list_t2_1, PolicyElements) + pollist->PolicyElementsSize;
}
return size;
}
#endif /* __TXT_LCP3_HELPER_H__ */
|
