subr_cprng.c revision 1.27.10.1 1 1.27.10.1 martin /* $NetBSD: subr_cprng.c,v 1.27.10.1 2019/09/03 12:08:22 martin 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.27.10.1 martin __KERNEL_RCSID(0, "$NetBSD: subr_cprng.c,v 1.27.10.1 2019/09/03 12:08:22 martin 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.27.10.1 martin #include <crypto/nist_hash_drbg/nist_hash_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.27.10.1 martin if (nist_hash_drbg_initialize() != 0)
81 1.27.10.1 martin panic("NIST Hash_DRBG failed self-test");
82 1.23 pooka
83 1.23 pooka sysctl_createv(&random_sysctllog, 0, NULL, NULL,
84 1.23 pooka CTLFLAG_PERMANENT,
85 1.23 pooka CTLTYPE_INT, "urandom",
86 1.23 pooka SYSCTL_DESCR("Random integer value"),
87 1.23 pooka sysctl_kern_urnd, 0, NULL, 0,
88 1.23 pooka CTL_KERN, KERN_URND, CTL_EOL);
89 1.23 pooka sysctl_createv(&random_sysctllog, 0, NULL, NULL,
90 1.23 pooka CTLFLAG_PERMANENT,
91 1.23 pooka CTLTYPE_INT, "arandom",
92 1.23 pooka SYSCTL_DESCR("n bytes of random data"),
93 1.23 pooka sysctl_kern_arnd, 0, NULL, 0,
94 1.23 pooka CTL_KERN, KERN_ARND, CTL_EOL);
95 1.1 tls }
96 1.1 tls
97 1.1 tls static inline uint32_t
98 1.1 tls cprng_counter(void)
99 1.1 tls {
100 1.1 tls struct timeval tv;
101 1.1 tls
102 1.1 tls #if defined(__HAVE_CPU_COUNTER)
103 1.1 tls if (cpu_hascounter())
104 1.1 tls return cpu_counter32();
105 1.1 tls #endif
106 1.1 tls if (__predict_false(cold)) {
107 1.24 tls static int ctr;
108 1.1 tls /* microtime unsafe if clock not running yet */
109 1.24 tls return ctr++;
110 1.1 tls }
111 1.24 tls getmicrotime(&tv);
112 1.1 tls return (tv.tv_sec * 1000000 + tv.tv_usec);
113 1.1 tls }
114 1.1 tls
115 1.18 riastrad struct cprng_strong {
116 1.18 riastrad char cs_name[16];
117 1.18 riastrad int cs_flags;
118 1.18 riastrad kmutex_t cs_lock;
119 1.24 tls percpu_t *cs_percpu;
120 1.18 riastrad kcondvar_t cs_cv;
121 1.18 riastrad struct selinfo cs_selq;
122 1.18 riastrad struct rndsink *cs_rndsink;
123 1.18 riastrad bool cs_ready;
124 1.27.10.1 martin NIST_HASH_DRBG cs_drbg;
125 1.21 riastrad
126 1.21 riastrad /* XXX Kludge for /dev/random `information-theoretic' properties. */
127 1.21 riastrad unsigned int cs_remaining;
128 1.18 riastrad };
129 1.18 riastrad
130 1.18 riastrad struct cprng_strong *
131 1.18 riastrad cprng_strong_create(const char *name, int ipl, int flags)
132 1.18 riastrad {
133 1.18 riastrad const uint32_t cc = cprng_counter();
134 1.18 riastrad struct cprng_strong *const cprng = kmem_alloc(sizeof(*cprng),
135 1.18 riastrad KM_SLEEP);
136 1.18 riastrad
137 1.18 riastrad /*
138 1.18 riastrad * rndsink_request takes a spin lock at IPL_VM, so we can be no
139 1.18 riastrad * higher than that.
140 1.18 riastrad */
141 1.22 skrll KASSERT(ipl != IPL_SCHED && ipl != IPL_HIGH);
142 1.18 riastrad
143 1.18 riastrad /* Initialize the easy fields. */
144 1.18 riastrad (void)strlcpy(cprng->cs_name, name, sizeof(cprng->cs_name));
145 1.18 riastrad cprng->cs_flags = flags;
146 1.18 riastrad mutex_init(&cprng->cs_lock, MUTEX_DEFAULT, ipl);
147 1.18 riastrad cv_init(&cprng->cs_cv, cprng->cs_name);
148 1.18 riastrad selinit(&cprng->cs_selq);
149 1.27.10.1 martin cprng->cs_rndsink = rndsink_create(NIST_HASH_DRBG_MIN_SEEDLEN_BYTES,
150 1.18 riastrad &cprng_strong_rndsink_callback, cprng);
151 1.18 riastrad
152 1.18 riastrad /* Get some initial entropy. Record whether it is full entropy. */
153 1.27.10.1 martin uint8_t seed[NIST_HASH_DRBG_MIN_SEEDLEN_BYTES];
154 1.25 riastrad mutex_enter(&cprng->cs_lock);
155 1.18 riastrad cprng->cs_ready = rndsink_request(cprng->cs_rndsink, seed,
156 1.18 riastrad sizeof(seed));
157 1.27.10.1 martin if (nist_hash_drbg_instantiate(&cprng->cs_drbg, seed, sizeof(seed),
158 1.18 riastrad &cc, sizeof(cc), cprng->cs_name, sizeof(cprng->cs_name)))
159 1.27.10.1 martin /* XXX Fix nist_hash_drbg API so this can't happen. */
160 1.27.10.1 martin panic("cprng %s: NIST Hash_DRBG instantiation failed",
161 1.18 riastrad cprng->cs_name);
162 1.20 riastrad explicit_memset(seed, 0, sizeof(seed));
163 1.18 riastrad
164 1.21 riastrad if (ISSET(flags, CPRNG_HARD))
165 1.27.10.1 martin cprng->cs_remaining = NIST_HASH_DRBG_MIN_SEEDLEN_BYTES;
166 1.21 riastrad else
167 1.21 riastrad cprng->cs_remaining = 0;
168 1.21 riastrad
169 1.18 riastrad if (!cprng->cs_ready && !ISSET(flags, CPRNG_INIT_ANY))
170 1.18 riastrad printf("cprng %s: creating with partial entropy\n",
171 1.18 riastrad cprng->cs_name);
172 1.25 riastrad mutex_exit(&cprng->cs_lock);
173 1.18 riastrad
174 1.18 riastrad return cprng;
175 1.18 riastrad }
176 1.18 riastrad
177 1.18 riastrad void
178 1.18 riastrad cprng_strong_destroy(struct cprng_strong *cprng)
179 1.8 tls {
180 1.8 tls
181 1.18 riastrad /*
182 1.18 riastrad * Destroy the rndsink first to prevent calls to the callback.
183 1.18 riastrad */
184 1.18 riastrad rndsink_destroy(cprng->cs_rndsink);
185 1.8 tls
186 1.18 riastrad KASSERT(!cv_has_waiters(&cprng->cs_cv));
187 1.18 riastrad #if 0
188 1.18 riastrad KASSERT(!select_has_waiters(&cprng->cs_selq)) /* XXX ? */
189 1.18 riastrad #endif
190 1.15 tls
191 1.27.10.1 martin nist_hash_drbg_destroy(&cprng->cs_drbg);
192 1.18 riastrad seldestroy(&cprng->cs_selq);
193 1.18 riastrad cv_destroy(&cprng->cs_cv);
194 1.18 riastrad mutex_destroy(&cprng->cs_lock);
195 1.18 riastrad
196 1.20 riastrad explicit_memset(cprng, 0, sizeof(*cprng)); /* paranoia */
197 1.18 riastrad kmem_free(cprng, sizeof(*cprng));
198 1.8 tls }
199 1.8 tls
200 1.18 riastrad /*
201 1.18 riastrad * Generate some data from cprng. Block or return zero bytes,
202 1.18 riastrad * depending on flags & FNONBLOCK, if cprng was created without
203 1.18 riastrad * CPRNG_REKEY_ANY.
204 1.18 riastrad */
205 1.18 riastrad size_t
206 1.18 riastrad cprng_strong(struct cprng_strong *cprng, void *buffer, size_t bytes, int flags)
207 1.5 tls {
208 1.18 riastrad size_t result;
209 1.18 riastrad
210 1.18 riastrad /* Caller must loop for more than CPRNG_MAX_LEN bytes. */
211 1.18 riastrad bytes = MIN(bytes, CPRNG_MAX_LEN);
212 1.18 riastrad
213 1.18 riastrad mutex_enter(&cprng->cs_lock);
214 1.18 riastrad
215 1.18 riastrad if (ISSET(cprng->cs_flags, CPRNG_REKEY_ANY)) {
216 1.18 riastrad if (!cprng->cs_ready)
217 1.18 riastrad cprng_strong_reseed(cprng);
218 1.18 riastrad } else {
219 1.18 riastrad while (!cprng->cs_ready) {
220 1.18 riastrad if (ISSET(flags, FNONBLOCK) ||
221 1.18 riastrad !ISSET(cprng->cs_flags, CPRNG_USE_CV) ||
222 1.18 riastrad cv_wait_sig(&cprng->cs_cv, &cprng->cs_lock)) {
223 1.18 riastrad result = 0;
224 1.18 riastrad goto out;
225 1.8 tls }
226 1.8 tls }
227 1.5 tls }
228 1.18 riastrad
229 1.21 riastrad /*
230 1.21 riastrad * Debit the entropy if requested.
231 1.21 riastrad *
232 1.21 riastrad * XXX Kludge for /dev/random `information-theoretic' properties.
233 1.21 riastrad */
234 1.21 riastrad if (__predict_false(ISSET(cprng->cs_flags, CPRNG_HARD))) {
235 1.21 riastrad KASSERT(0 < cprng->cs_remaining);
236 1.27.10.1 martin KASSERT(cprng->cs_remaining <=
237 1.27.10.1 martin NIST_HASH_DRBG_MIN_SEEDLEN_BYTES);
238 1.21 riastrad if (bytes < cprng->cs_remaining) {
239 1.21 riastrad cprng->cs_remaining -= bytes;
240 1.21 riastrad } else {
241 1.21 riastrad bytes = cprng->cs_remaining;
242 1.27.10.1 martin cprng->cs_remaining = NIST_HASH_DRBG_MIN_SEEDLEN_BYTES;
243 1.21 riastrad cprng->cs_ready = false;
244 1.21 riastrad rndsink_schedule(cprng->cs_rndsink);
245 1.21 riastrad }
246 1.27.10.1 martin KASSERT(bytes <= NIST_HASH_DRBG_MIN_SEEDLEN_BYTES);
247 1.21 riastrad KASSERT(0 < cprng->cs_remaining);
248 1.27.10.1 martin KASSERT(cprng->cs_remaining <=
249 1.27.10.1 martin NIST_HASH_DRBG_MIN_SEEDLEN_BYTES);
250 1.21 riastrad }
251 1.21 riastrad
252 1.18 riastrad cprng_strong_generate(cprng, buffer, bytes);
253 1.18 riastrad result = bytes;
254 1.18 riastrad
255 1.18 riastrad out: mutex_exit(&cprng->cs_lock);
256 1.18 riastrad return result;
257 1.18 riastrad }
258 1.18 riastrad
259 1.18 riastrad static void filt_cprng_detach(struct knote *);
260 1.18 riastrad static int filt_cprng_event(struct knote *, long);
261 1.18 riastrad
262 1.18 riastrad static const struct filterops cprng_filtops =
263 1.18 riastrad { 1, NULL, filt_cprng_detach, filt_cprng_event };
264 1.18 riastrad
265 1.18 riastrad int
266 1.18 riastrad cprng_strong_kqfilter(struct cprng_strong *cprng, struct knote *kn)
267 1.18 riastrad {
268 1.18 riastrad
269 1.18 riastrad switch (kn->kn_filter) {
270 1.18 riastrad case EVFILT_READ:
271 1.18 riastrad kn->kn_fop = &cprng_filtops;
272 1.18 riastrad kn->kn_hook = cprng;
273 1.18 riastrad mutex_enter(&cprng->cs_lock);
274 1.18 riastrad SLIST_INSERT_HEAD(&cprng->cs_selq.sel_klist, kn, kn_selnext);
275 1.18 riastrad mutex_exit(&cprng->cs_lock);
276 1.18 riastrad return 0;
277 1.18 riastrad
278 1.18 riastrad case EVFILT_WRITE:
279 1.18 riastrad default:
280 1.18 riastrad return EINVAL;
281 1.8 tls }
282 1.5 tls }
283 1.5 tls
284 1.5 tls static void
285 1.18 riastrad filt_cprng_detach(struct knote *kn)
286 1.1 tls {
287 1.18 riastrad struct cprng_strong *const cprng = kn->kn_hook;
288 1.18 riastrad
289 1.18 riastrad mutex_enter(&cprng->cs_lock);
290 1.18 riastrad SLIST_REMOVE(&cprng->cs_selq.sel_klist, kn, knote, kn_selnext);
291 1.18 riastrad mutex_exit(&cprng->cs_lock);
292 1.18 riastrad }
293 1.8 tls
294 1.18 riastrad static int
295 1.18 riastrad filt_cprng_event(struct knote *kn, long hint)
296 1.18 riastrad {
297 1.18 riastrad struct cprng_strong *const cprng = kn->kn_hook;
298 1.18 riastrad int ret;
299 1.1 tls
300 1.18 riastrad if (hint == NOTE_SUBMIT)
301 1.18 riastrad KASSERT(mutex_owned(&cprng->cs_lock));
302 1.18 riastrad else
303 1.18 riastrad mutex_enter(&cprng->cs_lock);
304 1.18 riastrad if (cprng->cs_ready) {
305 1.18 riastrad kn->kn_data = CPRNG_MAX_LEN; /* XXX Too large? */
306 1.18 riastrad ret = 1;
307 1.18 riastrad } else {
308 1.18 riastrad ret = 0;
309 1.7 tls }
310 1.18 riastrad if (hint == NOTE_SUBMIT)
311 1.18 riastrad KASSERT(mutex_owned(&cprng->cs_lock));
312 1.18 riastrad else
313 1.18 riastrad mutex_exit(&cprng->cs_lock);
314 1.7 tls
315 1.18 riastrad return ret;
316 1.1 tls }
317 1.1 tls
318 1.18 riastrad int
319 1.18 riastrad cprng_strong_poll(struct cprng_strong *cprng, int events)
320 1.15 tls {
321 1.18 riastrad int revents;
322 1.18 riastrad
323 1.18 riastrad if (!ISSET(events, (POLLIN | POLLRDNORM)))
324 1.18 riastrad return 0;
325 1.18 riastrad
326 1.18 riastrad mutex_enter(&cprng->cs_lock);
327 1.18 riastrad if (cprng->cs_ready) {
328 1.18 riastrad revents = (events & (POLLIN | POLLRDNORM));
329 1.18 riastrad } else {
330 1.18 riastrad selrecord(curlwp, &cprng->cs_selq);
331 1.18 riastrad revents = 0;
332 1.15 tls }
333 1.18 riastrad mutex_exit(&cprng->cs_lock);
334 1.18 riastrad
335 1.18 riastrad return revents;
336 1.18 riastrad }
337 1.18 riastrad
338 1.18 riastrad /*
339 1.27.10.1 martin * XXX Move nist_hash_drbg_reseed_advised_p and
340 1.27.10.1 martin * nist_hash_drbg_reseed_needed_p into the nist_hash_drbg API and make
341 1.27.10.1 martin * the NIST_HASH_DRBG structure opaque.
342 1.18 riastrad */
343 1.18 riastrad static bool
344 1.27.10.1 martin nist_hash_drbg_reseed_advised_p(NIST_HASH_DRBG *drbg)
345 1.18 riastrad {
346 1.18 riastrad
347 1.27.10.1 martin return (drbg->reseed_counter > (NIST_HASH_DRBG_RESEED_INTERVAL / 2));
348 1.15 tls }
349 1.15 tls
350 1.18 riastrad static bool
351 1.27.10.1 martin nist_hash_drbg_reseed_needed_p(NIST_HASH_DRBG *drbg)
352 1.1 tls {
353 1.1 tls
354 1.27.10.1 martin return (drbg->reseed_counter >= NIST_HASH_DRBG_RESEED_INTERVAL);
355 1.18 riastrad }
356 1.18 riastrad
357 1.18 riastrad /*
358 1.18 riastrad * Generate some data from the underlying generator.
359 1.18 riastrad */
360 1.18 riastrad static void
361 1.21 riastrad cprng_strong_generate(struct cprng_strong *cprng, void *buffer, size_t bytes)
362 1.18 riastrad {
363 1.18 riastrad const uint32_t cc = cprng_counter();
364 1.18 riastrad
365 1.18 riastrad KASSERT(bytes <= CPRNG_MAX_LEN);
366 1.18 riastrad KASSERT(mutex_owned(&cprng->cs_lock));
367 1.18 riastrad
368 1.18 riastrad /*
369 1.27.10.1 martin * Generate some data from the NIST Hash_DRBG. Caller
370 1.18 riastrad * guarantees reseed if we're not ready, and if we exhaust the
371 1.18 riastrad * generator, we mark ourselves not ready. Consequently, this
372 1.27.10.1 martin * call to the Hash_DRBG should not fail.
373 1.18 riastrad */
374 1.27.10.1 martin if (__predict_false(nist_hash_drbg_generate(&cprng->cs_drbg, buffer,
375 1.18 riastrad bytes, &cc, sizeof(cc))))
376 1.27.10.1 martin panic("cprng %s: NIST Hash_DRBG failed", cprng->cs_name);
377 1.1 tls
378 1.18 riastrad /*
379 1.18 riastrad * If we've been seeing a lot of use, ask for some fresh
380 1.18 riastrad * entropy soon.
381 1.18 riastrad */
382 1.27.10.1 martin if (__predict_false(nist_hash_drbg_reseed_advised_p(&cprng->cs_drbg)))
383 1.18 riastrad rndsink_schedule(cprng->cs_rndsink);
384 1.1 tls
385 1.18 riastrad /*
386 1.18 riastrad * If we just exhausted the generator, inform the next user
387 1.18 riastrad * that we need a reseed.
388 1.18 riastrad */
389 1.27.10.1 martin if (__predict_false(nist_hash_drbg_reseed_needed_p(&cprng->cs_drbg))) {
390 1.18 riastrad cprng->cs_ready = false;
391 1.18 riastrad rndsink_schedule(cprng->cs_rndsink); /* paranoia */
392 1.1 tls }
393 1.18 riastrad }
394 1.1 tls
395 1.18 riastrad /*
396 1.18 riastrad * Reseed with whatever we can get from the system entropy pool right now.
397 1.18 riastrad */
398 1.18 riastrad static void
399 1.18 riastrad cprng_strong_reseed(struct cprng_strong *cprng)
400 1.18 riastrad {
401 1.27.10.1 martin uint8_t seed[NIST_HASH_DRBG_MIN_SEEDLEN_BYTES];
402 1.5 tls
403 1.18 riastrad KASSERT(mutex_owned(&cprng->cs_lock));
404 1.1 tls
405 1.18 riastrad const bool full_entropy = rndsink_request(cprng->cs_rndsink, seed,
406 1.18 riastrad sizeof(seed));
407 1.18 riastrad cprng_strong_reseed_from(cprng, seed, sizeof(seed), full_entropy);
408 1.20 riastrad explicit_memset(seed, 0, sizeof(seed));
409 1.1 tls }
410 1.1 tls
411 1.18 riastrad /*
412 1.18 riastrad * Reseed with the given seed. If we now have full entropy, notify waiters.
413 1.18 riastrad */
414 1.18 riastrad static void
415 1.18 riastrad cprng_strong_reseed_from(struct cprng_strong *cprng,
416 1.18 riastrad const void *seed, size_t bytes, bool full_entropy)
417 1.1 tls {
418 1.18 riastrad const uint32_t cc = cprng_counter();
419 1.1 tls
420 1.27.10.1 martin KASSERT(bytes == NIST_HASH_DRBG_MIN_SEEDLEN_BYTES);
421 1.18 riastrad KASSERT(mutex_owned(&cprng->cs_lock));
422 1.1 tls
423 1.1 tls /*
424 1.18 riastrad * Notify anyone interested in the partiality of entropy in our
425 1.18 riastrad * seed -- anyone waiting for full entropy, or any system
426 1.18 riastrad * operators interested in knowing when the entropy pool is
427 1.18 riastrad * running on fumes.
428 1.1 tls */
429 1.18 riastrad if (full_entropy) {
430 1.18 riastrad if (!cprng->cs_ready) {
431 1.18 riastrad cprng->cs_ready = true;
432 1.18 riastrad cv_broadcast(&cprng->cs_cv);
433 1.18 riastrad selnotify(&cprng->cs_selq, (POLLIN | POLLRDNORM),
434 1.18 riastrad NOTE_SUBMIT);
435 1.18 riastrad }
436 1.18 riastrad } else {
437 1.18 riastrad /*
438 1.18 riastrad * XXX Is there is any harm in reseeding with partial
439 1.18 riastrad * entropy when we had full entropy before? If so,
440 1.18 riastrad * remove the conditional on this message.
441 1.18 riastrad */
442 1.18 riastrad if (!cprng->cs_ready &&
443 1.18 riastrad !ISSET(cprng->cs_flags, CPRNG_REKEY_ANY))
444 1.18 riastrad printf("cprng %s: reseeding with partial entropy\n",
445 1.18 riastrad cprng->cs_name);
446 1.18 riastrad }
447 1.18 riastrad
448 1.27.10.1 martin if (nist_hash_drbg_reseed(&cprng->cs_drbg, seed, bytes, &cc,
449 1.27.10.1 martin sizeof(cc)))
450 1.27.10.1 martin /* XXX Fix nist_hash_drbg API so this can't happen. */
451 1.27.10.1 martin panic("cprng %s: NIST Hash_DRBG reseed failed",
452 1.27.10.1 martin cprng->cs_name);
453 1.5 tls
454 1.26 christos #if DIAGNOSTIC
455 1.18 riastrad cprng_strong_rngtest(cprng);
456 1.8 tls #endif
457 1.1 tls }
458 1.1 tls
459 1.26 christos #if DIAGNOSTIC
460 1.18 riastrad /*
461 1.18 riastrad * Generate some output and apply a statistical RNG test to it.
462 1.18 riastrad */
463 1.18 riastrad static void
464 1.18 riastrad cprng_strong_rngtest(struct cprng_strong *cprng)
465 1.1 tls {
466 1.5 tls
467 1.18 riastrad KASSERT(mutex_owned(&cprng->cs_lock));
468 1.18 riastrad
469 1.18 riastrad /* XXX Switch to a pool cache instead? */
470 1.18 riastrad rngtest_t *const rt = kmem_intr_alloc(sizeof(*rt), KM_NOSLEEP);
471 1.18 riastrad if (rt == NULL)
472 1.18 riastrad /* XXX Warn? */
473 1.18 riastrad return;
474 1.1 tls
475 1.18 riastrad (void)strlcpy(rt->rt_name, cprng->cs_name, sizeof(rt->rt_name));
476 1.6 tls
477 1.27.10.1 martin if (nist_hash_drbg_generate(&cprng->cs_drbg, rt->rt_b,
478 1.27.10.1 martin sizeof(rt->rt_b), NULL, 0))
479 1.27.10.1 martin panic("cprng %s: NIST Hash_DRBG failed after reseed",
480 1.18 riastrad cprng->cs_name);
481 1.5 tls
482 1.18 riastrad if (rngtest(rt)) {
483 1.18 riastrad printf("cprng %s: failed statistical RNG test\n",
484 1.18 riastrad cprng->cs_name);
485 1.18 riastrad /* XXX Not clear that this does any good... */
486 1.18 riastrad cprng->cs_ready = false;
487 1.18 riastrad rndsink_schedule(cprng->cs_rndsink);
488 1.18 riastrad }
489 1.5 tls
490 1.20 riastrad explicit_memset(rt, 0, sizeof(*rt)); /* paranoia */
491 1.18 riastrad kmem_intr_free(rt, sizeof(*rt));
492 1.1 tls }
493 1.18 riastrad #endif
494 1.1 tls
495 1.18 riastrad /*
496 1.18 riastrad * Feed entropy from an rndsink request into the CPRNG for which the
497 1.18 riastrad * request was issued.
498 1.18 riastrad */
499 1.18 riastrad static void
500 1.18 riastrad cprng_strong_rndsink_callback(void *context, const void *seed, size_t bytes)
501 1.1 tls {
502 1.18 riastrad struct cprng_strong *const cprng = context;
503 1.1 tls
504 1.18 riastrad mutex_enter(&cprng->cs_lock);
505 1.18 riastrad /* Assume that rndsinks provide only full-entropy output. */
506 1.18 riastrad cprng_strong_reseed_from(cprng, seed, bytes, true);
507 1.18 riastrad mutex_exit(&cprng->cs_lock);
508 1.1 tls }
509 1.23 pooka
510 1.23 pooka static cprng_strong_t *sysctl_prng;
511 1.23 pooka
512 1.23 pooka static int
513 1.23 pooka makeprng(void)
514 1.23 pooka {
515 1.23 pooka
516 1.23 pooka /* can't create in cprng_init(), too early */
517 1.23 pooka sysctl_prng = cprng_strong_create("sysctl", IPL_NONE,
518 1.23 pooka CPRNG_INIT_ANY|CPRNG_REKEY_ANY);
519 1.23 pooka return 0;
520 1.23 pooka }
521 1.23 pooka
522 1.23 pooka /*
523 1.23 pooka * sysctl helper routine for kern.urandom node. Picks a random number
524 1.23 pooka * for you.
525 1.23 pooka */
526 1.23 pooka static int
527 1.23 pooka sysctl_kern_urnd(SYSCTLFN_ARGS)
528 1.23 pooka {
529 1.23 pooka static ONCE_DECL(control);
530 1.23 pooka int v, rv;
531 1.23 pooka
532 1.23 pooka RUN_ONCE(&control, makeprng);
533 1.23 pooka rv = cprng_strong(sysctl_prng, &v, sizeof(v), 0);
534 1.23 pooka if (rv == sizeof(v)) {
535 1.23 pooka struct sysctlnode node = *rnode;
536 1.23 pooka node.sysctl_data = &v;
537 1.23 pooka return (sysctl_lookup(SYSCTLFN_CALL(&node)));
538 1.23 pooka }
539 1.23 pooka else
540 1.23 pooka return (EIO); /*XXX*/
541 1.23 pooka }
542 1.23 pooka
543 1.23 pooka /*
544 1.24 tls * sysctl helper routine for kern.arandom node. Fills the supplied
545 1.24 tls * structure with random data for you.
546 1.24 tls *
547 1.24 tls * This node was originally declared as type "int" but its implementation
548 1.24 tls * in OpenBSD, whence it came, would happily return up to 8K of data if
549 1.24 tls * requested. Evidently this was used to key RC4 in userspace.
550 1.24 tls *
551 1.24 tls * In NetBSD, the libc stack-smash-protection code reads 64 bytes
552 1.24 tls * from here at every program startup. So though it would be nice
553 1.24 tls * to make this node return only 32 or 64 bits, we can't. Too bad!
554 1.23 pooka */
555 1.23 pooka static int
556 1.23 pooka sysctl_kern_arnd(SYSCTLFN_ARGS)
557 1.23 pooka {
558 1.23 pooka int error;
559 1.23 pooka void *v;
560 1.23 pooka struct sysctlnode node = *rnode;
561 1.23 pooka
562 1.24 tls switch (*oldlenp) {
563 1.24 tls case 0:
564 1.23 pooka return 0;
565 1.24 tls default:
566 1.24 tls if (*oldlenp > 256) {
567 1.24 tls return E2BIG;
568 1.24 tls }
569 1.24 tls v = kmem_alloc(*oldlenp, KM_SLEEP);
570 1.24 tls cprng_fast(v, *oldlenp);
571 1.24 tls node.sysctl_data = v;
572 1.24 tls node.sysctl_size = *oldlenp;
573 1.24 tls error = sysctl_lookup(SYSCTLFN_CALL(&node));
574 1.24 tls kmem_free(v, *oldlenp);
575 1.24 tls return error;
576 1.24 tls }
577 1.23 pooka }
578