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
|
/*
* Copyright (c) 2014, Linaro Limited
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. 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.
*
* 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 HOLDER 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.
*/
#include <tee/tee_cryp_hkdf.h>
#include <tee/tee_cryp_provider.h>
#include <tee/tee_cryp_utl.h>
#include <stdlib.h>
#include <string.h>
#include <utee_defines.h>
static const uint8_t zero_salt[TEE_MAX_HASH_SIZE];
static TEE_Result hkdf_extract(uint32_t hash_id, const uint8_t *ikm,
size_t ikm_len, const uint8_t *salt,
size_t salt_len, uint8_t *prk, size_t *prk_len)
{
TEE_Result res;
size_t ctx_size;
void *ctx = NULL;
uint32_t hash_algo = TEE_ALG_HASH_ALGO(hash_id);
uint32_t hmac_algo = (TEE_OPERATION_MAC << 28) | hash_id;
const struct mac_ops *m = &crypto_ops.mac;
if (!m->get_ctx_size || !m->init || !m->update) {
res = TEE_ERROR_NOT_IMPLEMENTED;
goto out;
}
if (!salt || !salt_len) {
/*
* RFC 5869 section 2.2:
* If not provided, [the salt] is set to a string of HashLen
* zeros
*/
salt = zero_salt;
res = tee_hash_get_digest_size(hash_algo, &salt_len);
if (res != TEE_SUCCESS)
goto out;
}
res = m->get_ctx_size(hmac_algo, &ctx_size);
if (res != TEE_SUCCESS)
goto out;
ctx = malloc(ctx_size);
if (!ctx) {
res = TEE_ERROR_OUT_OF_MEMORY;
goto out;
}
/*
* RFC 5869 section 2.1: "Note that in the extract step, 'IKM' is used
* as the HMAC input, not as the HMAC key."
* Therefore, salt is the HMAC key in the formula from section 2.2:
* "PRK = HMAC-Hash(salt, IKM)"
*/
res = m->init(ctx, hmac_algo, salt, salt_len);
if (res != TEE_SUCCESS)
goto out;
res = m->update(ctx, hmac_algo, ikm, ikm_len);
if (res != TEE_SUCCESS)
goto out;
res = m->final(ctx, hmac_algo, prk, *prk_len);
if (res != TEE_SUCCESS)
goto out;
res = tee_hash_get_digest_size(hash_algo, prk_len);
out:
free(ctx);
return res;
}
static TEE_Result hkdf_expand(uint32_t hash_id, const uint8_t *prk,
size_t prk_len, const uint8_t *info,
size_t info_len, uint8_t *okm, size_t okm_len)
{
uint8_t tn[TEE_MAX_HASH_SIZE];
size_t tn_len, hash_len, i, n, where, ctx_size;
TEE_Result res = TEE_SUCCESS;
void *ctx = NULL;
const struct mac_ops *m = &crypto_ops.mac;
uint32_t hash_algo = TEE_ALG_HASH_ALGO(hash_id);
uint32_t hmac_algo = TEE_ALG_HMAC_ALGO(hash_id);
if (!m->get_ctx_size || !m->init || !m->update || !m->final) {
res = TEE_ERROR_NOT_IMPLEMENTED;
goto out;
}
res = tee_hash_get_digest_size(hash_algo, &hash_len);
if (res != TEE_SUCCESS)
goto out;
if (!okm || prk_len < hash_len) {
res = TEE_ERROR_BAD_STATE;
goto out;
}
if (!info)
info_len = 0;
res = m->get_ctx_size(hmac_algo, &ctx_size);
if (res != TEE_SUCCESS)
goto out;
ctx = malloc(ctx_size);
if (!ctx) {
res = TEE_ERROR_OUT_OF_MEMORY;
goto out;
}
/* N = ceil(L/HashLen) */
n = okm_len / hash_len;
if ((okm_len % hash_len) != 0)
n++;
if (n > 255) {
res = TEE_ERROR_BAD_PARAMETERS;
goto out;
}
/*
* RFC 5869 section 2.3
* T = T(1) | T(2) | T(3) | ... | T(N)
* OKM = first L octets of T
* T(0) = empty string (zero length)
* T(1) = HMAC-Hash(PRK, T(0) | info | 0x01)
* T(2) = HMAC-Hash(PRK, T(1) | info | 0x02)
* T(3) = HMAC-Hash(PRK, T(2) | info | 0x03)
* ...
*/
tn_len = 0;
where = 0;
for (i = 1; i <= n; i++) {
uint8_t c = i;
res = m->init(ctx, hmac_algo, prk, prk_len);
if (res != TEE_SUCCESS)
goto out;
res = m->update(ctx, hmac_algo, tn, tn_len);
if (res != TEE_SUCCESS)
goto out;
res = m->update(ctx, hmac_algo, info, info_len);
if (res != TEE_SUCCESS)
goto out;
res = m->update(ctx, hmac_algo, &c, 1);
if (res != TEE_SUCCESS)
goto out;
res = m->final(ctx, hmac_algo, tn, sizeof(tn));
if (res != TEE_SUCCESS)
goto out;
memcpy(okm + where, tn, (i < n) ? hash_len : (okm_len - where));
where += hash_len;
tn_len = hash_len;
}
out:
free(ctx);
return res;
}
TEE_Result tee_cryp_hkdf(uint32_t hash_id, const uint8_t *ikm, size_t ikm_len,
const uint8_t *salt, size_t salt_len,
const uint8_t *info, size_t info_len, uint8_t *okm,
size_t okm_len)
{
TEE_Result res;
uint8_t prk[TEE_MAX_HASH_SIZE];
size_t prk_len = sizeof(prk);
res = hkdf_extract(hash_id, ikm, ikm_len, salt, salt_len, prk,
&prk_len);
if (res != TEE_SUCCESS)
return res;
res = hkdf_expand(hash_id, prk, prk_len, info, info_len, okm,
okm_len);
return res;
}
|
