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
|
/*
* lib/crypto/pbkdf2.c
*
* Copyright 2002, 2008 by the Massachusetts Institute of Technology.
* All Rights Reserved.
*
* Export of this software from the United States of America may
* require a specific license from the United States Government.
* It is the responsibility of any person or organization contemplating
* export to obtain such a license before exporting.
*
* WITHIN THAT CONSTRAINT, permission to use, copy, modify, and
* distribute this software and its documentation for any purpose and
* without fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright notice and
* this permission notice appear in supporting documentation, and that
* the name of M.I.T. not be used in advertising or publicity pertaining
* to distribution of the software without specific, written prior
* permission. Furthermore if you modify this software you must label
* your software as modified software and not distribute it in such a
* fashion that it might be confused with the original M.I.T. software.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is" without express
* or implied warranty.
*
*
* Implementation of PBKDF2 from RFC 2898.
*/
#include <ctype.h>
#include "k5-int.h"
#include "hash_provider.h"
/*
* RFC 2898 specifies PBKDF2 in terms of an underlying pseudo-random
* function with two arguments (password and salt||blockindex). Right
* now we only use PBKDF2 with the hmac-sha1 PRF, also specified in
* RFC 2898, which invokes HMAC with the password as the key and the
* second argument as the text. (HMAC accepts any key size up to the
* block size; the password is pre-hashed with unkeyed SHA1 if it is
* longer than the block size.)
*
* For efficiency, it is better to generate the key from the password
* once at the beginning, so we specify prf_func in terms of a
* krb5_key first argument. That might not be convenient for a PRF
* which uses the password in some other way, so this might need to be
* adjusted in the future.
*/
typedef krb5_error_code (*prf_func)(krb5_key pass, krb5_data *salt,
krb5_data *out);
/* Not exported, for now. */
static krb5_error_code
krb5int_pbkdf2 (prf_func prf, size_t hlen, krb5_key pass,
const krb5_data *salt, unsigned long count,
const krb5_data *output);
static int debug_hmac = 0;
static void printd (const char *descr, krb5_data *d) {
unsigned int i, j;
const int r = 16;
printf("%s:", descr);
for (i = 0; i < d->length; i += r) {
printf("\n %04x: ", i);
for (j = i; j < i + r && j < d->length; j++)
printf(" %02x", 0xff & d->data[j]);
for (; j < i + r; j++)
printf(" ");
printf(" ");
for (j = i; j < i + r && j < d->length; j++) {
int c = 0xff & d->data[j];
printf("%c", isprint(c) ? c : '.');
}
}
printf("\n");
}
static krb5_error_code
F(char *output, char *u_tmp1, char *u_tmp2, prf_func prf, size_t hlen,
krb5_key pass, const krb5_data *salt, unsigned long count, int i)
{
unsigned char ibytes[4];
size_t tlen;
unsigned int j, k;
krb5_data sdata;
krb5_data out;
krb5_error_code err;
#if 0
printf("F(i=%d, count=%lu, pass=%d:%s)\n", i, count,
pass->length, pass->data);
#endif
/* Compute U_1. */
store_32_be(i, ibytes);
tlen = salt->length;
memcpy(u_tmp2, salt->data, tlen);
memcpy(u_tmp2 + tlen, ibytes, 4);
tlen += 4;
sdata.data = u_tmp2;
sdata.length = tlen;
#if 0
printd("initial salt", &sdata);
#endif
out.data = u_tmp1;
out.length = hlen;
#if 0
printf("F: computing hmac #1 (U_1) with %s\n", pdata.contents);
#endif
err = (*prf)(pass, &sdata, &out);
if (err)
return err;
#if 0
printd("F: prf return value", &out);
#endif
memcpy(output, u_tmp1, hlen);
/* Compute U_2, .. U_c. */
sdata.length = hlen;
for (j = 2; j <= count; j++) {
#if 0
printf("F: computing hmac #%d (U_%d)\n", j, j);
#endif
memcpy(u_tmp2, u_tmp1, hlen);
err = (*prf)(pass, &sdata, &out);
if (err)
return err;
#if 0
printd("F: prf return value", &out);
#endif
/* And xor them together. */
for (k = 0; k < hlen; k++)
output[k] ^= u_tmp1[k];
#if 0
printf("F: xor result:\n");
for (k = 0; k < hlen; k++)
printf(" %02x", 0xff & output[k]);
printf("\n");
#endif
}
return 0;
}
static krb5_error_code
krb5int_pbkdf2 (prf_func prf, size_t hlen, krb5_key pass,
const krb5_data *salt, unsigned long count,
const krb5_data *output)
{
int l, r, i;
char *utmp1, *utmp2;
char utmp3[20]; /* XXX length shouldn't be hardcoded! */
if (output->length == 0 || hlen == 0)
abort();
/* Step 1 & 2. */
if (output->length / hlen > 0xffffffff)
abort();
/* Step 2. */
l = (output->length + hlen - 1) / hlen;
r = output->length - (l - 1) * hlen;
utmp1 = /*output + dklen; */ malloc(hlen);
if (utmp1 == NULL)
return ENOMEM;
utmp2 = /*utmp1 + hlen; */ malloc(salt->length + 4 + hlen);
if (utmp2 == NULL) {
free(utmp1);
return ENOMEM;
}
/* Step 3. */
for (i = 1; i <= l; i++) {
#if 0
int j;
#endif
krb5_error_code err;
char *out;
if (i == l)
out = utmp3;
else
out = output->data + (i-1) * hlen;
err = F(out, utmp1, utmp2, prf, hlen, pass, salt, count, i);
if (err) {
free(utmp1);
free(utmp2);
return err;
}
if (i == l)
memcpy(output->data + (i-1) * hlen, utmp3,
output->length - (i-1) * hlen);
#if 0
printf("after F(%d), @%p:\n", i, output->data);
for (j = (i-1) * hlen; j < i * hlen; j++)
printf(" %02x", 0xff & output->data[j]);
printf ("\n");
#endif
}
free(utmp1);
free(utmp2);
return 0;
}
/*
* Implements the hmac-sha1 PRF. pass has been pre-hashed (if
* necessary) and converted to a key already; salt has had the block
* index appended to the original salt.
*/
static krb5_error_code
hmac_sha1(krb5_key pass, krb5_data *salt, krb5_data *out)
{
const struct krb5_hash_provider *h = &krb5int_hash_sha1;
krb5_error_code err;
if (debug_hmac)
printd(" hmac input", salt);
err = krb5_hmac(h, pass, 1, salt, out);
if (err == 0 && debug_hmac)
printd(" hmac output", out);
return err;
}
krb5_error_code
krb5int_pbkdf2_hmac_sha1 (const krb5_data *out, unsigned long count,
const krb5_data *pass, const krb5_data *salt)
{
const struct krb5_hash_provider *h = &krb5int_hash_sha1;
krb5_keyblock keyblock;
krb5_key key;
char tmp[40];
krb5_data d;
krb5_error_code err;
assert(h->hashsize <= sizeof(tmp));
if (pass->length > h->blocksize) {
d.data = tmp;
d.length = h->hashsize;
err = h->hash (1, pass, &d);
if (err)
return err;
keyblock.length = d.length;
keyblock.contents = (krb5_octet *) d.data;
} else {
keyblock.length = pass->length;
keyblock.contents = (krb5_octet *) pass->data;
}
err = krb5_k_create_key(NULL, &keyblock, &key);
if (err)
return err;
err = krb5int_pbkdf2(hmac_sha1, 20, key, salt, count, out);
krb5_k_free_key(NULL, key);
return err;
}
|