subr_cprng.c revision 1.28 1 1.28 maya /* $NetBSD: subr_cprng.c,v 1.28 2017/10/25 08:12:39 maya Exp $ */
2 1.1 tls
3 1.1 tls /*-
4 1.18 riastrad * Copyright (c) 2011-2013 The NetBSD Foundation, Inc.
5 1.1 tls * All rights reserved.
6 1.1 tls *
7 1.1 tls * This code is derived from software contributed to The NetBSD Foundation
8 1.18 riastrad * by Thor Lancelot Simon and Taylor R. Campbell.
9 1.1 tls *
10 1.1 tls * Redistribution and use in source and binary forms, with or without
11 1.1 tls * modification, are permitted provided that the following conditions
12 1.1 tls * are met:
13 1.1 tls * 1. Redistributions of source code must retain the above copyright
14 1.1 tls * notice, this list of conditions and the following disclaimer.
15 1.1 tls * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 tls * notice, this list of conditions and the following disclaimer in the
17 1.1 tls * documentation and/or other materials provided with the distribution.
18 1.1 tls *
19 1.1 tls * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.1 tls * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.1 tls * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.1 tls * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.1 tls * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.1 tls * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.1 tls * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.1 tls * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.1 tls * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.1 tls * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.1 tls * POSSIBILITY OF SUCH DAMAGE.
30 1.1 tls */
31 1.1 tls
32 1.18 riastrad #include <sys/cdefs.h>
33 1.28 maya __KERNEL_RCSID(0, "$NetBSD: subr_cprng.c,v 1.28 2017/10/25 08:12:39 maya Exp $");
34 1.18 riastrad
35 1.18 riastrad #include <sys/param.h>
36 1.1 tls #include <sys/types.h>
37 1.18 riastrad #include <sys/condvar.h>
38 1.18 riastrad #include <sys/cprng.h>
39 1.18 riastrad #include <sys/errno.h>
40 1.18 riastrad #include <sys/event.h> /* XXX struct knote */
41 1.18 riastrad #include <sys/fcntl.h> /* XXX FNONBLOCK */
42 1.1 tls #include <sys/kernel.h>
43 1.18 riastrad #include <sys/kmem.h>
44 1.19 riastrad #include <sys/lwp.h>
45 1.23 pooka #include <sys/once.h>
46 1.24 tls #include <sys/percpu.h>
47 1.18 riastrad #include <sys/poll.h> /* XXX POLLIN/POLLOUT/&c. */
48 1.18 riastrad #include <sys/select.h>
49 1.1 tls #include <sys/systm.h>
50 1.23 pooka #include <sys/sysctl.h>
51 1.18 riastrad #include <sys/rndsink.h>
52 1.26 christos #if DIAGNOSTIC
53 1.1 tls #include <sys/rngtest.h>
54 1.18 riastrad #endif
55 1.18 riastrad
56 1.18 riastrad #include <crypto/nist_ctr_drbg/nist_ctr_drbg.h>
57 1.1 tls
58 1.2 tsutsui #if defined(__HAVE_CPU_COUNTER)
59 1.1 tls #include <machine/cpu_counter.h>
60 1.2 tsutsui #endif
61 1.1 tls
62 1.23 pooka static int sysctl_kern_urnd(SYSCTLFN_PROTO);
63 1.23 pooka static int sysctl_kern_arnd(SYSCTLFN_PROTO);
64 1.23 pooka
65 1.18 riastrad static void cprng_strong_generate(struct cprng_strong *, void *, size_t);
66 1.18 riastrad static void cprng_strong_reseed(struct cprng_strong *);
67 1.18 riastrad static void cprng_strong_reseed_from(struct cprng_strong *, const void *,
68 1.18 riastrad size_t, bool);
69 1.26 christos #if DIAGNOSTIC
70 1.18 riastrad static void cprng_strong_rngtest(struct cprng_strong *);
71 1.18 riastrad #endif
72 1.1 tls
73 1.18 riastrad static rndsink_callback_t cprng_strong_rndsink_callback;
74 1.1 tls
75 1.1 tls void
76 1.1 tls cprng_init(void)
77 1.1 tls {
78 1.23 pooka static struct sysctllog *random_sysctllog;
79 1.23 pooka
80 1.1 tls nist_ctr_initialize();
81 1.23 pooka
82 1.23 pooka sysctl_createv(&random_sysctllog, 0, NULL, NULL,
83 1.23 pooka CTLFLAG_PERMANENT,
84 1.23 pooka CTLTYPE_INT, "urandom",
85 1.23 pooka SYSCTL_DESCR("Random integer value"),
86 1.23 pooka sysctl_kern_urnd, 0, NULL, 0,
87 1.23 pooka CTL_KERN, KERN_URND, CTL_EOL);
88 1.23 pooka sysctl_createv(&random_sysctllog, 0, NULL, NULL,
89 1.23 pooka CTLFLAG_PERMANENT,
90 1.23 pooka CTLTYPE_INT, "arandom",
91 1.23 pooka SYSCTL_DESCR("n bytes of random data"),
92 1.23 pooka sysctl_kern_arnd, 0, NULL, 0,
93 1.23 pooka CTL_KERN, KERN_ARND, CTL_EOL);
94 1.1 tls }
95 1.1 tls
96 1.1 tls static inline uint32_t
97 1.1 tls cprng_counter(void)
98 1.1 tls {
99 1.1 tls struct timeval tv;
100 1.1 tls
101 1.1 tls #if defined(__HAVE_CPU_COUNTER)
102 1.1 tls if (cpu_hascounter())
103 1.1 tls return cpu_counter32();
104 1.1 tls #endif
105 1.1 tls if (__predict_false(cold)) {
106 1.24 tls static int ctr;
107 1.1 tls /* microtime unsafe if clock not running yet */
108 1.24 tls return ctr++;
109 1.1 tls }
110 1.24 tls getmicrotime(&tv);
111 1.1 tls return (tv.tv_sec * 1000000 + tv.tv_usec);
112 1.1 tls }
113 1.1 tls
114 1.18 riastrad struct cprng_strong {
115 1.18 riastrad char cs_name[16];
116 1.18 riastrad int cs_flags;
117 1.18 riastrad kmutex_t cs_lock;
118 1.24 tls percpu_t *cs_percpu;
119 1.18 riastrad kcondvar_t cs_cv;
120 1.18 riastrad struct selinfo cs_selq;
121 1.18 riastrad struct rndsink *cs_rndsink;
122 1.18 riastrad bool cs_ready;
123 1.18 riastrad NIST_CTR_DRBG cs_drbg;
124 1.21 riastrad
125 1.21 riastrad /* XXX Kludge for /dev/random `information-theoretic' properties. */
126 1.21 riastrad unsigned int cs_remaining;
127 1.18 riastrad };
128 1.18 riastrad
129 1.18 riastrad struct cprng_strong *
130 1.18 riastrad cprng_strong_create(const char *name, int ipl, int flags)
131 1.18 riastrad {
132 1.18 riastrad const uint32_t cc = cprng_counter();
133 1.18 riastrad struct cprng_strong *const cprng = kmem_alloc(sizeof(*cprng),
134 1.18 riastrad KM_SLEEP);
135 1.18 riastrad
136 1.18 riastrad /*
137 1.18 riastrad * rndsink_request takes a spin lock at IPL_VM, so we can be no
138 1.18 riastrad * higher than that.
139 1.18 riastrad */
140 1.22 skrll KASSERT(ipl != IPL_SCHED && ipl != IPL_HIGH);
141 1.18 riastrad
142 1.18 riastrad /* Initialize the easy fields. */
143 1.18 riastrad (void)strlcpy(cprng->cs_name, name, sizeof(cprng->cs_name));
144 1.18 riastrad cprng->cs_flags = flags;
145 1.18 riastrad mutex_init(&cprng->cs_lock, MUTEX_DEFAULT, ipl);
146 1.18 riastrad cv_init(&cprng->cs_cv, cprng->cs_name);
147 1.18 riastrad selinit(&cprng->cs_selq);
148 1.18 riastrad cprng->cs_rndsink = rndsink_create(NIST_BLOCK_KEYLEN_BYTES,
149 1.18 riastrad &cprng_strong_rndsink_callback, cprng);
150 1.18 riastrad
151 1.18 riastrad /* Get some initial entropy. Record whether it is full entropy. */
152 1.18 riastrad uint8_t seed[NIST_BLOCK_KEYLEN_BYTES];
153 1.25 riastrad mutex_enter(&cprng->cs_lock);
154 1.18 riastrad cprng->cs_ready = rndsink_request(cprng->cs_rndsink, seed,
155 1.18 riastrad sizeof(seed));
156 1.18 riastrad if (nist_ctr_drbg_instantiate(&cprng->cs_drbg, seed, sizeof(seed),
157 1.18 riastrad &cc, sizeof(cc), cprng->cs_name, sizeof(cprng->cs_name)))
158 1.18 riastrad /* XXX Fix nist_ctr_drbg API so this can't happen. */
159 1.18 riastrad panic("cprng %s: NIST CTR_DRBG instantiation failed",
160 1.18 riastrad cprng->cs_name);
161 1.20 riastrad explicit_memset(seed, 0, sizeof(seed));
162 1.18 riastrad
163 1.21 riastrad if (ISSET(flags, CPRNG_HARD))
164 1.21 riastrad cprng->cs_remaining = NIST_BLOCK_KEYLEN_BYTES;
165 1.21 riastrad else
166 1.21 riastrad cprng->cs_remaining = 0;
167 1.21 riastrad
168 1.18 riastrad if (!cprng->cs_ready && !ISSET(flags, CPRNG_INIT_ANY))
169 1.18 riastrad printf("cprng %s: creating with partial entropy\n",
170 1.18 riastrad cprng->cs_name);
171 1.25 riastrad mutex_exit(&cprng->cs_lock);
172 1.18 riastrad
173 1.18 riastrad return cprng;
174 1.18 riastrad }
175 1.18 riastrad
176 1.18 riastrad void
177 1.18 riastrad cprng_strong_destroy(struct cprng_strong *cprng)
178 1.8 tls {
179 1.8 tls
180 1.18 riastrad /*
181 1.18 riastrad * Destroy the rndsink first to prevent calls to the callback.
182 1.18 riastrad */
183 1.18 riastrad rndsink_destroy(cprng->cs_rndsink);
184 1.8 tls
185 1.18 riastrad KASSERT(!cv_has_waiters(&cprng->cs_cv));
186 1.18 riastrad #if 0
187 1.18 riastrad KASSERT(!select_has_waiters(&cprng->cs_selq)) /* XXX ? */
188 1.18 riastrad #endif
189 1.15 tls
190 1.18 riastrad nist_ctr_drbg_destroy(&cprng->cs_drbg);
191 1.18 riastrad seldestroy(&cprng->cs_selq);
192 1.18 riastrad cv_destroy(&cprng->cs_cv);
193 1.18 riastrad mutex_destroy(&cprng->cs_lock);
194 1.18 riastrad
195 1.20 riastrad explicit_memset(cprng, 0, sizeof(*cprng)); /* paranoia */
196 1.18 riastrad kmem_free(cprng, sizeof(*cprng));
197 1.8 tls }
198 1.8 tls
199 1.18 riastrad /*
200 1.18 riastrad * Generate some data from cprng. Block or return zero bytes,
201 1.18 riastrad * depending on flags & FNONBLOCK, if cprng was created without
202 1.18 riastrad * CPRNG_REKEY_ANY.
203 1.18 riastrad */
204 1.18 riastrad size_t
205 1.18 riastrad cprng_strong(struct cprng_strong *cprng, void *buffer, size_t bytes, int flags)
206 1.5 tls {
207 1.18 riastrad size_t result;
208 1.18 riastrad
209 1.18 riastrad /* Caller must loop for more than CPRNG_MAX_LEN bytes. */
210 1.18 riastrad bytes = MIN(bytes, CPRNG_MAX_LEN);
211 1.18 riastrad
212 1.18 riastrad mutex_enter(&cprng->cs_lock);
213 1.18 riastrad
214 1.18 riastrad if (ISSET(cprng->cs_flags, CPRNG_REKEY_ANY)) {
215 1.18 riastrad if (!cprng->cs_ready)
216 1.18 riastrad cprng_strong_reseed(cprng);
217 1.18 riastrad } else {
218 1.18 riastrad while (!cprng->cs_ready) {
219 1.18 riastrad if (ISSET(flags, FNONBLOCK) ||
220 1.18 riastrad !ISSET(cprng->cs_flags, CPRNG_USE_CV) ||
221 1.18 riastrad cv_wait_sig(&cprng->cs_cv, &cprng->cs_lock)) {
222 1.18 riastrad result = 0;
223 1.18 riastrad goto out;
224 1.8 tls }
225 1.8 tls }
226 1.5 tls }
227 1.18 riastrad
228 1.21 riastrad /*
229 1.21 riastrad * Debit the entropy if requested.
230 1.21 riastrad *
231 1.21 riastrad * XXX Kludge for /dev/random `information-theoretic' properties.
232 1.21 riastrad */
233 1.21 riastrad if (__predict_false(ISSET(cprng->cs_flags, CPRNG_HARD))) {
234 1.21 riastrad KASSERT(0 < cprng->cs_remaining);
235 1.21 riastrad KASSERT(cprng->cs_remaining <= NIST_BLOCK_KEYLEN_BYTES);
236 1.21 riastrad if (bytes < cprng->cs_remaining) {
237 1.21 riastrad cprng->cs_remaining -= bytes;
238 1.21 riastrad } else {
239 1.21 riastrad bytes = cprng->cs_remaining;
240 1.21 riastrad cprng->cs_remaining = NIST_BLOCK_KEYLEN_BYTES;
241 1.21 riastrad cprng->cs_ready = false;
242 1.21 riastrad rndsink_schedule(cprng->cs_rndsink);
243 1.21 riastrad }
244 1.21 riastrad KASSERT(bytes <= NIST_BLOCK_KEYLEN_BYTES);
245 1.21 riastrad KASSERT(0 < cprng->cs_remaining);
246 1.21 riastrad KASSERT(cprng->cs_remaining <= NIST_BLOCK_KEYLEN_BYTES);
247 1.21 riastrad }
248 1.21 riastrad
249 1.18 riastrad cprng_strong_generate(cprng, buffer, bytes);
250 1.18 riastrad result = bytes;
251 1.18 riastrad
252 1.18 riastrad out: mutex_exit(&cprng->cs_lock);
253 1.18 riastrad return result;
254 1.18 riastrad }
255 1.18 riastrad
256 1.18 riastrad static void filt_cprng_detach(struct knote *);
257 1.18 riastrad static int filt_cprng_event(struct knote *, long);
258 1.18 riastrad
259 1.28 maya static const struct filterops cprng_filtops = {
260 1.28 maya .f_isfd = 1,
261 1.28 maya .f_attach = NULL,
262 1.28 maya .f_detach = filt_cprng_detach,
263 1.28 maya .f_event = filt_cprng_event,
264 1.28 maya };
265 1.18 riastrad
266 1.18 riastrad int
267 1.18 riastrad cprng_strong_kqfilter(struct cprng_strong *cprng, struct knote *kn)
268 1.18 riastrad {
269 1.18 riastrad
270 1.18 riastrad switch (kn->kn_filter) {
271 1.18 riastrad case EVFILT_READ:
272 1.18 riastrad kn->kn_fop = &cprng_filtops;
273 1.18 riastrad kn->kn_hook = cprng;
274 1.18 riastrad mutex_enter(&cprng->cs_lock);
275 1.18 riastrad SLIST_INSERT_HEAD(&cprng->cs_selq.sel_klist, kn, kn_selnext);
276 1.18 riastrad mutex_exit(&cprng->cs_lock);
277 1.18 riastrad return 0;
278 1.18 riastrad
279 1.18 riastrad case EVFILT_WRITE:
280 1.18 riastrad default:
281 1.18 riastrad return EINVAL;
282 1.8 tls }
283 1.5 tls }
284 1.5 tls
285 1.5 tls static void
286 1.18 riastrad filt_cprng_detach(struct knote *kn)
287 1.1 tls {
288 1.18 riastrad struct cprng_strong *const cprng = kn->kn_hook;
289 1.18 riastrad
290 1.18 riastrad mutex_enter(&cprng->cs_lock);
291 1.18 riastrad SLIST_REMOVE(&cprng->cs_selq.sel_klist, kn, knote, kn_selnext);
292 1.18 riastrad mutex_exit(&cprng->cs_lock);
293 1.18 riastrad }
294 1.8 tls
295 1.18 riastrad static int
296 1.18 riastrad filt_cprng_event(struct knote *kn, long hint)
297 1.18 riastrad {
298 1.18 riastrad struct cprng_strong *const cprng = kn->kn_hook;
299 1.18 riastrad int ret;
300 1.1 tls
301 1.18 riastrad if (hint == NOTE_SUBMIT)
302 1.18 riastrad KASSERT(mutex_owned(&cprng->cs_lock));
303 1.18 riastrad else
304 1.18 riastrad mutex_enter(&cprng->cs_lock);
305 1.18 riastrad if (cprng->cs_ready) {
306 1.18 riastrad kn->kn_data = CPRNG_MAX_LEN; /* XXX Too large? */
307 1.18 riastrad ret = 1;
308 1.18 riastrad } else {
309 1.18 riastrad ret = 0;
310 1.7 tls }
311 1.18 riastrad if (hint == NOTE_SUBMIT)
312 1.18 riastrad KASSERT(mutex_owned(&cprng->cs_lock));
313 1.18 riastrad else
314 1.18 riastrad mutex_exit(&cprng->cs_lock);
315 1.7 tls
316 1.18 riastrad return ret;
317 1.1 tls }
318 1.1 tls
319 1.18 riastrad int
320 1.18 riastrad cprng_strong_poll(struct cprng_strong *cprng, int events)
321 1.15 tls {
322 1.18 riastrad int revents;
323 1.18 riastrad
324 1.18 riastrad if (!ISSET(events, (POLLIN | POLLRDNORM)))
325 1.18 riastrad return 0;
326 1.18 riastrad
327 1.18 riastrad mutex_enter(&cprng->cs_lock);
328 1.18 riastrad if (cprng->cs_ready) {
329 1.18 riastrad revents = (events & (POLLIN | POLLRDNORM));
330 1.18 riastrad } else {
331 1.18 riastrad selrecord(curlwp, &cprng->cs_selq);
332 1.18 riastrad revents = 0;
333 1.15 tls }
334 1.18 riastrad mutex_exit(&cprng->cs_lock);
335 1.18 riastrad
336 1.18 riastrad return revents;
337 1.18 riastrad }
338 1.18 riastrad
339 1.18 riastrad /*
340 1.18 riastrad * XXX Move nist_ctr_drbg_reseed_advised_p and
341 1.18 riastrad * nist_ctr_drbg_reseed_needed_p into the nist_ctr_drbg API and make
342 1.18 riastrad * the NIST_CTR_DRBG structure opaque.
343 1.18 riastrad */
344 1.18 riastrad static bool
345 1.18 riastrad nist_ctr_drbg_reseed_advised_p(NIST_CTR_DRBG *drbg)
346 1.18 riastrad {
347 1.18 riastrad
348 1.18 riastrad return (drbg->reseed_counter > (NIST_CTR_DRBG_RESEED_INTERVAL / 2));
349 1.15 tls }
350 1.15 tls
351 1.18 riastrad static bool
352 1.18 riastrad nist_ctr_drbg_reseed_needed_p(NIST_CTR_DRBG *drbg)
353 1.1 tls {
354 1.1 tls
355 1.18 riastrad return (drbg->reseed_counter >= NIST_CTR_DRBG_RESEED_INTERVAL);
356 1.18 riastrad }
357 1.18 riastrad
358 1.18 riastrad /*
359 1.18 riastrad * Generate some data from the underlying generator.
360 1.18 riastrad */
361 1.18 riastrad static void
362 1.21 riastrad cprng_strong_generate(struct cprng_strong *cprng, void *buffer, size_t bytes)
363 1.18 riastrad {
364 1.18 riastrad const uint32_t cc = cprng_counter();
365 1.18 riastrad
366 1.18 riastrad KASSERT(bytes <= CPRNG_MAX_LEN);
367 1.18 riastrad KASSERT(mutex_owned(&cprng->cs_lock));
368 1.18 riastrad
369 1.18 riastrad /*
370 1.18 riastrad * Generate some data from the NIST CTR_DRBG. Caller
371 1.18 riastrad * guarantees reseed if we're not ready, and if we exhaust the
372 1.18 riastrad * generator, we mark ourselves not ready. Consequently, this
373 1.18 riastrad * call to the CTR_DRBG should not fail.
374 1.18 riastrad */
375 1.18 riastrad if (__predict_false(nist_ctr_drbg_generate(&cprng->cs_drbg, buffer,
376 1.18 riastrad bytes, &cc, sizeof(cc))))
377 1.18 riastrad panic("cprng %s: NIST CTR_DRBG failed", cprng->cs_name);
378 1.1 tls
379 1.18 riastrad /*
380 1.18 riastrad * If we've been seeing a lot of use, ask for some fresh
381 1.18 riastrad * entropy soon.
382 1.18 riastrad */
383 1.18 riastrad if (__predict_false(nist_ctr_drbg_reseed_advised_p(&cprng->cs_drbg)))
384 1.18 riastrad rndsink_schedule(cprng->cs_rndsink);
385 1.1 tls
386 1.18 riastrad /*
387 1.18 riastrad * If we just exhausted the generator, inform the next user
388 1.18 riastrad * that we need a reseed.
389 1.18 riastrad */
390 1.18 riastrad if (__predict_false(nist_ctr_drbg_reseed_needed_p(&cprng->cs_drbg))) {
391 1.18 riastrad cprng->cs_ready = false;
392 1.18 riastrad rndsink_schedule(cprng->cs_rndsink); /* paranoia */
393 1.1 tls }
394 1.18 riastrad }
395 1.1 tls
396 1.18 riastrad /*
397 1.18 riastrad * Reseed with whatever we can get from the system entropy pool right now.
398 1.18 riastrad */
399 1.18 riastrad static void
400 1.18 riastrad cprng_strong_reseed(struct cprng_strong *cprng)
401 1.18 riastrad {
402 1.18 riastrad uint8_t seed[NIST_BLOCK_KEYLEN_BYTES];
403 1.5 tls
404 1.18 riastrad KASSERT(mutex_owned(&cprng->cs_lock));
405 1.1 tls
406 1.18 riastrad const bool full_entropy = rndsink_request(cprng->cs_rndsink, seed,
407 1.18 riastrad sizeof(seed));
408 1.18 riastrad cprng_strong_reseed_from(cprng, seed, sizeof(seed), full_entropy);
409 1.20 riastrad explicit_memset(seed, 0, sizeof(seed));
410 1.1 tls }
411 1.1 tls
412 1.18 riastrad /*
413 1.18 riastrad * Reseed with the given seed. If we now have full entropy, notify waiters.
414 1.18 riastrad */
415 1.18 riastrad static void
416 1.18 riastrad cprng_strong_reseed_from(struct cprng_strong *cprng,
417 1.18 riastrad const void *seed, size_t bytes, bool full_entropy)
418 1.1 tls {
419 1.18 riastrad const uint32_t cc = cprng_counter();
420 1.1 tls
421 1.18 riastrad KASSERT(bytes == NIST_BLOCK_KEYLEN_BYTES);
422 1.18 riastrad KASSERT(mutex_owned(&cprng->cs_lock));
423 1.1 tls
424 1.1 tls /*
425 1.18 riastrad * Notify anyone interested in the partiality of entropy in our
426 1.18 riastrad * seed -- anyone waiting for full entropy, or any system
427 1.18 riastrad * operators interested in knowing when the entropy pool is
428 1.18 riastrad * running on fumes.
429 1.1 tls */
430 1.18 riastrad if (full_entropy) {
431 1.18 riastrad if (!cprng->cs_ready) {
432 1.18 riastrad cprng->cs_ready = true;
433 1.18 riastrad cv_broadcast(&cprng->cs_cv);
434 1.18 riastrad selnotify(&cprng->cs_selq, (POLLIN | POLLRDNORM),
435 1.18 riastrad NOTE_SUBMIT);
436 1.18 riastrad }
437 1.18 riastrad } else {
438 1.18 riastrad /*
439 1.18 riastrad * XXX Is there is any harm in reseeding with partial
440 1.18 riastrad * entropy when we had full entropy before? If so,
441 1.18 riastrad * remove the conditional on this message.
442 1.18 riastrad */
443 1.18 riastrad if (!cprng->cs_ready &&
444 1.18 riastrad !ISSET(cprng->cs_flags, CPRNG_REKEY_ANY))
445 1.18 riastrad printf("cprng %s: reseeding with partial entropy\n",
446 1.18 riastrad cprng->cs_name);
447 1.18 riastrad }
448 1.18 riastrad
449 1.18 riastrad if (nist_ctr_drbg_reseed(&cprng->cs_drbg, seed, bytes, &cc, sizeof(cc)))
450 1.18 riastrad /* XXX Fix nist_ctr_drbg API so this can't happen. */
451 1.18 riastrad panic("cprng %s: NIST CTR_DRBG reseed failed", cprng->cs_name);
452 1.5 tls
453 1.26 christos #if DIAGNOSTIC
454 1.18 riastrad cprng_strong_rngtest(cprng);
455 1.8 tls #endif
456 1.1 tls }
457 1.1 tls
458 1.26 christos #if DIAGNOSTIC
459 1.18 riastrad /*
460 1.18 riastrad * Generate some output and apply a statistical RNG test to it.
461 1.18 riastrad */
462 1.18 riastrad static void
463 1.18 riastrad cprng_strong_rngtest(struct cprng_strong *cprng)
464 1.1 tls {
465 1.5 tls
466 1.18 riastrad KASSERT(mutex_owned(&cprng->cs_lock));
467 1.18 riastrad
468 1.18 riastrad /* XXX Switch to a pool cache instead? */
469 1.18 riastrad rngtest_t *const rt = kmem_intr_alloc(sizeof(*rt), KM_NOSLEEP);
470 1.18 riastrad if (rt == NULL)
471 1.18 riastrad /* XXX Warn? */
472 1.18 riastrad return;
473 1.1 tls
474 1.18 riastrad (void)strlcpy(rt->rt_name, cprng->cs_name, sizeof(rt->rt_name));
475 1.6 tls
476 1.18 riastrad if (nist_ctr_drbg_generate(&cprng->cs_drbg, rt->rt_b, sizeof(rt->rt_b),
477 1.18 riastrad NULL, 0))
478 1.18 riastrad panic("cprng %s: NIST CTR_DRBG failed after reseed",
479 1.18 riastrad cprng->cs_name);
480 1.5 tls
481 1.18 riastrad if (rngtest(rt)) {
482 1.18 riastrad printf("cprng %s: failed statistical RNG test\n",
483 1.18 riastrad cprng->cs_name);
484 1.18 riastrad /* XXX Not clear that this does any good... */
485 1.18 riastrad cprng->cs_ready = false;
486 1.18 riastrad rndsink_schedule(cprng->cs_rndsink);
487 1.18 riastrad }
488 1.5 tls
489 1.20 riastrad explicit_memset(rt, 0, sizeof(*rt)); /* paranoia */
490 1.18 riastrad kmem_intr_free(rt, sizeof(*rt));
491 1.1 tls }
492 1.18 riastrad #endif
493 1.1 tls
494 1.18 riastrad /*
495 1.18 riastrad * Feed entropy from an rndsink request into the CPRNG for which the
496 1.18 riastrad * request was issued.
497 1.18 riastrad */
498 1.18 riastrad static void
499 1.18 riastrad cprng_strong_rndsink_callback(void *context, const void *seed, size_t bytes)
500 1.1 tls {
501 1.18 riastrad struct cprng_strong *const cprng = context;
502 1.1 tls
503 1.18 riastrad mutex_enter(&cprng->cs_lock);
504 1.18 riastrad /* Assume that rndsinks provide only full-entropy output. */
505 1.18 riastrad cprng_strong_reseed_from(cprng, seed, bytes, true);
506 1.18 riastrad mutex_exit(&cprng->cs_lock);
507 1.1 tls }
508 1.23 pooka
509 1.23 pooka static cprng_strong_t *sysctl_prng;
510 1.23 pooka
511 1.23 pooka static int
512 1.23 pooka makeprng(void)
513 1.23 pooka {
514 1.23 pooka
515 1.23 pooka /* can't create in cprng_init(), too early */
516 1.23 pooka sysctl_prng = cprng_strong_create("sysctl", IPL_NONE,
517 1.23 pooka CPRNG_INIT_ANY|CPRNG_REKEY_ANY);
518 1.23 pooka return 0;
519 1.23 pooka }
520 1.23 pooka
521 1.23 pooka /*
522 1.23 pooka * sysctl helper routine for kern.urandom node. Picks a random number
523 1.23 pooka * for you.
524 1.23 pooka */
525 1.23 pooka static int
526 1.23 pooka sysctl_kern_urnd(SYSCTLFN_ARGS)
527 1.23 pooka {
528 1.23 pooka static ONCE_DECL(control);
529 1.23 pooka int v, rv;
530 1.23 pooka
531 1.23 pooka RUN_ONCE(&control, makeprng);
532 1.23 pooka rv = cprng_strong(sysctl_prng, &v, sizeof(v), 0);
533 1.23 pooka if (rv == sizeof(v)) {
534 1.23 pooka struct sysctlnode node = *rnode;
535 1.23 pooka node.sysctl_data = &v;
536 1.23 pooka return (sysctl_lookup(SYSCTLFN_CALL(&node)));
537 1.23 pooka }
538 1.23 pooka else
539 1.23 pooka return (EIO); /*XXX*/
540 1.23 pooka }
541 1.23 pooka
542 1.23 pooka /*
543 1.24 tls * sysctl helper routine for kern.arandom node. Fills the supplied
544 1.24 tls * structure with random data for you.
545 1.24 tls *
546 1.24 tls * This node was originally declared as type "int" but its implementation
547 1.24 tls * in OpenBSD, whence it came, would happily return up to 8K of data if
548 1.24 tls * requested. Evidently this was used to key RC4 in userspace.
549 1.24 tls *
550 1.24 tls * In NetBSD, the libc stack-smash-protection code reads 64 bytes
551 1.24 tls * from here at every program startup. So though it would be nice
552 1.24 tls * to make this node return only 32 or 64 bits, we can't. Too bad!
553 1.23 pooka */
554 1.23 pooka static int
555 1.23 pooka sysctl_kern_arnd(SYSCTLFN_ARGS)
556 1.23 pooka {
557 1.23 pooka int error;
558 1.23 pooka void *v;
559 1.23 pooka struct sysctlnode node = *rnode;
560 1.23 pooka
561 1.24 tls switch (*oldlenp) {
562 1.24 tls case 0:
563 1.23 pooka return 0;
564 1.24 tls default:
565 1.24 tls if (*oldlenp > 256) {
566 1.24 tls return E2BIG;
567 1.24 tls }
568 1.24 tls v = kmem_alloc(*oldlenp, KM_SLEEP);
569 1.24 tls cprng_fast(v, *oldlenp);
570 1.24 tls node.sysctl_data = v;
571 1.24 tls node.sysctl_size = *oldlenp;
572 1.24 tls error = sysctl_lookup(SYSCTLFN_CALL(&node));
573 1.24 tls kmem_free(v, *oldlenp);
574 1.24 tls return error;
575 1.24 tls }
576 1.23 pooka }
577