blob: 8ac3ea11d4372f0e72af1e64e8fa75b80fa8cc91 [file] [log] [blame]
Stephan Mueller541af942014-05-31 15:44:17 +02001/*
2 * DRBG: Deterministic Random Bits Generator
3 * Based on NIST Recommended DRBG from NIST SP800-90A with the following
4 * properties:
5 * * CTR DRBG with DF with AES-128, AES-192, AES-256 cores
6 * * Hash DRBG with DF with SHA-1, SHA-256, SHA-384, SHA-512 cores
7 * * HMAC DRBG with DF with SHA-1, SHA-256, SHA-384, SHA-512 cores
8 * * with and without prediction resistance
9 *
10 * Copyright Stephan Mueller <smueller@chronox.de>, 2014
11 *
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
14 * are met:
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, and the entire permission notice in its entirety,
17 * including the disclaimer of warranties.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
21 * 3. The name of the author may not be used to endorse or promote
22 * products derived from this software without specific prior
23 * written permission.
24 *
25 * ALTERNATIVELY, this product may be distributed under the terms of
26 * the GNU General Public License, in which case the provisions of the GPL are
27 * required INSTEAD OF the above restrictions. (This clause is
28 * necessary due to a potential bad interaction between the GPL and
29 * the restrictions contained in a BSD-style copyright.)
30 *
31 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
32 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
33 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, ALL OF
34 * WHICH ARE HEREBY DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE
35 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
36 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
37 * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
38 * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
39 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
40 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
41 * USE OF THIS SOFTWARE, EVEN IF NOT ADVISED OF THE POSSIBILITY OF SUCH
42 * DAMAGE.
43 *
44 * DRBG Usage
45 * ==========
46 * The SP 800-90A DRBG allows the user to specify a personalization string
47 * for initialization as well as an additional information string for each
48 * random number request. The following code fragments show how a caller
49 * uses the kernel crypto API to use the full functionality of the DRBG.
50 *
51 * Usage without any additional data
52 * ---------------------------------
53 * struct crypto_rng *drng;
54 * int err;
55 * char data[DATALEN];
56 *
57 * drng = crypto_alloc_rng(drng_name, 0, 0);
58 * err = crypto_rng_get_bytes(drng, &data, DATALEN);
59 * crypto_free_rng(drng);
60 *
61 *
62 * Usage with personalization string during initialization
63 * -------------------------------------------------------
64 * struct crypto_rng *drng;
65 * int err;
66 * char data[DATALEN];
67 * struct drbg_string pers;
68 * char personalization[11] = "some-string";
69 *
70 * drbg_string_fill(&pers, personalization, strlen(personalization));
71 * drng = crypto_alloc_rng(drng_name, 0, 0);
72 * // The reset completely re-initializes the DRBG with the provided
73 * // personalization string
74 * err = crypto_rng_reset(drng, &personalization, strlen(personalization));
75 * err = crypto_rng_get_bytes(drng, &data, DATALEN);
76 * crypto_free_rng(drng);
77 *
78 *
79 * Usage with additional information string during random number request
80 * ---------------------------------------------------------------------
81 * struct crypto_rng *drng;
82 * int err;
83 * char data[DATALEN];
84 * char addtl_string[11] = "some-string";
85 * string drbg_string addtl;
86 *
87 * drbg_string_fill(&addtl, addtl_string, strlen(addtl_string));
88 * drng = crypto_alloc_rng(drng_name, 0, 0);
89 * // The following call is a wrapper to crypto_rng_get_bytes() and returns
90 * // the same error codes.
91 * err = crypto_drbg_get_bytes_addtl(drng, &data, DATALEN, &addtl);
92 * crypto_free_rng(drng);
93 *
94 *
95 * Usage with personalization and additional information strings
96 * -------------------------------------------------------------
97 * Just mix both scenarios above.
98 */
99
100#include <crypto/drbg.h>
Stephan Mueller57225e62015-06-09 21:55:38 +0800101#include <linux/kernel.h>
Stephan Mueller541af942014-05-31 15:44:17 +0200102
Stephan Mueller541af942014-05-31 15:44:17 +0200103/***************************************************************
104 * Backend cipher definitions available to DRBG
105 ***************************************************************/
106
107/*
108 * The order of the DRBG definitions here matter: every DRBG is registered
109 * as stdrng. Each DRBG receives an increasing cra_priority values the later
110 * they are defined in this array (see drbg_fill_array).
111 *
112 * HMAC DRBGs are favored over Hash DRBGs over CTR DRBGs, and
113 * the SHA256 / AES 256 over other ciphers. Thus, the favored
114 * DRBGs are the latest entries in this array.
115 */
116static const struct drbg_core drbg_cores[] = {
117#ifdef CONFIG_CRYPTO_DRBG_CTR
118 {
119 .flags = DRBG_CTR | DRBG_STRENGTH128,
120 .statelen = 32, /* 256 bits as defined in 10.2.1 */
Stephan Mueller541af942014-05-31 15:44:17 +0200121 .blocklen_bytes = 16,
122 .cra_name = "ctr_aes128",
Stephan Mueller04bcbfc2015-03-01 20:39:17 +0100123 .backend_cra_name = "aes",
Stephan Mueller541af942014-05-31 15:44:17 +0200124 }, {
125 .flags = DRBG_CTR | DRBG_STRENGTH192,
126 .statelen = 40, /* 320 bits as defined in 10.2.1 */
Stephan Mueller541af942014-05-31 15:44:17 +0200127 .blocklen_bytes = 16,
128 .cra_name = "ctr_aes192",
Stephan Mueller04bcbfc2015-03-01 20:39:17 +0100129 .backend_cra_name = "aes",
Stephan Mueller541af942014-05-31 15:44:17 +0200130 }, {
131 .flags = DRBG_CTR | DRBG_STRENGTH256,
132 .statelen = 48, /* 384 bits as defined in 10.2.1 */
Stephan Mueller541af942014-05-31 15:44:17 +0200133 .blocklen_bytes = 16,
134 .cra_name = "ctr_aes256",
Stephan Mueller04bcbfc2015-03-01 20:39:17 +0100135 .backend_cra_name = "aes",
Stephan Mueller541af942014-05-31 15:44:17 +0200136 },
137#endif /* CONFIG_CRYPTO_DRBG_CTR */
138#ifdef CONFIG_CRYPTO_DRBG_HASH
139 {
140 .flags = DRBG_HASH | DRBG_STRENGTH128,
141 .statelen = 55, /* 440 bits */
Stephan Mueller541af942014-05-31 15:44:17 +0200142 .blocklen_bytes = 20,
143 .cra_name = "sha1",
144 .backend_cra_name = "sha1",
145 }, {
146 .flags = DRBG_HASH | DRBG_STRENGTH256,
147 .statelen = 111, /* 888 bits */
Stephan Mueller541af942014-05-31 15:44:17 +0200148 .blocklen_bytes = 48,
149 .cra_name = "sha384",
150 .backend_cra_name = "sha384",
151 }, {
152 .flags = DRBG_HASH | DRBG_STRENGTH256,
153 .statelen = 111, /* 888 bits */
Stephan Mueller541af942014-05-31 15:44:17 +0200154 .blocklen_bytes = 64,
155 .cra_name = "sha512",
156 .backend_cra_name = "sha512",
157 }, {
158 .flags = DRBG_HASH | DRBG_STRENGTH256,
159 .statelen = 55, /* 440 bits */
Stephan Mueller541af942014-05-31 15:44:17 +0200160 .blocklen_bytes = 32,
161 .cra_name = "sha256",
162 .backend_cra_name = "sha256",
163 },
164#endif /* CONFIG_CRYPTO_DRBG_HASH */
165#ifdef CONFIG_CRYPTO_DRBG_HMAC
166 {
Stephan Mueller5b635e22014-07-06 02:26:37 +0200167 .flags = DRBG_HMAC | DRBG_STRENGTH128,
Stephan Mueller541af942014-05-31 15:44:17 +0200168 .statelen = 20, /* block length of cipher */
Stephan Mueller541af942014-05-31 15:44:17 +0200169 .blocklen_bytes = 20,
170 .cra_name = "hmac_sha1",
171 .backend_cra_name = "hmac(sha1)",
172 }, {
173 .flags = DRBG_HMAC | DRBG_STRENGTH256,
174 .statelen = 48, /* block length of cipher */
Stephan Mueller541af942014-05-31 15:44:17 +0200175 .blocklen_bytes = 48,
176 .cra_name = "hmac_sha384",
177 .backend_cra_name = "hmac(sha384)",
178 }, {
179 .flags = DRBG_HMAC | DRBG_STRENGTH256,
180 .statelen = 64, /* block length of cipher */
Stephan Mueller541af942014-05-31 15:44:17 +0200181 .blocklen_bytes = 64,
182 .cra_name = "hmac_sha512",
183 .backend_cra_name = "hmac(sha512)",
184 }, {
185 .flags = DRBG_HMAC | DRBG_STRENGTH256,
186 .statelen = 32, /* block length of cipher */
Stephan Mueller541af942014-05-31 15:44:17 +0200187 .blocklen_bytes = 32,
188 .cra_name = "hmac_sha256",
189 .backend_cra_name = "hmac(sha256)",
190 },
191#endif /* CONFIG_CRYPTO_DRBG_HMAC */
192};
193
Stephan Mueller57225e62015-06-09 21:55:38 +0800194static int drbg_uninstantiate(struct drbg_state *drbg);
195
Stephan Mueller541af942014-05-31 15:44:17 +0200196/******************************************************************
197 * Generic helper functions
198 ******************************************************************/
199
200/*
201 * Return strength of DRBG according to SP800-90A section 8.4
202 *
203 * @flags DRBG flags reference
204 *
205 * Return: normalized strength in *bytes* value or 32 as default
206 * to counter programming errors
207 */
208static inline unsigned short drbg_sec_strength(drbg_flag_t flags)
209{
210 switch (flags & DRBG_STRENGTH_MASK) {
211 case DRBG_STRENGTH128:
212 return 16;
213 case DRBG_STRENGTH192:
214 return 24;
215 case DRBG_STRENGTH256:
216 return 32;
217 default:
218 return 32;
219 }
220}
221
222/*
Stephan Mueller541af942014-05-31 15:44:17 +0200223 * Convert an integer into a byte representation of this integer.
224 * The byte representation is big-endian
225 *
Stephan Mueller541af942014-05-31 15:44:17 +0200226 * @val value to be converted
Stephan Mueller72f3e002014-08-17 17:37:34 +0200227 * @buf buffer holding the converted integer -- caller must ensure that
228 * buffer size is at least 32 bit
Stephan Mueller541af942014-05-31 15:44:17 +0200229 */
230#if (defined(CONFIG_CRYPTO_DRBG_HASH) || defined(CONFIG_CRYPTO_DRBG_CTR))
Stephan Mueller72f3e002014-08-17 17:37:34 +0200231static inline void drbg_cpu_to_be32(__u32 val, unsigned char *buf)
Stephan Mueller541af942014-05-31 15:44:17 +0200232{
Stephan Mueller72f3e002014-08-17 17:37:34 +0200233 struct s {
Stephan Mueller7c8ae032014-08-26 09:32:24 +0200234 __be32 conv;
Stephan Mueller72f3e002014-08-17 17:37:34 +0200235 };
236 struct s *conversion = (struct s *) buf;
Stephan Mueller541af942014-05-31 15:44:17 +0200237
Stephan Mueller72f3e002014-08-17 17:37:34 +0200238 conversion->conv = cpu_to_be32(val);
Stephan Mueller541af942014-05-31 15:44:17 +0200239}
Stephan Mueller541af942014-05-31 15:44:17 +0200240#endif /* defined(CONFIG_CRYPTO_DRBG_HASH) || defined(CONFIG_CRYPTO_DRBG_CTR) */
241
242/******************************************************************
243 * CTR DRBG callback functions
244 ******************************************************************/
245
246#ifdef CONFIG_CRYPTO_DRBG_CTR
Stephan Muellere25e47e2014-07-06 02:23:03 +0200247#define CRYPTO_DRBG_CTR_STRING "CTR "
Stephan Mueller0653a7c2014-11-25 09:28:43 +0100248MODULE_ALIAS_CRYPTO("drbg_pr_ctr_aes256");
249MODULE_ALIAS_CRYPTO("drbg_nopr_ctr_aes256");
250MODULE_ALIAS_CRYPTO("drbg_pr_ctr_aes192");
251MODULE_ALIAS_CRYPTO("drbg_nopr_ctr_aes192");
252MODULE_ALIAS_CRYPTO("drbg_pr_ctr_aes128");
253MODULE_ALIAS_CRYPTO("drbg_nopr_ctr_aes128");
Stephan Mueller62b62b62014-11-04 03:08:09 +0100254
Stephan Muellered494d42016-05-31 13:11:57 +0200255static void drbg_kcapi_symsetkey(struct drbg_state *drbg,
256 const unsigned char *key);
257static int drbg_kcapi_sym(struct drbg_state *drbg, unsigned char *outval,
258 const struct drbg_string *in);
Stephan Mueller541af942014-05-31 15:44:17 +0200259static int drbg_init_sym_kernel(struct drbg_state *drbg);
260static int drbg_fini_sym_kernel(struct drbg_state *drbg);
Stephan Mueller35591282016-06-14 07:34:13 +0200261static int drbg_kcapi_sym_ctr(struct drbg_state *drbg, u8 *outbuf, u32 outlen);
Stephan Mueller541af942014-05-31 15:44:17 +0200262
263/* BCC function for CTR DRBG as defined in 10.4.3 */
264static int drbg_ctr_bcc(struct drbg_state *drbg,
265 unsigned char *out, const unsigned char *key,
Stephan Mueller8c987162014-06-28 21:58:24 +0200266 struct list_head *in)
Stephan Mueller541af942014-05-31 15:44:17 +0200267{
Stephan Mueller8c987162014-06-28 21:58:24 +0200268 int ret = 0;
269 struct drbg_string *curr = NULL;
Stephan Mueller541af942014-05-31 15:44:17 +0200270 struct drbg_string data;
Stephan Mueller8c987162014-06-28 21:58:24 +0200271 short cnt = 0;
Stephan Mueller541af942014-05-31 15:44:17 +0200272
273 drbg_string_fill(&data, out, drbg_blocklen(drbg));
274
Stephan Mueller541af942014-05-31 15:44:17 +0200275 /* 10.4.3 step 2 / 4 */
Stephan Muellered494d42016-05-31 13:11:57 +0200276 drbg_kcapi_symsetkey(drbg, key);
Stephan Mueller8c987162014-06-28 21:58:24 +0200277 list_for_each_entry(curr, in, list) {
278 const unsigned char *pos = curr->buf;
279 size_t len = curr->len;
Stephan Mueller541af942014-05-31 15:44:17 +0200280 /* 10.4.3 step 4.1 */
Stephan Mueller8c987162014-06-28 21:58:24 +0200281 while (len) {
282 /* 10.4.3 step 4.2 */
283 if (drbg_blocklen(drbg) == cnt) {
284 cnt = 0;
Stephan Muellered494d42016-05-31 13:11:57 +0200285 ret = drbg_kcapi_sym(drbg, out, &data);
Stephan Mueller8c987162014-06-28 21:58:24 +0200286 if (ret)
287 return ret;
Stephan Mueller541af942014-05-31 15:44:17 +0200288 }
Stephan Mueller8c987162014-06-28 21:58:24 +0200289 out[cnt] ^= *pos;
290 pos++;
291 cnt++;
292 len--;
Stephan Mueller541af942014-05-31 15:44:17 +0200293 }
Stephan Mueller541af942014-05-31 15:44:17 +0200294 }
Stephan Mueller8c987162014-06-28 21:58:24 +0200295 /* 10.4.3 step 4.2 for last block */
296 if (cnt)
Stephan Muellered494d42016-05-31 13:11:57 +0200297 ret = drbg_kcapi_sym(drbg, out, &data);
Stephan Mueller8c987162014-06-28 21:58:24 +0200298
299 return ret;
Stephan Mueller541af942014-05-31 15:44:17 +0200300}
301
302/*
303 * scratchpad usage: drbg_ctr_update is interlinked with drbg_ctr_df
304 * (and drbg_ctr_bcc, but this function does not need any temporary buffers),
305 * the scratchpad is used as follows:
306 * drbg_ctr_update:
307 * temp
308 * start: drbg->scratchpad
309 * length: drbg_statelen(drbg) + drbg_blocklen(drbg)
310 * note: the cipher writing into this variable works
311 * blocklen-wise. Now, when the statelen is not a multiple
312 * of blocklen, the generateion loop below "spills over"
313 * by at most blocklen. Thus, we need to give sufficient
314 * memory.
315 * df_data
316 * start: drbg->scratchpad +
317 * drbg_statelen(drbg) + drbg_blocklen(drbg)
318 * length: drbg_statelen(drbg)
319 *
320 * drbg_ctr_df:
321 * pad
322 * start: df_data + drbg_statelen(drbg)
323 * length: drbg_blocklen(drbg)
324 * iv
325 * start: pad + drbg_blocklen(drbg)
326 * length: drbg_blocklen(drbg)
327 * temp
328 * start: iv + drbg_blocklen(drbg)
Stephan Mueller8fecaad2014-07-01 17:08:48 +0200329 * length: drbg_satelen(drbg) + drbg_blocklen(drbg)
330 * note: temp is the buffer that the BCC function operates
331 * on. BCC operates blockwise. drbg_statelen(drbg)
332 * is sufficient when the DRBG state length is a multiple
333 * of the block size. For AES192 (and maybe other ciphers)
334 * this is not correct and the length for temp is
335 * insufficient (yes, that also means for such ciphers,
336 * the final output of all BCC rounds are truncated).
337 * Therefore, add drbg_blocklen(drbg) to cover all
338 * possibilities.
Stephan Mueller541af942014-05-31 15:44:17 +0200339 */
340
341/* Derivation Function for CTR DRBG as defined in 10.4.2 */
342static int drbg_ctr_df(struct drbg_state *drbg,
343 unsigned char *df_data, size_t bytes_to_return,
Stephan Mueller8c987162014-06-28 21:58:24 +0200344 struct list_head *seedlist)
Stephan Mueller541af942014-05-31 15:44:17 +0200345{
346 int ret = -EFAULT;
347 unsigned char L_N[8];
348 /* S3 is input */
349 struct drbg_string S1, S2, S4, cipherin;
Stephan Mueller8c987162014-06-28 21:58:24 +0200350 LIST_HEAD(bcc_list);
Stephan Mueller541af942014-05-31 15:44:17 +0200351 unsigned char *pad = df_data + drbg_statelen(drbg);
352 unsigned char *iv = pad + drbg_blocklen(drbg);
353 unsigned char *temp = iv + drbg_blocklen(drbg);
354 size_t padlen = 0;
355 unsigned int templen = 0;
356 /* 10.4.2 step 7 */
357 unsigned int i = 0;
358 /* 10.4.2 step 8 */
359 const unsigned char *K = (unsigned char *)
360 "\x00\x01\x02\x03\x04\x05\x06\x07"
361 "\x08\x09\x0a\x0b\x0c\x0d\x0e\x0f"
362 "\x10\x11\x12\x13\x14\x15\x16\x17"
363 "\x18\x19\x1a\x1b\x1c\x1d\x1e\x1f";
364 unsigned char *X;
365 size_t generated_len = 0;
366 size_t inputlen = 0;
Stephan Mueller8c987162014-06-28 21:58:24 +0200367 struct drbg_string *seed = NULL;
Stephan Mueller541af942014-05-31 15:44:17 +0200368
369 memset(pad, 0, drbg_blocklen(drbg));
370 memset(iv, 0, drbg_blocklen(drbg));
Stephan Mueller541af942014-05-31 15:44:17 +0200371
372 /* 10.4.2 step 1 is implicit as we work byte-wise */
373
374 /* 10.4.2 step 2 */
375 if ((512/8) < bytes_to_return)
376 return -EINVAL;
377
378 /* 10.4.2 step 2 -- calculate the entire length of all input data */
Stephan Mueller8c987162014-06-28 21:58:24 +0200379 list_for_each_entry(seed, seedlist, list)
380 inputlen += seed->len;
Stephan Mueller72f3e002014-08-17 17:37:34 +0200381 drbg_cpu_to_be32(inputlen, &L_N[0]);
Stephan Mueller541af942014-05-31 15:44:17 +0200382
383 /* 10.4.2 step 3 */
Stephan Mueller72f3e002014-08-17 17:37:34 +0200384 drbg_cpu_to_be32(bytes_to_return, &L_N[4]);
Stephan Mueller541af942014-05-31 15:44:17 +0200385
386 /* 10.4.2 step 5: length is L_N, input_string, one byte, padding */
387 padlen = (inputlen + sizeof(L_N) + 1) % (drbg_blocklen(drbg));
388 /* wrap the padlen appropriately */
389 if (padlen)
390 padlen = drbg_blocklen(drbg) - padlen;
391 /*
392 * pad / padlen contains the 0x80 byte and the following zero bytes.
393 * As the calculated padlen value only covers the number of zero
394 * bytes, this value has to be incremented by one for the 0x80 byte.
395 */
396 padlen++;
397 pad[0] = 0x80;
398
399 /* 10.4.2 step 4 -- first fill the linked list and then order it */
400 drbg_string_fill(&S1, iv, drbg_blocklen(drbg));
Stephan Mueller8c987162014-06-28 21:58:24 +0200401 list_add_tail(&S1.list, &bcc_list);
Stephan Mueller541af942014-05-31 15:44:17 +0200402 drbg_string_fill(&S2, L_N, sizeof(L_N));
Stephan Mueller8c987162014-06-28 21:58:24 +0200403 list_add_tail(&S2.list, &bcc_list);
404 list_splice_tail(seedlist, &bcc_list);
Stephan Mueller541af942014-05-31 15:44:17 +0200405 drbg_string_fill(&S4, pad, padlen);
Stephan Mueller8c987162014-06-28 21:58:24 +0200406 list_add_tail(&S4.list, &bcc_list);
Stephan Mueller541af942014-05-31 15:44:17 +0200407
408 /* 10.4.2 step 9 */
409 while (templen < (drbg_keylen(drbg) + (drbg_blocklen(drbg)))) {
410 /*
411 * 10.4.2 step 9.1 - the padding is implicit as the buffer
412 * holds zeros after allocation -- even the increment of i
413 * is irrelevant as the increment remains within length of i
414 */
Stephan Mueller72f3e002014-08-17 17:37:34 +0200415 drbg_cpu_to_be32(i, iv);
Stephan Mueller541af942014-05-31 15:44:17 +0200416 /* 10.4.2 step 9.2 -- BCC and concatenation with temp */
Stephan Mueller8c987162014-06-28 21:58:24 +0200417 ret = drbg_ctr_bcc(drbg, temp + templen, K, &bcc_list);
Stephan Mueller541af942014-05-31 15:44:17 +0200418 if (ret)
419 goto out;
420 /* 10.4.2 step 9.3 */
421 i++;
422 templen += drbg_blocklen(drbg);
423 }
424
425 /* 10.4.2 step 11 */
426 X = temp + (drbg_keylen(drbg));
427 drbg_string_fill(&cipherin, X, drbg_blocklen(drbg));
428
429 /* 10.4.2 step 12: overwriting of outval is implemented in next step */
430
431 /* 10.4.2 step 13 */
Stephan Muellered494d42016-05-31 13:11:57 +0200432 drbg_kcapi_symsetkey(drbg, temp);
Stephan Mueller541af942014-05-31 15:44:17 +0200433 while (generated_len < bytes_to_return) {
434 short blocklen = 0;
435 /*
436 * 10.4.2 step 13.1: the truncation of the key length is
437 * implicit as the key is only drbg_blocklen in size based on
438 * the implementation of the cipher function callback
439 */
Stephan Muellered494d42016-05-31 13:11:57 +0200440 ret = drbg_kcapi_sym(drbg, X, &cipherin);
Stephan Mueller541af942014-05-31 15:44:17 +0200441 if (ret)
442 goto out;
443 blocklen = (drbg_blocklen(drbg) <
444 (bytes_to_return - generated_len)) ?
445 drbg_blocklen(drbg) :
446 (bytes_to_return - generated_len);
447 /* 10.4.2 step 13.2 and 14 */
448 memcpy(df_data + generated_len, X, blocklen);
449 generated_len += blocklen;
450 }
451
452 ret = 0;
453
454out:
Herbert Xu1471f092015-01-05 10:44:09 +1100455 memset(iv, 0, drbg_blocklen(drbg));
Stephan Mueller8e0498d2015-04-17 14:54:08 +0200456 memset(temp, 0, drbg_statelen(drbg) + drbg_blocklen(drbg));
Herbert Xu1471f092015-01-05 10:44:09 +1100457 memset(pad, 0, drbg_blocklen(drbg));
Stephan Mueller541af942014-05-31 15:44:17 +0200458 return ret;
459}
460
Stephan Mueller72e7c252014-07-06 02:24:35 +0200461/*
462 * update function of CTR DRBG as defined in 10.2.1.2
463 *
464 * The reseed variable has an enhanced meaning compared to the update
465 * functions of the other DRBGs as follows:
466 * 0 => initial seed from initialization
467 * 1 => reseed via drbg_seed
468 * 2 => first invocation from drbg_ctr_update when addtl is present. In
469 * this case, the df_data scratchpad is not deleted so that it is
470 * available for another calls to prevent calling the DF function
471 * again.
472 * 3 => second invocation from drbg_ctr_update. When the update function
473 * was called with addtl, the df_data memory already contains the
474 * DFed addtl information and we do not need to call DF again.
475 */
Stephan Mueller8c987162014-06-28 21:58:24 +0200476static int drbg_ctr_update(struct drbg_state *drbg, struct list_head *seed,
477 int reseed)
Stephan Mueller541af942014-05-31 15:44:17 +0200478{
479 int ret = -EFAULT;
480 /* 10.2.1.2 step 1 */
481 unsigned char *temp = drbg->scratchpad;
482 unsigned char *df_data = drbg->scratchpad + drbg_statelen(drbg) +
483 drbg_blocklen(drbg);
484 unsigned char *temp_p, *df_data_p; /* pointer to iterate over buffers */
485 unsigned int len = 0;
Stephan Mueller541af942014-05-31 15:44:17 +0200486
Stephan Mueller72e7c252014-07-06 02:24:35 +0200487 if (3 > reseed)
488 memset(df_data, 0, drbg_statelen(drbg));
Stephan Mueller541af942014-05-31 15:44:17 +0200489
Stephan Mueller35591282016-06-14 07:34:13 +0200490 if (!reseed) {
491 /*
492 * The DRBG uses the CTR mode of the underlying AES cipher. The
493 * CTR mode increments the counter value after the AES operation
494 * but SP800-90A requires that the counter is incremented before
495 * the AES operation. Hence, we increment it at the time we set
496 * it by one.
497 */
498 crypto_inc(drbg->V, drbg_blocklen(drbg));
499
500 ret = crypto_skcipher_setkey(drbg->ctr_handle, drbg->C,
501 drbg_keylen(drbg));
502 if (ret)
503 goto out;
504 }
505
Stephan Mueller541af942014-05-31 15:44:17 +0200506 /* 10.2.1.3.2 step 2 and 10.2.1.4.2 step 2 */
Stephan Mueller8c987162014-06-28 21:58:24 +0200507 if (seed) {
508 ret = drbg_ctr_df(drbg, df_data, drbg_statelen(drbg), seed);
Stephan Mueller541af942014-05-31 15:44:17 +0200509 if (ret)
510 goto out;
511 }
512
Stephan Mueller35591282016-06-14 07:34:13 +0200513 ret = drbg_kcapi_sym_ctr(drbg, temp, drbg_statelen(drbg));
514 if (ret)
515 return ret;
Stephan Mueller541af942014-05-31 15:44:17 +0200516
517 /* 10.2.1.2 step 4 */
518 temp_p = temp;
519 df_data_p = df_data;
520 for (len = 0; len < drbg_statelen(drbg); len++) {
521 *temp_p ^= *df_data_p;
522 df_data_p++; temp_p++;
523 }
524
525 /* 10.2.1.2 step 5 */
526 memcpy(drbg->C, temp, drbg_keylen(drbg));
Stephan Mueller35591282016-06-14 07:34:13 +0200527 ret = crypto_skcipher_setkey(drbg->ctr_handle, drbg->C,
528 drbg_keylen(drbg));
529 if (ret)
530 goto out;
Stephan Mueller541af942014-05-31 15:44:17 +0200531 /* 10.2.1.2 step 6 */
532 memcpy(drbg->V, temp + drbg_keylen(drbg), drbg_blocklen(drbg));
Stephan Mueller35591282016-06-14 07:34:13 +0200533 /* See above: increment counter by one to compensate timing of CTR op */
534 crypto_inc(drbg->V, drbg_blocklen(drbg));
Stephan Mueller541af942014-05-31 15:44:17 +0200535 ret = 0;
536
537out:
Herbert Xu1471f092015-01-05 10:44:09 +1100538 memset(temp, 0, drbg_statelen(drbg) + drbg_blocklen(drbg));
Stephan Mueller72e7c252014-07-06 02:24:35 +0200539 if (2 != reseed)
Herbert Xu1471f092015-01-05 10:44:09 +1100540 memset(df_data, 0, drbg_statelen(drbg));
Stephan Mueller541af942014-05-31 15:44:17 +0200541 return ret;
542}
543
544/*
545 * scratchpad use: drbg_ctr_update is called independently from
546 * drbg_ctr_extract_bytes. Therefore, the scratchpad is reused
547 */
548/* Generate function of CTR DRBG as defined in 10.2.1.5.2 */
549static int drbg_ctr_generate(struct drbg_state *drbg,
550 unsigned char *buf, unsigned int buflen,
Stephan Mueller27e4de22014-07-06 02:25:36 +0200551 struct list_head *addtl)
Stephan Mueller541af942014-05-31 15:44:17 +0200552{
Stephan Mueller35591282016-06-14 07:34:13 +0200553 int ret;
554 int len = min_t(int, buflen, INT_MAX);
Stephan Mueller541af942014-05-31 15:44:17 +0200555
Stephan Mueller541af942014-05-31 15:44:17 +0200556 /* 10.2.1.5.2 step 2 */
Stephan Mueller27e4de22014-07-06 02:25:36 +0200557 if (addtl && !list_empty(addtl)) {
558 ret = drbg_ctr_update(drbg, addtl, 2);
Stephan Mueller541af942014-05-31 15:44:17 +0200559 if (ret)
560 return 0;
561 }
562
563 /* 10.2.1.5.2 step 4.1 */
Stephan Mueller35591282016-06-14 07:34:13 +0200564 ret = drbg_kcapi_sym_ctr(drbg, buf, len);
565 if (ret)
566 return ret;
Stephan Mueller541af942014-05-31 15:44:17 +0200567
Stephan Mueller72e7c252014-07-06 02:24:35 +0200568 /* 10.2.1.5.2 step 6 */
569 ret = drbg_ctr_update(drbg, NULL, 3);
Stephan Mueller541af942014-05-31 15:44:17 +0200570 if (ret)
571 len = ret;
572
Stephan Mueller541af942014-05-31 15:44:17 +0200573 return len;
574}
575
Julia Lawalle4bc02a2015-12-07 21:36:57 +0100576static const struct drbg_state_ops drbg_ctr_ops = {
Stephan Mueller541af942014-05-31 15:44:17 +0200577 .update = drbg_ctr_update,
578 .generate = drbg_ctr_generate,
579 .crypto_init = drbg_init_sym_kernel,
580 .crypto_fini = drbg_fini_sym_kernel,
581};
582#endif /* CONFIG_CRYPTO_DRBG_CTR */
583
584/******************************************************************
585 * HMAC DRBG callback functions
586 ******************************************************************/
587
588#if defined(CONFIG_CRYPTO_DRBG_HASH) || defined(CONFIG_CRYPTO_DRBG_HMAC)
Stephan Mueller4218ebe2016-03-28 16:47:55 +0200589static int drbg_kcapi_hash(struct drbg_state *drbg, unsigned char *outval,
590 const struct list_head *in);
591static void drbg_kcapi_hmacsetkey(struct drbg_state *drbg,
592 const unsigned char *key);
Stephan Mueller541af942014-05-31 15:44:17 +0200593static int drbg_init_hash_kernel(struct drbg_state *drbg);
594static int drbg_fini_hash_kernel(struct drbg_state *drbg);
595#endif /* (CONFIG_CRYPTO_DRBG_HASH || CONFIG_CRYPTO_DRBG_HMAC) */
596
597#ifdef CONFIG_CRYPTO_DRBG_HMAC
Stephan Muellere25e47e2014-07-06 02:23:03 +0200598#define CRYPTO_DRBG_HMAC_STRING "HMAC "
Stephan Mueller0653a7c2014-11-25 09:28:43 +0100599MODULE_ALIAS_CRYPTO("drbg_pr_hmac_sha512");
600MODULE_ALIAS_CRYPTO("drbg_nopr_hmac_sha512");
601MODULE_ALIAS_CRYPTO("drbg_pr_hmac_sha384");
602MODULE_ALIAS_CRYPTO("drbg_nopr_hmac_sha384");
603MODULE_ALIAS_CRYPTO("drbg_pr_hmac_sha256");
604MODULE_ALIAS_CRYPTO("drbg_nopr_hmac_sha256");
605MODULE_ALIAS_CRYPTO("drbg_pr_hmac_sha1");
606MODULE_ALIAS_CRYPTO("drbg_nopr_hmac_sha1");
Stephan Mueller62b62b62014-11-04 03:08:09 +0100607
Stephan Mueller541af942014-05-31 15:44:17 +0200608/* update function of HMAC DRBG as defined in 10.1.2.2 */
Stephan Mueller8c987162014-06-28 21:58:24 +0200609static int drbg_hmac_update(struct drbg_state *drbg, struct list_head *seed,
610 int reseed)
Stephan Mueller541af942014-05-31 15:44:17 +0200611{
612 int ret = -EFAULT;
613 int i = 0;
Stephan Mueller8c987162014-06-28 21:58:24 +0200614 struct drbg_string seed1, seed2, vdata;
615 LIST_HEAD(seedlist);
616 LIST_HEAD(vdatalist);
Stephan Mueller541af942014-05-31 15:44:17 +0200617
Stephan Mueller4218ebe2016-03-28 16:47:55 +0200618 if (!reseed) {
Stephan Muellerf072f0e2014-08-17 17:38:58 +0200619 /* 10.1.2.3 step 2 -- memset(0) of C is implicit with kzalloc */
Stephan Mueller541af942014-05-31 15:44:17 +0200620 memset(drbg->V, 1, drbg_statelen(drbg));
Stephan Mueller4218ebe2016-03-28 16:47:55 +0200621 drbg_kcapi_hmacsetkey(drbg, drbg->C);
622 }
Stephan Mueller541af942014-05-31 15:44:17 +0200623
624 drbg_string_fill(&seed1, drbg->V, drbg_statelen(drbg));
Stephan Mueller8c987162014-06-28 21:58:24 +0200625 list_add_tail(&seed1.list, &seedlist);
Stephan Mueller541af942014-05-31 15:44:17 +0200626 /* buffer of seed2 will be filled in for loop below with one byte */
627 drbg_string_fill(&seed2, NULL, 1);
Stephan Mueller8c987162014-06-28 21:58:24 +0200628 list_add_tail(&seed2.list, &seedlist);
Stephan Mueller541af942014-05-31 15:44:17 +0200629 /* input data of seed is allowed to be NULL at this point */
Stephan Mueller8c987162014-06-28 21:58:24 +0200630 if (seed)
631 list_splice_tail(seed, &seedlist);
Stephan Mueller541af942014-05-31 15:44:17 +0200632
Stephan Mueller8c987162014-06-28 21:58:24 +0200633 drbg_string_fill(&vdata, drbg->V, drbg_statelen(drbg));
634 list_add_tail(&vdata.list, &vdatalist);
Stephan Mueller541af942014-05-31 15:44:17 +0200635 for (i = 2; 0 < i; i--) {
636 /* first round uses 0x0, second 0x1 */
637 unsigned char prefix = DRBG_PREFIX0;
638 if (1 == i)
639 prefix = DRBG_PREFIX1;
640 /* 10.1.2.2 step 1 and 4 -- concatenation and HMAC for key */
641 seed2.buf = &prefix;
Stephan Mueller4218ebe2016-03-28 16:47:55 +0200642 ret = drbg_kcapi_hash(drbg, drbg->C, &seedlist);
Stephan Mueller541af942014-05-31 15:44:17 +0200643 if (ret)
644 return ret;
Stephan Mueller4218ebe2016-03-28 16:47:55 +0200645 drbg_kcapi_hmacsetkey(drbg, drbg->C);
Stephan Mueller541af942014-05-31 15:44:17 +0200646
647 /* 10.1.2.2 step 2 and 5 -- HMAC for V */
Stephan Mueller4218ebe2016-03-28 16:47:55 +0200648 ret = drbg_kcapi_hash(drbg, drbg->V, &vdatalist);
Stephan Mueller541af942014-05-31 15:44:17 +0200649 if (ret)
650 return ret;
651
652 /* 10.1.2.2 step 3 */
Stephan Mueller8c987162014-06-28 21:58:24 +0200653 if (!seed)
Stephan Mueller541af942014-05-31 15:44:17 +0200654 return ret;
655 }
656
657 return 0;
658}
659
660/* generate function of HMAC DRBG as defined in 10.1.2.5 */
661static int drbg_hmac_generate(struct drbg_state *drbg,
662 unsigned char *buf,
663 unsigned int buflen,
Stephan Mueller27e4de22014-07-06 02:25:36 +0200664 struct list_head *addtl)
Stephan Mueller541af942014-05-31 15:44:17 +0200665{
666 int len = 0;
667 int ret = 0;
668 struct drbg_string data;
Stephan Mueller8c987162014-06-28 21:58:24 +0200669 LIST_HEAD(datalist);
Stephan Mueller541af942014-05-31 15:44:17 +0200670
671 /* 10.1.2.5 step 2 */
Stephan Mueller27e4de22014-07-06 02:25:36 +0200672 if (addtl && !list_empty(addtl)) {
673 ret = drbg_hmac_update(drbg, addtl, 1);
Stephan Mueller541af942014-05-31 15:44:17 +0200674 if (ret)
675 return ret;
676 }
677
678 drbg_string_fill(&data, drbg->V, drbg_statelen(drbg));
Stephan Mueller8c987162014-06-28 21:58:24 +0200679 list_add_tail(&data.list, &datalist);
Stephan Mueller541af942014-05-31 15:44:17 +0200680 while (len < buflen) {
681 unsigned int outlen = 0;
682 /* 10.1.2.5 step 4.1 */
Stephan Mueller4218ebe2016-03-28 16:47:55 +0200683 ret = drbg_kcapi_hash(drbg, drbg->V, &datalist);
Stephan Mueller541af942014-05-31 15:44:17 +0200684 if (ret)
685 return ret;
686 outlen = (drbg_blocklen(drbg) < (buflen - len)) ?
687 drbg_blocklen(drbg) : (buflen - len);
Stephan Mueller541af942014-05-31 15:44:17 +0200688
689 /* 10.1.2.5 step 4.2 */
690 memcpy(buf + len, drbg->V, outlen);
691 len += outlen;
692 }
693
694 /* 10.1.2.5 step 6 */
Stephan Mueller27e4de22014-07-06 02:25:36 +0200695 if (addtl && !list_empty(addtl))
696 ret = drbg_hmac_update(drbg, addtl, 1);
697 else
Stephan Mueller8c987162014-06-28 21:58:24 +0200698 ret = drbg_hmac_update(drbg, NULL, 1);
Stephan Mueller541af942014-05-31 15:44:17 +0200699 if (ret)
700 return ret;
701
702 return len;
703}
704
Julia Lawalle4bc02a2015-12-07 21:36:57 +0100705static const struct drbg_state_ops drbg_hmac_ops = {
Stephan Mueller541af942014-05-31 15:44:17 +0200706 .update = drbg_hmac_update,
707 .generate = drbg_hmac_generate,
708 .crypto_init = drbg_init_hash_kernel,
709 .crypto_fini = drbg_fini_hash_kernel,
Stephan Mueller541af942014-05-31 15:44:17 +0200710};
711#endif /* CONFIG_CRYPTO_DRBG_HMAC */
712
713/******************************************************************
714 * Hash DRBG callback functions
715 ******************************************************************/
716
717#ifdef CONFIG_CRYPTO_DRBG_HASH
Stephan Muellere25e47e2014-07-06 02:23:03 +0200718#define CRYPTO_DRBG_HASH_STRING "HASH "
Stephan Mueller0653a7c2014-11-25 09:28:43 +0100719MODULE_ALIAS_CRYPTO("drbg_pr_sha512");
720MODULE_ALIAS_CRYPTO("drbg_nopr_sha512");
721MODULE_ALIAS_CRYPTO("drbg_pr_sha384");
722MODULE_ALIAS_CRYPTO("drbg_nopr_sha384");
723MODULE_ALIAS_CRYPTO("drbg_pr_sha256");
724MODULE_ALIAS_CRYPTO("drbg_nopr_sha256");
725MODULE_ALIAS_CRYPTO("drbg_pr_sha1");
726MODULE_ALIAS_CRYPTO("drbg_nopr_sha1");
Stephan Mueller62b62b62014-11-04 03:08:09 +0100727
Stephan Mueller541af942014-05-31 15:44:17 +0200728/*
Stephan Mueller41a84982014-10-14 21:50:13 +0200729 * Increment buffer
730 *
731 * @dst buffer to increment
732 * @add value to add
733 */
734static inline void drbg_add_buf(unsigned char *dst, size_t dstlen,
735 const unsigned char *add, size_t addlen)
736{
737 /* implied: dstlen > addlen */
738 unsigned char *dstptr;
739 const unsigned char *addptr;
740 unsigned int remainder = 0;
741 size_t len = addlen;
742
743 dstptr = dst + (dstlen-1);
744 addptr = add + (addlen-1);
745 while (len) {
746 remainder += *dstptr + *addptr;
747 *dstptr = remainder & 0xff;
748 remainder >>= 8;
749 len--; dstptr--; addptr--;
750 }
751 len = dstlen - addlen;
752 while (len && remainder > 0) {
753 remainder = *dstptr + 1;
754 *dstptr = remainder & 0xff;
755 remainder >>= 8;
756 len--; dstptr--;
757 }
758}
759
760/*
Stephan Mueller541af942014-05-31 15:44:17 +0200761 * scratchpad usage: as drbg_hash_update and drbg_hash_df are used
762 * interlinked, the scratchpad is used as follows:
763 * drbg_hash_update
764 * start: drbg->scratchpad
765 * length: drbg_statelen(drbg)
766 * drbg_hash_df:
767 * start: drbg->scratchpad + drbg_statelen(drbg)
768 * length: drbg_blocklen(drbg)
769 *
770 * drbg_hash_process_addtl uses the scratchpad, but fully completes
771 * before either of the functions mentioned before are invoked. Therefore,
772 * drbg_hash_process_addtl does not need to be specifically considered.
773 */
774
775/* Derivation Function for Hash DRBG as defined in 10.4.1 */
776static int drbg_hash_df(struct drbg_state *drbg,
777 unsigned char *outval, size_t outlen,
Stephan Mueller8c987162014-06-28 21:58:24 +0200778 struct list_head *entropylist)
Stephan Mueller541af942014-05-31 15:44:17 +0200779{
780 int ret = 0;
781 size_t len = 0;
782 unsigned char input[5];
783 unsigned char *tmp = drbg->scratchpad + drbg_statelen(drbg);
Stephan Mueller8c987162014-06-28 21:58:24 +0200784 struct drbg_string data;
Stephan Mueller541af942014-05-31 15:44:17 +0200785
Stephan Mueller541af942014-05-31 15:44:17 +0200786 /* 10.4.1 step 3 */
787 input[0] = 1;
Stephan Mueller72f3e002014-08-17 17:37:34 +0200788 drbg_cpu_to_be32((outlen * 8), &input[1]);
Stephan Mueller541af942014-05-31 15:44:17 +0200789
790 /* 10.4.1 step 4.1 -- concatenation of data for input into hash */
Stephan Mueller8c987162014-06-28 21:58:24 +0200791 drbg_string_fill(&data, input, 5);
792 list_add(&data.list, entropylist);
Stephan Mueller541af942014-05-31 15:44:17 +0200793
794 /* 10.4.1 step 4 */
795 while (len < outlen) {
796 short blocklen = 0;
797 /* 10.4.1 step 4.1 */
Stephan Mueller4218ebe2016-03-28 16:47:55 +0200798 ret = drbg_kcapi_hash(drbg, tmp, entropylist);
Stephan Mueller541af942014-05-31 15:44:17 +0200799 if (ret)
800 goto out;
801 /* 10.4.1 step 4.2 */
802 input[0]++;
803 blocklen = (drbg_blocklen(drbg) < (outlen - len)) ?
804 drbg_blocklen(drbg) : (outlen - len);
805 memcpy(outval + len, tmp, blocklen);
806 len += blocklen;
807 }
808
809out:
Herbert Xu1471f092015-01-05 10:44:09 +1100810 memset(tmp, 0, drbg_blocklen(drbg));
Stephan Mueller541af942014-05-31 15:44:17 +0200811 return ret;
812}
813
814/* update function for Hash DRBG as defined in 10.1.1.2 / 10.1.1.3 */
Stephan Mueller8c987162014-06-28 21:58:24 +0200815static int drbg_hash_update(struct drbg_state *drbg, struct list_head *seed,
Stephan Mueller541af942014-05-31 15:44:17 +0200816 int reseed)
817{
818 int ret = 0;
819 struct drbg_string data1, data2;
Stephan Mueller8c987162014-06-28 21:58:24 +0200820 LIST_HEAD(datalist);
821 LIST_HEAD(datalist2);
Stephan Mueller541af942014-05-31 15:44:17 +0200822 unsigned char *V = drbg->scratchpad;
823 unsigned char prefix = DRBG_PREFIX1;
824
Stephan Mueller541af942014-05-31 15:44:17 +0200825 if (!seed)
826 return -EINVAL;
827
828 if (reseed) {
829 /* 10.1.1.3 step 1 */
830 memcpy(V, drbg->V, drbg_statelen(drbg));
831 drbg_string_fill(&data1, &prefix, 1);
Stephan Mueller8c987162014-06-28 21:58:24 +0200832 list_add_tail(&data1.list, &datalist);
Stephan Mueller541af942014-05-31 15:44:17 +0200833 drbg_string_fill(&data2, V, drbg_statelen(drbg));
Stephan Mueller8c987162014-06-28 21:58:24 +0200834 list_add_tail(&data2.list, &datalist);
Stephan Mueller541af942014-05-31 15:44:17 +0200835 }
Stephan Mueller8c987162014-06-28 21:58:24 +0200836 list_splice_tail(seed, &datalist);
Stephan Mueller541af942014-05-31 15:44:17 +0200837
838 /* 10.1.1.2 / 10.1.1.3 step 2 and 3 */
Stephan Mueller8c987162014-06-28 21:58:24 +0200839 ret = drbg_hash_df(drbg, drbg->V, drbg_statelen(drbg), &datalist);
Stephan Mueller541af942014-05-31 15:44:17 +0200840 if (ret)
841 goto out;
842
843 /* 10.1.1.2 / 10.1.1.3 step 4 */
844 prefix = DRBG_PREFIX0;
845 drbg_string_fill(&data1, &prefix, 1);
Stephan Mueller8c987162014-06-28 21:58:24 +0200846 list_add_tail(&data1.list, &datalist2);
Stephan Mueller541af942014-05-31 15:44:17 +0200847 drbg_string_fill(&data2, drbg->V, drbg_statelen(drbg));
Stephan Mueller8c987162014-06-28 21:58:24 +0200848 list_add_tail(&data2.list, &datalist2);
Stephan Mueller541af942014-05-31 15:44:17 +0200849 /* 10.1.1.2 / 10.1.1.3 step 4 */
Stephan Mueller8c987162014-06-28 21:58:24 +0200850 ret = drbg_hash_df(drbg, drbg->C, drbg_statelen(drbg), &datalist2);
Stephan Mueller541af942014-05-31 15:44:17 +0200851
852out:
Herbert Xu1471f092015-01-05 10:44:09 +1100853 memset(drbg->scratchpad, 0, drbg_statelen(drbg));
Stephan Mueller541af942014-05-31 15:44:17 +0200854 return ret;
855}
856
857/* processing of additional information string for Hash DRBG */
858static int drbg_hash_process_addtl(struct drbg_state *drbg,
Stephan Mueller27e4de22014-07-06 02:25:36 +0200859 struct list_head *addtl)
Stephan Mueller541af942014-05-31 15:44:17 +0200860{
861 int ret = 0;
862 struct drbg_string data1, data2;
Stephan Mueller8c987162014-06-28 21:58:24 +0200863 LIST_HEAD(datalist);
Stephan Mueller541af942014-05-31 15:44:17 +0200864 unsigned char prefix = DRBG_PREFIX2;
865
Stephan Mueller541af942014-05-31 15:44:17 +0200866 /* 10.1.1.4 step 2 */
Stephan Mueller27e4de22014-07-06 02:25:36 +0200867 if (!addtl || list_empty(addtl))
Stephan Mueller541af942014-05-31 15:44:17 +0200868 return 0;
869
870 /* 10.1.1.4 step 2a */
871 drbg_string_fill(&data1, &prefix, 1);
872 drbg_string_fill(&data2, drbg->V, drbg_statelen(drbg));
Stephan Mueller8c987162014-06-28 21:58:24 +0200873 list_add_tail(&data1.list, &datalist);
874 list_add_tail(&data2.list, &datalist);
Stephan Mueller27e4de22014-07-06 02:25:36 +0200875 list_splice_tail(addtl, &datalist);
Stephan Mueller4218ebe2016-03-28 16:47:55 +0200876 ret = drbg_kcapi_hash(drbg, drbg->scratchpad, &datalist);
Stephan Mueller541af942014-05-31 15:44:17 +0200877 if (ret)
878 goto out;
879
880 /* 10.1.1.4 step 2b */
881 drbg_add_buf(drbg->V, drbg_statelen(drbg),
882 drbg->scratchpad, drbg_blocklen(drbg));
883
884out:
Herbert Xu1471f092015-01-05 10:44:09 +1100885 memset(drbg->scratchpad, 0, drbg_blocklen(drbg));
Stephan Mueller541af942014-05-31 15:44:17 +0200886 return ret;
887}
888
889/* Hashgen defined in 10.1.1.4 */
890static int drbg_hash_hashgen(struct drbg_state *drbg,
891 unsigned char *buf,
892 unsigned int buflen)
893{
894 int len = 0;
895 int ret = 0;
896 unsigned char *src = drbg->scratchpad;
897 unsigned char *dst = drbg->scratchpad + drbg_statelen(drbg);
898 struct drbg_string data;
Stephan Mueller8c987162014-06-28 21:58:24 +0200899 LIST_HEAD(datalist);
Stephan Mueller541af942014-05-31 15:44:17 +0200900
Stephan Mueller541af942014-05-31 15:44:17 +0200901 /* 10.1.1.4 step hashgen 2 */
902 memcpy(src, drbg->V, drbg_statelen(drbg));
903
904 drbg_string_fill(&data, src, drbg_statelen(drbg));
Stephan Mueller8c987162014-06-28 21:58:24 +0200905 list_add_tail(&data.list, &datalist);
Stephan Mueller541af942014-05-31 15:44:17 +0200906 while (len < buflen) {
907 unsigned int outlen = 0;
908 /* 10.1.1.4 step hashgen 4.1 */
Stephan Mueller4218ebe2016-03-28 16:47:55 +0200909 ret = drbg_kcapi_hash(drbg, dst, &datalist);
Stephan Mueller541af942014-05-31 15:44:17 +0200910 if (ret) {
911 len = ret;
912 goto out;
913 }
914 outlen = (drbg_blocklen(drbg) < (buflen - len)) ?
915 drbg_blocklen(drbg) : (buflen - len);
Stephan Mueller541af942014-05-31 15:44:17 +0200916 /* 10.1.1.4 step hashgen 4.2 */
917 memcpy(buf + len, dst, outlen);
918 len += outlen;
919 /* 10.1.1.4 hashgen step 4.3 */
920 if (len < buflen)
Stephan Mueller41a84982014-10-14 21:50:13 +0200921 crypto_inc(src, drbg_statelen(drbg));
Stephan Mueller541af942014-05-31 15:44:17 +0200922 }
923
924out:
Herbert Xu1471f092015-01-05 10:44:09 +1100925 memset(drbg->scratchpad, 0,
Stephan Mueller541af942014-05-31 15:44:17 +0200926 (drbg_statelen(drbg) + drbg_blocklen(drbg)));
927 return len;
928}
929
930/* generate function for Hash DRBG as defined in 10.1.1.4 */
931static int drbg_hash_generate(struct drbg_state *drbg,
932 unsigned char *buf, unsigned int buflen,
Stephan Mueller27e4de22014-07-06 02:25:36 +0200933 struct list_head *addtl)
Stephan Mueller541af942014-05-31 15:44:17 +0200934{
935 int len = 0;
936 int ret = 0;
Stephan Mueller72f3e002014-08-17 17:37:34 +0200937 union {
938 unsigned char req[8];
Stephan Mueller7c8ae032014-08-26 09:32:24 +0200939 __be64 req_int;
Stephan Mueller72f3e002014-08-17 17:37:34 +0200940 } u;
Stephan Mueller541af942014-05-31 15:44:17 +0200941 unsigned char prefix = DRBG_PREFIX3;
942 struct drbg_string data1, data2;
Stephan Mueller8c987162014-06-28 21:58:24 +0200943 LIST_HEAD(datalist);
Stephan Mueller541af942014-05-31 15:44:17 +0200944
945 /* 10.1.1.4 step 2 */
946 ret = drbg_hash_process_addtl(drbg, addtl);
947 if (ret)
948 return ret;
949 /* 10.1.1.4 step 3 */
950 len = drbg_hash_hashgen(drbg, buf, buflen);
951
952 /* this is the value H as documented in 10.1.1.4 */
Stephan Mueller541af942014-05-31 15:44:17 +0200953 /* 10.1.1.4 step 4 */
954 drbg_string_fill(&data1, &prefix, 1);
Stephan Mueller8c987162014-06-28 21:58:24 +0200955 list_add_tail(&data1.list, &datalist);
Stephan Mueller541af942014-05-31 15:44:17 +0200956 drbg_string_fill(&data2, drbg->V, drbg_statelen(drbg));
Stephan Mueller8c987162014-06-28 21:58:24 +0200957 list_add_tail(&data2.list, &datalist);
Stephan Mueller4218ebe2016-03-28 16:47:55 +0200958 ret = drbg_kcapi_hash(drbg, drbg->scratchpad, &datalist);
Stephan Mueller541af942014-05-31 15:44:17 +0200959 if (ret) {
960 len = ret;
961 goto out;
962 }
963
964 /* 10.1.1.4 step 5 */
965 drbg_add_buf(drbg->V, drbg_statelen(drbg),
966 drbg->scratchpad, drbg_blocklen(drbg));
967 drbg_add_buf(drbg->V, drbg_statelen(drbg),
968 drbg->C, drbg_statelen(drbg));
Stephan Mueller72f3e002014-08-17 17:37:34 +0200969 u.req_int = cpu_to_be64(drbg->reseed_ctr);
970 drbg_add_buf(drbg->V, drbg_statelen(drbg), u.req, 8);
Stephan Mueller541af942014-05-31 15:44:17 +0200971
972out:
Herbert Xu1471f092015-01-05 10:44:09 +1100973 memset(drbg->scratchpad, 0, drbg_blocklen(drbg));
Stephan Mueller541af942014-05-31 15:44:17 +0200974 return len;
975}
976
977/*
978 * scratchpad usage: as update and generate are used isolated, both
979 * can use the scratchpad
980 */
Julia Lawalle4bc02a2015-12-07 21:36:57 +0100981static const struct drbg_state_ops drbg_hash_ops = {
Stephan Mueller541af942014-05-31 15:44:17 +0200982 .update = drbg_hash_update,
983 .generate = drbg_hash_generate,
984 .crypto_init = drbg_init_hash_kernel,
985 .crypto_fini = drbg_fini_hash_kernel,
986};
987#endif /* CONFIG_CRYPTO_DRBG_HASH */
988
989/******************************************************************
990 * Functions common for DRBG implementations
991 ******************************************************************/
992
Stephan Mueller3d6a5f72015-05-25 15:09:14 +0200993static inline int __drbg_seed(struct drbg_state *drbg, struct list_head *seed,
994 int reseed)
995{
996 int ret = drbg->d_ops->update(drbg, seed, reseed);
997
998 if (ret)
999 return ret;
1000
1001 drbg->seeded = true;
1002 /* 10.1.1.2 / 10.1.1.3 step 5 */
1003 drbg->reseed_ctr = 1;
1004
1005 return ret;
1006}
1007
Stephan Mueller4c787992015-05-25 15:09:36 +02001008static void drbg_async_seed(struct work_struct *work)
1009{
1010 struct drbg_string data;
1011 LIST_HEAD(seedlist);
1012 struct drbg_state *drbg = container_of(work, struct drbg_state,
1013 seed_work);
Stephan Mueller57225e62015-06-09 21:55:38 +08001014 unsigned int entropylen = drbg_sec_strength(drbg->core->flags);
1015 unsigned char entropy[32];
Stephan Mueller4c787992015-05-25 15:09:36 +02001016
Stephan Mueller57225e62015-06-09 21:55:38 +08001017 BUG_ON(!entropylen);
1018 BUG_ON(entropylen > sizeof(entropy));
1019 get_random_bytes(entropy, entropylen);
Stephan Mueller4c787992015-05-25 15:09:36 +02001020
Stephan Mueller57225e62015-06-09 21:55:38 +08001021 drbg_string_fill(&data, entropy, entropylen);
Stephan Mueller4c787992015-05-25 15:09:36 +02001022 list_add_tail(&data.list, &seedlist);
Stephan Mueller57225e62015-06-09 21:55:38 +08001023
Stephan Mueller4c787992015-05-25 15:09:36 +02001024 mutex_lock(&drbg->drbg_mutex);
Stephan Mueller57225e62015-06-09 21:55:38 +08001025
1026 /* If nonblocking pool is initialized, deactivate Jitter RNG */
1027 crypto_free_rng(drbg->jent);
1028 drbg->jent = NULL;
1029
1030 /* Set seeded to false so that if __drbg_seed fails the
1031 * next generate call will trigger a reseed.
1032 */
1033 drbg->seeded = false;
1034
1035 __drbg_seed(drbg, &seedlist, true);
1036
Stephan Mueller42ea5072015-06-10 03:33:37 +02001037 if (drbg->seeded)
1038 drbg->reseed_threshold = drbg_max_requests(drbg);
1039
Stephan Mueller4c787992015-05-25 15:09:36 +02001040 mutex_unlock(&drbg->drbg_mutex);
Stephan Mueller57225e62015-06-09 21:55:38 +08001041
1042 memzero_explicit(entropy, entropylen);
Stephan Mueller4c787992015-05-25 15:09:36 +02001043}
1044
Stephan Mueller541af942014-05-31 15:44:17 +02001045/*
1046 * Seeding or reseeding of the DRBG
1047 *
1048 * @drbg: DRBG state struct
1049 * @pers: personalization / additional information buffer
1050 * @reseed: 0 for initial seed process, 1 for reseeding
1051 *
1052 * return:
1053 * 0 on success
1054 * error value otherwise
1055 */
1056static int drbg_seed(struct drbg_state *drbg, struct drbg_string *pers,
1057 bool reseed)
1058{
Stephan Mueller57225e62015-06-09 21:55:38 +08001059 int ret;
1060 unsigned char entropy[((32 + 16) * 2)];
1061 unsigned int entropylen = drbg_sec_strength(drbg->core->flags);
Stephan Mueller541af942014-05-31 15:44:17 +02001062 struct drbg_string data1;
Stephan Mueller8c987162014-06-28 21:58:24 +02001063 LIST_HEAD(seedlist);
Stephan Mueller541af942014-05-31 15:44:17 +02001064
1065 /* 9.1 / 9.2 / 9.3.1 step 3 */
1066 if (pers && pers->len > (drbg_max_addtl(drbg))) {
Stephan Muellera9089572014-07-06 02:24:03 +02001067 pr_devel("DRBG: personalization string too long %zu\n",
Stephan Mueller541af942014-05-31 15:44:17 +02001068 pers->len);
1069 return -EINVAL;
1070 }
1071
Herbert Xu8fded592015-04-21 10:46:41 +08001072 if (list_empty(&drbg->test_data.list)) {
1073 drbg_string_fill(&data1, drbg->test_data.buf,
1074 drbg->test_data.len);
Stephan Mueller541af942014-05-31 15:44:17 +02001075 pr_devel("DRBG: using test entropy\n");
1076 } else {
Stephan Mueller57225e62015-06-09 21:55:38 +08001077 /*
1078 * Gather entropy equal to the security strength of the DRBG.
1079 * With a derivation function, a nonce is required in addition
1080 * to the entropy. A nonce must be at least 1/2 of the security
1081 * strength of the DRBG in size. Thus, entropy + nonce is 3/2
1082 * of the strength. The consideration of a nonce is only
1083 * applicable during initial seeding.
1084 */
1085 BUG_ON(!entropylen);
1086 if (!reseed)
1087 entropylen = ((entropylen + 1) / 2) * 3;
1088 BUG_ON((entropylen * 2) > sizeof(entropy));
Stephan Muellerb8ec5ba2015-05-25 15:09:59 +02001089
Stephan Mueller57225e62015-06-09 21:55:38 +08001090 /* Get seed from in-kernel /dev/urandom */
1091 get_random_bytes(entropy, entropylen);
1092
1093 if (!drbg->jent) {
1094 drbg_string_fill(&data1, entropy, entropylen);
1095 pr_devel("DRBG: (re)seeding with %u bytes of entropy\n",
1096 entropylen);
Stephan Muellerb8ec5ba2015-05-25 15:09:59 +02001097 } else {
Stephan Mueller57225e62015-06-09 21:55:38 +08001098 /* Get seed from Jitter RNG */
1099 ret = crypto_rng_get_bytes(drbg->jent,
1100 entropy + entropylen,
1101 entropylen);
1102 if (ret) {
1103 pr_devel("DRBG: jent failed with %d\n", ret);
1104 return ret;
1105 }
1106
1107 drbg_string_fill(&data1, entropy, entropylen * 2);
1108 pr_devel("DRBG: (re)seeding with %u bytes of entropy\n",
1109 entropylen * 2);
Stephan Muellerb8ec5ba2015-05-25 15:09:59 +02001110 }
Stephan Mueller541af942014-05-31 15:44:17 +02001111 }
Stephan Mueller8c987162014-06-28 21:58:24 +02001112 list_add_tail(&data1.list, &seedlist);
Stephan Mueller541af942014-05-31 15:44:17 +02001113
1114 /*
1115 * concatenation of entropy with personalization str / addtl input)
1116 * the variable pers is directly handed in by the caller, so check its
1117 * contents whether it is appropriate
1118 */
Stephan Mueller8c987162014-06-28 21:58:24 +02001119 if (pers && pers->buf && 0 < pers->len) {
1120 list_add_tail(&pers->list, &seedlist);
Stephan Mueller541af942014-05-31 15:44:17 +02001121 pr_devel("DRBG: using personalization string\n");
1122 }
1123
Stephan Muellere6c02442014-08-17 17:39:31 +02001124 if (!reseed) {
1125 memset(drbg->V, 0, drbg_statelen(drbg));
1126 memset(drbg->C, 0, drbg_statelen(drbg));
1127 }
1128
Stephan Mueller3d6a5f72015-05-25 15:09:14 +02001129 ret = __drbg_seed(drbg, &seedlist, reseed);
1130
Stephan Mueller57225e62015-06-09 21:55:38 +08001131 memzero_explicit(entropy, entropylen * 2);
Stephan Mueller541af942014-05-31 15:44:17 +02001132
Stephan Mueller541af942014-05-31 15:44:17 +02001133 return ret;
1134}
1135
1136/* Free all substructures in a DRBG state without the DRBG state structure */
1137static inline void drbg_dealloc_state(struct drbg_state *drbg)
1138{
1139 if (!drbg)
1140 return;
Stephan Mueller46f64f62014-08-17 17:37:59 +02001141 kzfree(drbg->V);
Stephan Mueller3cfc3b92016-06-14 07:35:13 +02001142 drbg->Vbuf = NULL;
Stephan Mueller46f64f62014-08-17 17:37:59 +02001143 kzfree(drbg->C);
Stephan Mueller3cfc3b92016-06-14 07:35:13 +02001144 drbg->Cbuf = NULL;
1145 kzfree(drbg->scratchpadbuf);
1146 drbg->scratchpadbuf = NULL;
Stephan Mueller541af942014-05-31 15:44:17 +02001147 drbg->reseed_ctr = 0;
Herbert Xu2a57e422015-04-20 11:29:15 +08001148 drbg->d_ops = NULL;
1149 drbg->core = NULL;
Stephan Mueller541af942014-05-31 15:44:17 +02001150}
1151
1152/*
1153 * Allocate all sub-structures for a DRBG state.
1154 * The DRBG state structure must already be allocated.
1155 */
1156static inline int drbg_alloc_state(struct drbg_state *drbg)
1157{
1158 int ret = -ENOMEM;
1159 unsigned int sb_size = 0;
1160
Herbert Xu2a57e422015-04-20 11:29:15 +08001161 switch (drbg->core->flags & DRBG_TYPE_MASK) {
1162#ifdef CONFIG_CRYPTO_DRBG_HMAC
1163 case DRBG_HMAC:
1164 drbg->d_ops = &drbg_hmac_ops;
1165 break;
1166#endif /* CONFIG_CRYPTO_DRBG_HMAC */
1167#ifdef CONFIG_CRYPTO_DRBG_HASH
1168 case DRBG_HASH:
1169 drbg->d_ops = &drbg_hash_ops;
1170 break;
1171#endif /* CONFIG_CRYPTO_DRBG_HASH */
1172#ifdef CONFIG_CRYPTO_DRBG_CTR
1173 case DRBG_CTR:
1174 drbg->d_ops = &drbg_ctr_ops;
1175 break;
1176#endif /* CONFIG_CRYPTO_DRBG_CTR */
1177 default:
1178 ret = -EOPNOTSUPP;
1179 goto err;
1180 }
1181
Stephan Mueller3cfc3b92016-06-14 07:35:13 +02001182 ret = drbg->d_ops->crypto_init(drbg);
1183 if (ret < 0)
Stephan Mueller541af942014-05-31 15:44:17 +02001184 goto err;
Stephan Mueller3cfc3b92016-06-14 07:35:13 +02001185
1186 drbg->Vbuf = kmalloc(drbg_statelen(drbg) + ret, GFP_KERNEL);
1187 if (!drbg->Vbuf)
1188 goto fini;
1189 drbg->V = PTR_ALIGN(drbg->Vbuf, ret + 1);
1190 drbg->Cbuf = kmalloc(drbg_statelen(drbg) + ret, GFP_KERNEL);
1191 if (!drbg->Cbuf)
1192 goto fini;
1193 drbg->C = PTR_ALIGN(drbg->Cbuf, ret + 1);
Stephan Mueller541af942014-05-31 15:44:17 +02001194 /* scratchpad is only generated for CTR and Hash */
1195 if (drbg->core->flags & DRBG_HMAC)
1196 sb_size = 0;
1197 else if (drbg->core->flags & DRBG_CTR)
1198 sb_size = drbg_statelen(drbg) + drbg_blocklen(drbg) + /* temp */
1199 drbg_statelen(drbg) + /* df_data */
1200 drbg_blocklen(drbg) + /* pad */
1201 drbg_blocklen(drbg) + /* iv */
Stephan Mueller8fecaad2014-07-01 17:08:48 +02001202 drbg_statelen(drbg) + drbg_blocklen(drbg); /* temp */
Stephan Mueller541af942014-05-31 15:44:17 +02001203 else
1204 sb_size = drbg_statelen(drbg) + drbg_blocklen(drbg);
1205
1206 if (0 < sb_size) {
Stephan Mueller3cfc3b92016-06-14 07:35:13 +02001207 drbg->scratchpadbuf = kzalloc(sb_size + ret, GFP_KERNEL);
1208 if (!drbg->scratchpadbuf)
1209 goto fini;
1210 drbg->scratchpad = PTR_ALIGN(drbg->scratchpadbuf, ret + 1);
Stephan Mueller541af942014-05-31 15:44:17 +02001211 }
Stephan Mueller3d6a5f72015-05-25 15:09:14 +02001212
Stephan Mueller541af942014-05-31 15:44:17 +02001213 return 0;
1214
Stephan Mueller3cfc3b92016-06-14 07:35:13 +02001215fini:
1216 drbg->d_ops->crypto_fini(drbg);
Stephan Mueller541af942014-05-31 15:44:17 +02001217err:
1218 drbg_dealloc_state(drbg);
1219 return ret;
1220}
1221
Stephan Mueller541af942014-05-31 15:44:17 +02001222/*************************************************************************
1223 * DRBG interface functions
1224 *************************************************************************/
1225
1226/*
1227 * DRBG generate function as required by SP800-90A - this function
1228 * generates random numbers
1229 *
1230 * @drbg DRBG state handle
1231 * @buf Buffer where to store the random numbers -- the buffer must already
1232 * be pre-allocated by caller
1233 * @buflen Length of output buffer - this value defines the number of random
1234 * bytes pulled from DRBG
1235 * @addtl Additional input that is mixed into state, may be NULL -- note
1236 * the entropy is pulled by the DRBG internally unconditionally
1237 * as defined in SP800-90A. The additional input is mixed into
1238 * the state in addition to the pulled entropy.
1239 *
Stephan Muellercde001e2015-03-06 08:26:31 +01001240 * return: 0 when all bytes are generated; < 0 in case of an error
Stephan Mueller541af942014-05-31 15:44:17 +02001241 */
1242static int drbg_generate(struct drbg_state *drbg,
1243 unsigned char *buf, unsigned int buflen,
1244 struct drbg_string *addtl)
1245{
1246 int len = 0;
Stephan Mueller27e4de22014-07-06 02:25:36 +02001247 LIST_HEAD(addtllist);
Stephan Mueller541af942014-05-31 15:44:17 +02001248
Herbert Xu2a57e422015-04-20 11:29:15 +08001249 if (!drbg->core) {
1250 pr_devel("DRBG: not yet seeded\n");
1251 return -EINVAL;
1252 }
Stephan Mueller541af942014-05-31 15:44:17 +02001253 if (0 == buflen || !buf) {
1254 pr_devel("DRBG: no output buffer provided\n");
1255 return -EINVAL;
1256 }
1257 if (addtl && NULL == addtl->buf && 0 < addtl->len) {
1258 pr_devel("DRBG: wrong format of additional information\n");
1259 return -EINVAL;
1260 }
1261
Stephan Mueller541af942014-05-31 15:44:17 +02001262 /* 9.3.1 step 2 */
1263 len = -EINVAL;
Stephan Mueller76899a42015-04-18 19:36:17 +02001264 if (buflen > (drbg_max_request_bytes(drbg))) {
Stephan Mueller541af942014-05-31 15:44:17 +02001265 pr_devel("DRBG: requested random numbers too large %u\n",
1266 buflen);
1267 goto err;
1268 }
1269
1270 /* 9.3.1 step 3 is implicit with the chosen DRBG */
1271
1272 /* 9.3.1 step 4 */
Stephan Mueller76899a42015-04-18 19:36:17 +02001273 if (addtl && addtl->len > (drbg_max_addtl(drbg))) {
Stephan Mueller541af942014-05-31 15:44:17 +02001274 pr_devel("DRBG: additional information string too long %zu\n",
1275 addtl->len);
1276 goto err;
1277 }
1278 /* 9.3.1 step 5 is implicit with the chosen DRBG */
1279
1280 /*
1281 * 9.3.1 step 6 and 9 supplemented by 9.3.2 step c is implemented
1282 * here. The spec is a bit convoluted here, we make it simpler.
1283 */
Stephan Mueller42ea5072015-06-10 03:33:37 +02001284 if (drbg->reseed_threshold < drbg->reseed_ctr)
Stephan Mueller76899a42015-04-18 19:36:17 +02001285 drbg->seeded = false;
Stephan Mueller541af942014-05-31 15:44:17 +02001286
Stephan Mueller76899a42015-04-18 19:36:17 +02001287 if (drbg->pr || !drbg->seeded) {
Stephan Mueller541af942014-05-31 15:44:17 +02001288 pr_devel("DRBG: reseeding before generation (prediction "
1289 "resistance: %s, state %s)\n",
1290 drbg->pr ? "true" : "false",
1291 drbg->seeded ? "seeded" : "unseeded");
1292 /* 9.3.1 steps 7.1 through 7.3 */
Stephan Mueller76899a42015-04-18 19:36:17 +02001293 len = drbg_seed(drbg, addtl, true);
Stephan Mueller541af942014-05-31 15:44:17 +02001294 if (len)
1295 goto err;
1296 /* 9.3.1 step 7.4 */
1297 addtl = NULL;
1298 }
Stephan Mueller27e4de22014-07-06 02:25:36 +02001299
Stephan Mueller27e4de22014-07-06 02:25:36 +02001300 if (addtl && 0 < addtl->len)
1301 list_add_tail(&addtl->list, &addtllist);
Stephan Mueller541af942014-05-31 15:44:17 +02001302 /* 9.3.1 step 8 and 10 */
Stephan Mueller76899a42015-04-18 19:36:17 +02001303 len = drbg->d_ops->generate(drbg, buf, buflen, &addtllist);
Stephan Mueller541af942014-05-31 15:44:17 +02001304
1305 /* 10.1.1.4 step 6, 10.1.2.5 step 7, 10.2.1.5.2 step 7 */
Stephan Mueller76899a42015-04-18 19:36:17 +02001306 drbg->reseed_ctr++;
Stephan Mueller541af942014-05-31 15:44:17 +02001307 if (0 >= len)
1308 goto err;
1309
1310 /*
1311 * Section 11.3.3 requires to re-perform self tests after some
1312 * generated random numbers. The chosen value after which self
1313 * test is performed is arbitrary, but it should be reasonable.
1314 * However, we do not perform the self tests because of the following
1315 * reasons: it is mathematically impossible that the initial self tests
1316 * were successfully and the following are not. If the initial would
1317 * pass and the following would not, the kernel integrity is violated.
1318 * In this case, the entire kernel operation is questionable and it
1319 * is unlikely that the integrity violation only affects the
1320 * correct operation of the DRBG.
1321 *
1322 * Albeit the following code is commented out, it is provided in
1323 * case somebody has a need to implement the test of 11.3.3.
1324 */
1325#if 0
Stephan Mueller76899a42015-04-18 19:36:17 +02001326 if (drbg->reseed_ctr && !(drbg->reseed_ctr % 4096)) {
Stephan Mueller541af942014-05-31 15:44:17 +02001327 int err = 0;
1328 pr_devel("DRBG: start to perform self test\n");
1329 if (drbg->core->flags & DRBG_HMAC)
1330 err = alg_test("drbg_pr_hmac_sha256",
1331 "drbg_pr_hmac_sha256", 0, 0);
1332 else if (drbg->core->flags & DRBG_CTR)
1333 err = alg_test("drbg_pr_ctr_aes128",
1334 "drbg_pr_ctr_aes128", 0, 0);
1335 else
1336 err = alg_test("drbg_pr_sha256",
1337 "drbg_pr_sha256", 0, 0);
1338 if (err) {
1339 pr_err("DRBG: periodical self test failed\n");
1340 /*
1341 * uninstantiate implies that from now on, only errors
1342 * are returned when reusing this DRBG cipher handle
1343 */
1344 drbg_uninstantiate(drbg);
Stephan Mueller541af942014-05-31 15:44:17 +02001345 return 0;
1346 } else {
1347 pr_devel("DRBG: self test successful\n");
1348 }
1349 }
1350#endif
1351
Stephan Muellercde001e2015-03-06 08:26:31 +01001352 /*
1353 * All operations were successful, return 0 as mandated by
1354 * the kernel crypto API interface.
1355 */
1356 len = 0;
Stephan Mueller541af942014-05-31 15:44:17 +02001357err:
Stephan Mueller541af942014-05-31 15:44:17 +02001358 return len;
1359}
1360
1361/*
1362 * Wrapper around drbg_generate which can pull arbitrary long strings
1363 * from the DRBG without hitting the maximum request limitation.
1364 *
1365 * Parameters: see drbg_generate
1366 * Return codes: see drbg_generate -- if one drbg_generate request fails,
1367 * the entire drbg_generate_long request fails
1368 */
1369static int drbg_generate_long(struct drbg_state *drbg,
1370 unsigned char *buf, unsigned int buflen,
1371 struct drbg_string *addtl)
1372{
Stephan Mueller082eb102015-04-18 19:35:45 +02001373 unsigned int len = 0;
Stephan Mueller541af942014-05-31 15:44:17 +02001374 unsigned int slice = 0;
1375 do {
Stephan Mueller082eb102015-04-18 19:35:45 +02001376 int err = 0;
Stephan Mueller541af942014-05-31 15:44:17 +02001377 unsigned int chunk = 0;
1378 slice = ((buflen - len) / drbg_max_request_bytes(drbg));
1379 chunk = slice ? drbg_max_request_bytes(drbg) : (buflen - len);
Stephan Mueller76899a42015-04-18 19:36:17 +02001380 mutex_lock(&drbg->drbg_mutex);
Stephan Mueller082eb102015-04-18 19:35:45 +02001381 err = drbg_generate(drbg, buf + len, chunk, addtl);
Stephan Mueller76899a42015-04-18 19:36:17 +02001382 mutex_unlock(&drbg->drbg_mutex);
Stephan Mueller082eb102015-04-18 19:35:45 +02001383 if (0 > err)
1384 return err;
1385 len += chunk;
Stephan Muellerce5481d2014-07-31 21:47:33 +02001386 } while (slice > 0 && (len < buflen));
Stephan Mueller082eb102015-04-18 19:35:45 +02001387 return 0;
Stephan Mueller541af942014-05-31 15:44:17 +02001388}
1389
Stephan Mueller57225e62015-06-09 21:55:38 +08001390static void drbg_schedule_async_seed(struct random_ready_callback *rdy)
1391{
1392 struct drbg_state *drbg = container_of(rdy, struct drbg_state,
1393 random_ready);
1394
1395 schedule_work(&drbg->seed_work);
1396}
1397
1398static int drbg_prepare_hrng(struct drbg_state *drbg)
1399{
1400 int err;
1401
1402 /* We do not need an HRNG in test mode. */
1403 if (list_empty(&drbg->test_data.list))
1404 return 0;
1405
1406 INIT_WORK(&drbg->seed_work, drbg_async_seed);
1407
1408 drbg->random_ready.owner = THIS_MODULE;
1409 drbg->random_ready.func = drbg_schedule_async_seed;
1410
1411 err = add_random_ready_callback(&drbg->random_ready);
1412
1413 switch (err) {
1414 case 0:
1415 break;
1416
1417 case -EALREADY:
1418 err = 0;
1419 /* fall through */
1420
1421 default:
1422 drbg->random_ready.func = NULL;
1423 return err;
1424 }
1425
1426 drbg->jent = crypto_alloc_rng("jitterentropy_rng", 0, 0);
1427
Stephan Mueller42ea5072015-06-10 03:33:37 +02001428 /*
1429 * Require frequent reseeds until the seed source is fully
1430 * initialized.
1431 */
1432 drbg->reseed_threshold = 50;
1433
Stephan Mueller57225e62015-06-09 21:55:38 +08001434 return err;
1435}
1436
Stephan Mueller541af942014-05-31 15:44:17 +02001437/*
1438 * DRBG instantiation function as required by SP800-90A - this function
1439 * sets up the DRBG handle, performs the initial seeding and all sanity
1440 * checks required by SP800-90A
1441 *
1442 * @drbg memory of state -- if NULL, new memory is allocated
1443 * @pers Personalization string that is mixed into state, may be NULL -- note
1444 * the entropy is pulled by the DRBG internally unconditionally
1445 * as defined in SP800-90A. The additional input is mixed into
1446 * the state in addition to the pulled entropy.
1447 * @coreref reference to core
1448 * @pr prediction resistance enabled
1449 *
1450 * return
1451 * 0 on success
1452 * error value otherwise
1453 */
1454static int drbg_instantiate(struct drbg_state *drbg, struct drbg_string *pers,
1455 int coreref, bool pr)
1456{
Herbert Xu2a57e422015-04-20 11:29:15 +08001457 int ret;
1458 bool reseed = true;
Stephan Mueller541af942014-05-31 15:44:17 +02001459
1460 pr_devel("DRBG: Initializing DRBG core %d with prediction resistance "
1461 "%s\n", coreref, pr ? "enabled" : "disabled");
Stephan Mueller76899a42015-04-18 19:36:17 +02001462 mutex_lock(&drbg->drbg_mutex);
Stephan Mueller541af942014-05-31 15:44:17 +02001463
1464 /* 9.1 step 1 is implicit with the selected DRBG type */
1465
1466 /*
1467 * 9.1 step 2 is implicit as caller can select prediction resistance
1468 * and the flag is copied into drbg->flags --
1469 * all DRBG types support prediction resistance
1470 */
1471
1472 /* 9.1 step 4 is implicit in drbg_sec_strength */
1473
Herbert Xu2a57e422015-04-20 11:29:15 +08001474 if (!drbg->core) {
1475 drbg->core = &drbg_cores[coreref];
1476 drbg->pr = pr;
1477 drbg->seeded = false;
Stephan Mueller42ea5072015-06-10 03:33:37 +02001478 drbg->reseed_threshold = drbg_max_requests(drbg);
Stephan Mueller541af942014-05-31 15:44:17 +02001479
Herbert Xu2a57e422015-04-20 11:29:15 +08001480 ret = drbg_alloc_state(drbg);
1481 if (ret)
1482 goto unlock;
1483
Stephan Mueller57225e62015-06-09 21:55:38 +08001484 ret = drbg_prepare_hrng(drbg);
1485 if (ret)
1486 goto free_everything;
1487
1488 if (IS_ERR(drbg->jent)) {
1489 ret = PTR_ERR(drbg->jent);
1490 drbg->jent = NULL;
1491 if (fips_enabled || ret != -ENOENT)
1492 goto free_everything;
1493 pr_info("DRBG: Continuing without Jitter RNG\n");
1494 }
1495
Herbert Xu2a57e422015-04-20 11:29:15 +08001496 reseed = false;
1497 }
1498
1499 ret = drbg_seed(drbg, pers, reseed);
1500
Stephan Mueller57225e62015-06-09 21:55:38 +08001501 if (ret && !reseed)
1502 goto free_everything;
Stephan Mueller541af942014-05-31 15:44:17 +02001503
Stephan Mueller76899a42015-04-18 19:36:17 +02001504 mutex_unlock(&drbg->drbg_mutex);
Herbert Xu2a57e422015-04-20 11:29:15 +08001505 return ret;
Stephan Mueller541af942014-05-31 15:44:17 +02001506
Stephan Mueller76899a42015-04-18 19:36:17 +02001507unlock:
1508 mutex_unlock(&drbg->drbg_mutex);
Stephan Mueller541af942014-05-31 15:44:17 +02001509 return ret;
Stephan Mueller57225e62015-06-09 21:55:38 +08001510
1511free_everything:
1512 mutex_unlock(&drbg->drbg_mutex);
1513 drbg_uninstantiate(drbg);
1514 return ret;
Stephan Mueller541af942014-05-31 15:44:17 +02001515}
1516
1517/*
1518 * DRBG uninstantiate function as required by SP800-90A - this function
1519 * frees all buffers and the DRBG handle
1520 *
1521 * @drbg DRBG state handle
1522 *
1523 * return
1524 * 0 on success
1525 */
1526static int drbg_uninstantiate(struct drbg_state *drbg)
1527{
Stephan Mueller57225e62015-06-09 21:55:38 +08001528 if (drbg->random_ready.func) {
1529 del_random_ready_callback(&drbg->random_ready);
1530 cancel_work_sync(&drbg->seed_work);
1531 crypto_free_rng(drbg->jent);
1532 drbg->jent = NULL;
1533 }
1534
Herbert Xu2a57e422015-04-20 11:29:15 +08001535 if (drbg->d_ops)
1536 drbg->d_ops->crypto_fini(drbg);
Stephan Mueller541af942014-05-31 15:44:17 +02001537 drbg_dealloc_state(drbg);
1538 /* no scrubbing of test_data -- this shall survive an uninstantiate */
Stephan Mueller541af942014-05-31 15:44:17 +02001539 return 0;
1540}
1541
1542/*
1543 * Helper function for setting the test data in the DRBG
1544 *
1545 * @drbg DRBG state handle
Herbert Xu8fded592015-04-21 10:46:41 +08001546 * @data test data
1547 * @len test data length
Stephan Mueller541af942014-05-31 15:44:17 +02001548 */
Herbert Xu8fded592015-04-21 10:46:41 +08001549static void drbg_kcapi_set_entropy(struct crypto_rng *tfm,
1550 const u8 *data, unsigned int len)
Stephan Mueller541af942014-05-31 15:44:17 +02001551{
Herbert Xu8fded592015-04-21 10:46:41 +08001552 struct drbg_state *drbg = crypto_rng_ctx(tfm);
1553
1554 mutex_lock(&drbg->drbg_mutex);
1555 drbg_string_fill(&drbg->test_data, data, len);
Stephan Mueller76899a42015-04-18 19:36:17 +02001556 mutex_unlock(&drbg->drbg_mutex);
Stephan Mueller541af942014-05-31 15:44:17 +02001557}
1558
1559/***************************************************************
1560 * Kernel crypto API cipher invocations requested by DRBG
1561 ***************************************************************/
1562
1563#if defined(CONFIG_CRYPTO_DRBG_HASH) || defined(CONFIG_CRYPTO_DRBG_HMAC)
1564struct sdesc {
1565 struct shash_desc shash;
1566 char ctx[];
1567};
1568
1569static int drbg_init_hash_kernel(struct drbg_state *drbg)
1570{
1571 struct sdesc *sdesc;
1572 struct crypto_shash *tfm;
1573
1574 tfm = crypto_alloc_shash(drbg->core->backend_cra_name, 0, 0);
1575 if (IS_ERR(tfm)) {
Sergey Senozhatsky593dfbd2015-06-10 22:27:48 +09001576 pr_info("DRBG: could not allocate digest TFM handle: %s\n",
1577 drbg->core->backend_cra_name);
Stephan Mueller541af942014-05-31 15:44:17 +02001578 return PTR_ERR(tfm);
1579 }
1580 BUG_ON(drbg_blocklen(drbg) != crypto_shash_digestsize(tfm));
1581 sdesc = kzalloc(sizeof(struct shash_desc) + crypto_shash_descsize(tfm),
1582 GFP_KERNEL);
1583 if (!sdesc) {
1584 crypto_free_shash(tfm);
1585 return -ENOMEM;
1586 }
1587
1588 sdesc->shash.tfm = tfm;
1589 sdesc->shash.flags = 0;
1590 drbg->priv_data = sdesc;
Stephan Mueller3cfc3b92016-06-14 07:35:13 +02001591
1592 return crypto_shash_alignmask(tfm);
Stephan Mueller541af942014-05-31 15:44:17 +02001593}
1594
1595static int drbg_fini_hash_kernel(struct drbg_state *drbg)
1596{
1597 struct sdesc *sdesc = (struct sdesc *)drbg->priv_data;
1598 if (sdesc) {
1599 crypto_free_shash(sdesc->shash.tfm);
1600 kzfree(sdesc);
1601 }
1602 drbg->priv_data = NULL;
1603 return 0;
1604}
1605
Stephan Mueller4218ebe2016-03-28 16:47:55 +02001606static void drbg_kcapi_hmacsetkey(struct drbg_state *drbg,
1607 const unsigned char *key)
1608{
1609 struct sdesc *sdesc = (struct sdesc *)drbg->priv_data;
1610
1611 crypto_shash_setkey(sdesc->shash.tfm, key, drbg_statelen(drbg));
1612}
1613
1614static int drbg_kcapi_hash(struct drbg_state *drbg, unsigned char *outval,
1615 const struct list_head *in)
Stephan Mueller541af942014-05-31 15:44:17 +02001616{
1617 struct sdesc *sdesc = (struct sdesc *)drbg->priv_data;
Stephan Mueller8c987162014-06-28 21:58:24 +02001618 struct drbg_string *input = NULL;
Stephan Mueller541af942014-05-31 15:44:17 +02001619
Stephan Mueller541af942014-05-31 15:44:17 +02001620 crypto_shash_init(&sdesc->shash);
Stephan Mueller8c987162014-06-28 21:58:24 +02001621 list_for_each_entry(input, in, list)
1622 crypto_shash_update(&sdesc->shash, input->buf, input->len);
Stephan Mueller541af942014-05-31 15:44:17 +02001623 return crypto_shash_final(&sdesc->shash, outval);
1624}
1625#endif /* (CONFIG_CRYPTO_DRBG_HASH || CONFIG_CRYPTO_DRBG_HMAC) */
1626
1627#ifdef CONFIG_CRYPTO_DRBG_CTR
Stephan Mueller35591282016-06-14 07:34:13 +02001628static int drbg_fini_sym_kernel(struct drbg_state *drbg)
1629{
1630 struct crypto_cipher *tfm =
1631 (struct crypto_cipher *)drbg->priv_data;
1632 if (tfm)
1633 crypto_free_cipher(tfm);
1634 drbg->priv_data = NULL;
1635
1636 if (drbg->ctr_handle)
1637 crypto_free_skcipher(drbg->ctr_handle);
1638 drbg->ctr_handle = NULL;
1639
1640 if (drbg->ctr_req)
1641 skcipher_request_free(drbg->ctr_req);;
1642 drbg->ctr_req = NULL;
1643
1644 kfree(drbg->ctr_null_value_buf);
1645 drbg->ctr_null_value = NULL;
1646
1647 return 0;
1648}
1649
1650static void drbg_skcipher_cb(struct crypto_async_request *req, int error)
1651{
1652 struct drbg_state *drbg = req->data;
1653
1654 if (error == -EINPROGRESS)
1655 return;
1656 drbg->ctr_async_err = error;
1657 complete(&drbg->ctr_completion);
1658}
1659
1660#define DRBG_CTR_NULL_LEN 128
Stephan Mueller541af942014-05-31 15:44:17 +02001661static int drbg_init_sym_kernel(struct drbg_state *drbg)
1662{
Stephan Mueller04bcbfc2015-03-01 20:39:17 +01001663 struct crypto_cipher *tfm;
Stephan Mueller35591282016-06-14 07:34:13 +02001664 struct crypto_skcipher *sk_tfm;
1665 struct skcipher_request *req;
1666 unsigned int alignmask;
1667 char ctr_name[CRYPTO_MAX_ALG_NAME];
Stephan Mueller541af942014-05-31 15:44:17 +02001668
Stephan Mueller04bcbfc2015-03-01 20:39:17 +01001669 tfm = crypto_alloc_cipher(drbg->core->backend_cra_name, 0, 0);
Stephan Mueller541af942014-05-31 15:44:17 +02001670 if (IS_ERR(tfm)) {
Sergey Senozhatsky593dfbd2015-06-10 22:27:48 +09001671 pr_info("DRBG: could not allocate cipher TFM handle: %s\n",
1672 drbg->core->backend_cra_name);
Stephan Mueller541af942014-05-31 15:44:17 +02001673 return PTR_ERR(tfm);
1674 }
Stephan Mueller04bcbfc2015-03-01 20:39:17 +01001675 BUG_ON(drbg_blocklen(drbg) != crypto_cipher_blocksize(tfm));
Stephan Mueller541af942014-05-31 15:44:17 +02001676 drbg->priv_data = tfm;
Stephan Mueller541af942014-05-31 15:44:17 +02001677
Stephan Mueller35591282016-06-14 07:34:13 +02001678 if (snprintf(ctr_name, CRYPTO_MAX_ALG_NAME, "ctr(%s)",
1679 drbg->core->backend_cra_name) >= CRYPTO_MAX_ALG_NAME) {
1680 drbg_fini_sym_kernel(drbg);
1681 return -EINVAL;
1682 }
1683 sk_tfm = crypto_alloc_skcipher(ctr_name, 0, 0);
1684 if (IS_ERR(sk_tfm)) {
1685 pr_info("DRBG: could not allocate CTR cipher TFM handle: %s\n",
1686 ctr_name);
1687 drbg_fini_sym_kernel(drbg);
1688 return PTR_ERR(sk_tfm);
1689 }
1690 drbg->ctr_handle = sk_tfm;
1691
1692 req = skcipher_request_alloc(sk_tfm, GFP_KERNEL);
1693 if (!req) {
1694 pr_info("DRBG: could not allocate request queue\n");
1695 drbg_fini_sym_kernel(drbg);
1696 return PTR_ERR(req);
1697 }
1698 drbg->ctr_req = req;
1699 skcipher_request_set_callback(req, CRYPTO_TFM_REQ_MAY_BACKLOG,
1700 drbg_skcipher_cb, drbg);
1701
1702 alignmask = crypto_skcipher_alignmask(sk_tfm);
1703 drbg->ctr_null_value_buf = kzalloc(DRBG_CTR_NULL_LEN + alignmask,
1704 GFP_KERNEL);
1705 if (!drbg->ctr_null_value_buf) {
1706 drbg_fini_sym_kernel(drbg);
1707 return -ENOMEM;
1708 }
1709 drbg->ctr_null_value = (u8 *)PTR_ALIGN(drbg->ctr_null_value_buf,
1710 alignmask + 1);
1711
Stephan Mueller3cfc3b92016-06-14 07:35:13 +02001712 return alignmask;
Stephan Mueller541af942014-05-31 15:44:17 +02001713}
1714
Stephan Muellered494d42016-05-31 13:11:57 +02001715static void drbg_kcapi_symsetkey(struct drbg_state *drbg,
1716 const unsigned char *key)
Stephan Mueller541af942014-05-31 15:44:17 +02001717{
Stephan Mueller04bcbfc2015-03-01 20:39:17 +01001718 struct crypto_cipher *tfm =
1719 (struct crypto_cipher *)drbg->priv_data;
Stephan Mueller541af942014-05-31 15:44:17 +02001720
Stephan Mueller04bcbfc2015-03-01 20:39:17 +01001721 crypto_cipher_setkey(tfm, key, (drbg_keylen(drbg)));
Stephan Muellered494d42016-05-31 13:11:57 +02001722}
1723
1724static int drbg_kcapi_sym(struct drbg_state *drbg, unsigned char *outval,
1725 const struct drbg_string *in)
1726{
1727 struct crypto_cipher *tfm =
1728 (struct crypto_cipher *)drbg->priv_data;
1729
Stephan Mueller541af942014-05-31 15:44:17 +02001730 /* there is only component in *in */
Stephan Mueller04bcbfc2015-03-01 20:39:17 +01001731 BUG_ON(in->len < drbg_blocklen(drbg));
1732 crypto_cipher_encrypt_one(tfm, outval, in->buf);
1733 return 0;
Stephan Mueller541af942014-05-31 15:44:17 +02001734}
Stephan Mueller35591282016-06-14 07:34:13 +02001735
1736static int drbg_kcapi_sym_ctr(struct drbg_state *drbg, u8 *outbuf, u32 outlen)
1737{
1738 struct scatterlist sg_in;
1739
1740 sg_init_one(&sg_in, drbg->ctr_null_value, DRBG_CTR_NULL_LEN);
1741
1742 while (outlen) {
1743 u32 cryptlen = min_t(u32, outlen, DRBG_CTR_NULL_LEN);
1744 struct scatterlist sg_out;
1745 int ret;
1746
1747 sg_init_one(&sg_out, outbuf, cryptlen);
1748 skcipher_request_set_crypt(drbg->ctr_req, &sg_in, &sg_out,
1749 cryptlen, drbg->V);
1750 ret = crypto_skcipher_encrypt(drbg->ctr_req);
1751 switch (ret) {
1752 case 0:
1753 break;
1754 case -EINPROGRESS:
1755 case -EBUSY:
1756 ret = wait_for_completion_interruptible(
1757 &drbg->ctr_completion);
1758 if (!ret && !drbg->ctr_async_err) {
1759 reinit_completion(&drbg->ctr_completion);
1760 break;
1761 }
1762 default:
1763 return ret;
1764 }
1765 init_completion(&drbg->ctr_completion);
1766
1767 outlen -= cryptlen;
1768 }
1769
1770 return 0;
1771}
Stephan Mueller541af942014-05-31 15:44:17 +02001772#endif /* CONFIG_CRYPTO_DRBG_CTR */
1773
1774/***************************************************************
1775 * Kernel crypto API interface to register DRBG
1776 ***************************************************************/
1777
1778/*
1779 * Look up the DRBG flags by given kernel crypto API cra_name
1780 * The code uses the drbg_cores definition to do this
1781 *
1782 * @cra_name kernel crypto API cra_name
1783 * @coreref reference to integer which is filled with the pointer to
1784 * the applicable core
1785 * @pr reference for setting prediction resistance
1786 *
1787 * return: flags
1788 */
1789static inline void drbg_convert_tfm_core(const char *cra_driver_name,
1790 int *coreref, bool *pr)
1791{
1792 int i = 0;
1793 size_t start = 0;
1794 int len = 0;
1795
1796 *pr = true;
1797 /* disassemble the names */
1798 if (!memcmp(cra_driver_name, "drbg_nopr_", 10)) {
1799 start = 10;
1800 *pr = false;
1801 } else if (!memcmp(cra_driver_name, "drbg_pr_", 8)) {
1802 start = 8;
1803 } else {
1804 return;
1805 }
1806
1807 /* remove the first part */
1808 len = strlen(cra_driver_name) - start;
1809 for (i = 0; ARRAY_SIZE(drbg_cores) > i; i++) {
1810 if (!memcmp(cra_driver_name + start, drbg_cores[i].cra_name,
1811 len)) {
1812 *coreref = i;
1813 return;
1814 }
1815 }
1816}
1817
1818static int drbg_kcapi_init(struct crypto_tfm *tfm)
1819{
1820 struct drbg_state *drbg = crypto_tfm_ctx(tfm);
Stephan Mueller541af942014-05-31 15:44:17 +02001821
Stephan Mueller76899a42015-04-18 19:36:17 +02001822 mutex_init(&drbg->drbg_mutex);
Herbert Xu2a57e422015-04-20 11:29:15 +08001823
1824 return 0;
Stephan Mueller541af942014-05-31 15:44:17 +02001825}
1826
1827static void drbg_kcapi_cleanup(struct crypto_tfm *tfm)
1828{
1829 drbg_uninstantiate(crypto_tfm_ctx(tfm));
1830}
1831
1832/*
1833 * Generate random numbers invoked by the kernel crypto API:
1834 * The API of the kernel crypto API is extended as follows:
1835 *
Herbert Xu8fded592015-04-21 10:46:41 +08001836 * src is additional input supplied to the RNG.
1837 * slen is the length of src.
1838 * dst is the output buffer where random data is to be stored.
1839 * dlen is the length of dst.
Stephan Mueller541af942014-05-31 15:44:17 +02001840 */
Herbert Xu8fded592015-04-21 10:46:41 +08001841static int drbg_kcapi_random(struct crypto_rng *tfm,
1842 const u8 *src, unsigned int slen,
1843 u8 *dst, unsigned int dlen)
Stephan Mueller541af942014-05-31 15:44:17 +02001844{
1845 struct drbg_state *drbg = crypto_rng_ctx(tfm);
Herbert Xu8fded592015-04-21 10:46:41 +08001846 struct drbg_string *addtl = NULL;
1847 struct drbg_string string;
1848
1849 if (slen) {
Stephan Mueller8c987162014-06-28 21:58:24 +02001850 /* linked list variable is now local to allow modification */
Herbert Xu8fded592015-04-21 10:46:41 +08001851 drbg_string_fill(&string, src, slen);
1852 addtl = &string;
Stephan Mueller541af942014-05-31 15:44:17 +02001853 }
Herbert Xu8fded592015-04-21 10:46:41 +08001854
1855 return drbg_generate_long(drbg, dst, dlen, addtl);
Stephan Mueller541af942014-05-31 15:44:17 +02001856}
1857
1858/*
Herbert Xu2a57e422015-04-20 11:29:15 +08001859 * Seed the DRBG invoked by the kernel crypto API
Stephan Mueller541af942014-05-31 15:44:17 +02001860 */
Herbert Xu8fded592015-04-21 10:46:41 +08001861static int drbg_kcapi_seed(struct crypto_rng *tfm,
1862 const u8 *seed, unsigned int slen)
Stephan Mueller541af942014-05-31 15:44:17 +02001863{
1864 struct drbg_state *drbg = crypto_rng_ctx(tfm);
1865 struct crypto_tfm *tfm_base = crypto_rng_tfm(tfm);
1866 bool pr = false;
Herbert Xu8fded592015-04-21 10:46:41 +08001867 struct drbg_string string;
1868 struct drbg_string *seed_string = NULL;
Stephan Mueller541af942014-05-31 15:44:17 +02001869 int coreref = 0;
1870
Stephan Mueller541af942014-05-31 15:44:17 +02001871 drbg_convert_tfm_core(crypto_tfm_alg_driver_name(tfm_base), &coreref,
1872 &pr);
1873 if (0 < slen) {
Herbert Xu8fded592015-04-21 10:46:41 +08001874 drbg_string_fill(&string, seed, slen);
1875 seed_string = &string;
Stephan Mueller541af942014-05-31 15:44:17 +02001876 }
Herbert Xu8fded592015-04-21 10:46:41 +08001877
1878 return drbg_instantiate(drbg, seed_string, coreref, pr);
Stephan Mueller541af942014-05-31 15:44:17 +02001879}
1880
1881/***************************************************************
1882 * Kernel module: code to load the module
1883 ***************************************************************/
1884
1885/*
1886 * Tests as defined in 11.3.2 in addition to the cipher tests: testing
1887 * of the error handling.
1888 *
1889 * Note: testing of failing seed source as defined in 11.3.2 is not applicable
1890 * as seed source of get_random_bytes does not fail.
1891 *
1892 * Note 2: There is no sensible way of testing the reseed counter
1893 * enforcement, so skip it.
1894 */
1895static inline int __init drbg_healthcheck_sanity(void)
1896{
Stephan Mueller541af942014-05-31 15:44:17 +02001897 int len = 0;
1898#define OUTBUFLEN 16
1899 unsigned char buf[OUTBUFLEN];
1900 struct drbg_state *drbg = NULL;
1901 int ret = -EFAULT;
1902 int rc = -EFAULT;
1903 bool pr = false;
1904 int coreref = 0;
1905 struct drbg_string addtl;
1906 size_t max_addtllen, max_request_bytes;
1907
1908 /* only perform test in FIPS mode */
1909 if (!fips_enabled)
1910 return 0;
1911
1912#ifdef CONFIG_CRYPTO_DRBG_CTR
1913 drbg_convert_tfm_core("drbg_nopr_ctr_aes128", &coreref, &pr);
Stephan Muellere25e47e2014-07-06 02:23:03 +02001914#elif defined CONFIG_CRYPTO_DRBG_HASH
Stephan Mueller541af942014-05-31 15:44:17 +02001915 drbg_convert_tfm_core("drbg_nopr_sha256", &coreref, &pr);
1916#else
1917 drbg_convert_tfm_core("drbg_nopr_hmac_sha256", &coreref, &pr);
1918#endif
1919
1920 drbg = kzalloc(sizeof(struct drbg_state), GFP_KERNEL);
1921 if (!drbg)
1922 return -ENOMEM;
1923
Herbert Xue11a7542015-04-20 11:26:48 +08001924 mutex_init(&drbg->drbg_mutex);
1925
Stephan Mueller541af942014-05-31 15:44:17 +02001926 /*
1927 * if the following tests fail, it is likely that there is a buffer
1928 * overflow as buf is much smaller than the requested or provided
1929 * string lengths -- in case the error handling does not succeed
1930 * we may get an OOPS. And we want to get an OOPS as this is a
1931 * grave bug.
1932 */
1933
1934 /* get a valid instance of DRBG for following tests */
1935 ret = drbg_instantiate(drbg, NULL, coreref, pr);
1936 if (ret) {
1937 rc = ret;
1938 goto outbuf;
1939 }
1940 max_addtllen = drbg_max_addtl(drbg);
1941 max_request_bytes = drbg_max_request_bytes(drbg);
1942 drbg_string_fill(&addtl, buf, max_addtllen + 1);
1943 /* overflow addtllen with additonal info string */
1944 len = drbg_generate(drbg, buf, OUTBUFLEN, &addtl);
1945 BUG_ON(0 < len);
1946 /* overflow max_bits */
1947 len = drbg_generate(drbg, buf, (max_request_bytes + 1), NULL);
1948 BUG_ON(0 < len);
1949 drbg_uninstantiate(drbg);
1950
1951 /* overflow max addtllen with personalization string */
1952 ret = drbg_instantiate(drbg, &addtl, coreref, pr);
1953 BUG_ON(0 == ret);
Stephan Mueller541af942014-05-31 15:44:17 +02001954 /* all tests passed */
1955 rc = 0;
1956
1957 pr_devel("DRBG: Sanity tests for failure code paths successfully "
1958 "completed\n");
1959
1960 drbg_uninstantiate(drbg);
1961outbuf:
1962 kzfree(drbg);
1963 return rc;
Stephan Mueller541af942014-05-31 15:44:17 +02001964}
1965
Herbert Xu8fded592015-04-21 10:46:41 +08001966static struct rng_alg drbg_algs[22];
Stephan Mueller541af942014-05-31 15:44:17 +02001967
1968/*
1969 * Fill the array drbg_algs used to register the different DRBGs
1970 * with the kernel crypto API. To fill the array, the information
1971 * from drbg_cores[] is used.
1972 */
Herbert Xu8fded592015-04-21 10:46:41 +08001973static inline void __init drbg_fill_array(struct rng_alg *alg,
Stephan Mueller541af942014-05-31 15:44:17 +02001974 const struct drbg_core *core, int pr)
1975{
1976 int pos = 0;
Herbert Xu51ee14222015-06-03 14:49:28 +08001977 static int priority = 200;
Stephan Mueller541af942014-05-31 15:44:17 +02001978
Herbert Xu8fded592015-04-21 10:46:41 +08001979 memcpy(alg->base.cra_name, "stdrng", 6);
Stephan Mueller541af942014-05-31 15:44:17 +02001980 if (pr) {
Herbert Xu8fded592015-04-21 10:46:41 +08001981 memcpy(alg->base.cra_driver_name, "drbg_pr_", 8);
Stephan Mueller541af942014-05-31 15:44:17 +02001982 pos = 8;
1983 } else {
Herbert Xu8fded592015-04-21 10:46:41 +08001984 memcpy(alg->base.cra_driver_name, "drbg_nopr_", 10);
Stephan Mueller541af942014-05-31 15:44:17 +02001985 pos = 10;
1986 }
Herbert Xu8fded592015-04-21 10:46:41 +08001987 memcpy(alg->base.cra_driver_name + pos, core->cra_name,
Stephan Mueller541af942014-05-31 15:44:17 +02001988 strlen(core->cra_name));
1989
Herbert Xu8fded592015-04-21 10:46:41 +08001990 alg->base.cra_priority = priority;
Stephan Mueller541af942014-05-31 15:44:17 +02001991 priority++;
1992 /*
1993 * If FIPS mode enabled, the selected DRBG shall have the
1994 * highest cra_priority over other stdrng instances to ensure
1995 * it is selected.
1996 */
1997 if (fips_enabled)
Herbert Xu8fded592015-04-21 10:46:41 +08001998 alg->base.cra_priority += 200;
Stephan Mueller541af942014-05-31 15:44:17 +02001999
Herbert Xu8fded592015-04-21 10:46:41 +08002000 alg->base.cra_ctxsize = sizeof(struct drbg_state);
2001 alg->base.cra_module = THIS_MODULE;
2002 alg->base.cra_init = drbg_kcapi_init;
2003 alg->base.cra_exit = drbg_kcapi_cleanup;
2004 alg->generate = drbg_kcapi_random;
2005 alg->seed = drbg_kcapi_seed;
2006 alg->set_ent = drbg_kcapi_set_entropy;
2007 alg->seedsize = 0;
Stephan Mueller541af942014-05-31 15:44:17 +02002008}
2009
2010static int __init drbg_init(void)
2011{
2012 unsigned int i = 0; /* pointer to drbg_algs */
2013 unsigned int j = 0; /* pointer to drbg_cores */
2014 int ret = -EFAULT;
2015
2016 ret = drbg_healthcheck_sanity();
2017 if (ret)
2018 return ret;
2019
2020 if (ARRAY_SIZE(drbg_cores) * 2 > ARRAY_SIZE(drbg_algs)) {
2021 pr_info("DRBG: Cannot register all DRBG types"
Stephan Muellera9089572014-07-06 02:24:03 +02002022 "(slots needed: %zu, slots available: %zu)\n",
Stephan Mueller541af942014-05-31 15:44:17 +02002023 ARRAY_SIZE(drbg_cores) * 2, ARRAY_SIZE(drbg_algs));
2024 return ret;
2025 }
2026
2027 /*
2028 * each DRBG definition can be used with PR and without PR, thus
2029 * we instantiate each DRBG in drbg_cores[] twice.
2030 *
2031 * As the order of placing them into the drbg_algs array matters
2032 * (the later DRBGs receive a higher cra_priority) we register the
2033 * prediction resistance DRBGs first as the should not be too
2034 * interesting.
2035 */
2036 for (j = 0; ARRAY_SIZE(drbg_cores) > j; j++, i++)
2037 drbg_fill_array(&drbg_algs[i], &drbg_cores[j], 1);
2038 for (j = 0; ARRAY_SIZE(drbg_cores) > j; j++, i++)
2039 drbg_fill_array(&drbg_algs[i], &drbg_cores[j], 0);
Herbert Xu8fded592015-04-21 10:46:41 +08002040 return crypto_register_rngs(drbg_algs, (ARRAY_SIZE(drbg_cores) * 2));
Stephan Mueller541af942014-05-31 15:44:17 +02002041}
2042
Fengguang Wu96956ae2014-07-10 16:52:04 +08002043static void __exit drbg_exit(void)
Stephan Mueller541af942014-05-31 15:44:17 +02002044{
Herbert Xu8fded592015-04-21 10:46:41 +08002045 crypto_unregister_rngs(drbg_algs, (ARRAY_SIZE(drbg_cores) * 2));
Stephan Mueller541af942014-05-31 15:44:17 +02002046}
2047
2048module_init(drbg_init);
2049module_exit(drbg_exit);
Stephan Muellere25e47e2014-07-06 02:23:03 +02002050#ifndef CRYPTO_DRBG_HASH_STRING
2051#define CRYPTO_DRBG_HASH_STRING ""
2052#endif
2053#ifndef CRYPTO_DRBG_HMAC_STRING
2054#define CRYPTO_DRBG_HMAC_STRING ""
2055#endif
2056#ifndef CRYPTO_DRBG_CTR_STRING
2057#define CRYPTO_DRBG_CTR_STRING ""
2058#endif
Stephan Mueller541af942014-05-31 15:44:17 +02002059MODULE_LICENSE("GPL");
2060MODULE_AUTHOR("Stephan Mueller <smueller@chronox.de>");
Stephan Muellere25e47e2014-07-06 02:23:03 +02002061MODULE_DESCRIPTION("NIST SP800-90A Deterministic Random Bit Generator (DRBG) "
2062 "using following cores: "
2063 CRYPTO_DRBG_HASH_STRING
2064 CRYPTO_DRBG_HMAC_STRING
2065 CRYPTO_DRBG_CTR_STRING);
Herbert Xu51ee14222015-06-03 14:49:28 +08002066MODULE_ALIAS_CRYPTO("stdrng");