2 * Copyright (c) 2004-2014 The DragonFly Project. All rights reserved.
4 * This code is derived from software contributed to The DragonFly Project
5 * by Matthew Dillon <dillon@backplane.com>
6 * by Alex Hornung <alex@alexhornung.com>
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions, and the following disclaimer,
14 * without modification, immediately at the beginning of the file.
15 * 2. The name of the author may not be used to endorse or promote products
16 * derived from this software without specific prior written permission.
18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
19 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
22 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * Note: The word "entropy" is often incorrectly used to describe
33 * random data. The word "entropy" originates from the science of
34 * Physics. The correct descriptive definition would be something
35 * along the lines of "seed", "unpredictable numbers" or
36 * "unpredictable data".
38 * Note: Some /dev/[u]random implementations save "seed" between
39 * boots which represents a security hazard since an adversary
40 * could acquire this data (since it is stored in a file). If
41 * the unpredictable data used in the above routines is only
42 * generated during Kernel operation, then an adversary can only
43 * acquire that data through a Kernel security compromise and/or
44 * a cryptographic algorithm failure/cryptanalysis.
46 * Note: On FreeBSD-4.11, interrupts have to be manually enabled
47 * using the rndcontrol(8) command.
49 * --- DESIGN (FreeBSD-4.11 based) ---
51 * The rnddev module automatically initializes itself the first time
52 * it is used (client calls any public rnddev_*() interface routine).
53 * Both CSPRNGs are initially seeded from the precise nano[up]time() routines.
54 * Tests show this method produces good enough results, suitable for intended
55 * use. It is necessary for both CSPRNGs to be completely seeded, initially.
57 * After initialization and during Kernel operation the only suitable
58 * unpredictable data available is:
60 * (1) Keyboard scan-codes.
61 * (2) Nanouptime acquired by a Keyboard/Read-Event.
62 * (3) Suitable interrupt source; hard-disk/ATA-device.
64 * (X) Mouse-event (xyz-data unsuitable); NOT IMPLEMENTED.
66 * This data is added to both CSPRNGs in real-time as it happens/
67 * becomes-available. Additionally, unpredictable (?) data may be
68 * acquired from a true-random number generator if such a device is
69 * available to the system (not advisable !).
70 * Nanouptime() acquired by a Read-Event is a very important aspect of
71 * this design, since it ensures that unpredictable data is added to
72 * the CSPRNGs even if there are no other sources.
73 * The nanouptime() Kernel routine is used since time relative to
74 * boot is less adversary-known than time itself.
76 * This design has been thoroughly tested with debug logging
77 * and the output from both /dev/random and /dev/urandom has
78 * been tested with the DIEHARD test-suite; both pass.
80 * MODIFICATIONS MADE TO ORIGINAL "kern_random.c":
84 * o Changed ReadSeed() function to schedule future read-seed-events
85 * by at least one second. Previous implementation used a randomised
86 * scheduling { 0, 1, 2, 3 seconds }.
87 * o Changed SEED_NANOUP() function to use a "previous" accumulator
88 * algorithm similar to ReadSeed(). This ensures that there is no
89 * way that an adversary can tell what number is being added to the
90 * CSPRNGs, since the number added to the CSPRNGs at Event-Time is
91 * the sum of nanouptime()@Event and an unknown/secret number.
92 * o Changed rnddev_add_interrupt() function to schedule future
93 * interrupt-events by at least one second. Previous implementation
94 * had no scheduling algorithm which allowed an "interrupt storm"
95 * to occur resulting in skewed data entering into the CSPRNGs.
100 * o Some small cleanups and change all internal functions to be
102 * o Removed ReadSeed() since its functionality is already performed
103 * by another function { rnddev_add_interrupt_OR_read() } and remove
104 * the silly rndByte accumulator/feedback-thing (since multipying by
105 * rndByte could yield a value of 0).
106 * o Made IBAA/L14 public interface become static/private;
107 * Local to this file (not changed to that in the original C modules).
111 * o SEED_NANOUP() -> NANOUP_EVENT() function rename.
112 * o Make NANOUP_EVENT() handle the time-buffering directly so that all
113 * time-stamp-events use this single time-buffer (including keyboard).
114 * This removes dependancy on "time_second" Kernel variable.
115 * o Removed second-time-buffer code in rnddev_add_interrupt_OR_read (void).
116 * o Rewrote the time-buffering algorithm in NANOUP_EVENT() to use a
117 * randomised time-delay range.
121 * o Updated to (hopefully final) L15 algorithm.
125 * o Added missing (u_char *) cast in RnddevRead() function.
126 * o Changed copyright to 3-clause BSD license and cleaned up the layout
129 * For a proper changelog, refer to the version control history of this
133 #include <sys/types.h>
134 #include <sys/kernel.h>
135 #include <sys/systm.h>
136 #include <sys/poll.h>
137 #include <sys/event.h>
138 #include <sys/random.h>
139 #include <sys/systimer.h>
140 #include <sys/time.h>
141 #include <sys/proc.h>
142 #include <sys/lock.h>
143 #include <sys/sysctl.h>
144 #include <sys/spinlock.h>
145 #include <sys/csprng.h>
146 #include <machine/atomic.h>
147 #include <machine/clock.h>
149 #include <sys/spinlock2.h>
151 struct csprng_state csprng_state;
154 * Portability note: The u_char/unsigned char type is used where
155 * uint8_t from <stdint.h> or u_int8_t from <sys/types.h> should really
156 * be being used. On FreeBSD, it is safe to make the assumption that these
157 * different types are equivalent (on all architectures).
158 * The FreeBSD <sys/crypto/rc4> module also makes this assumption.
161 /*------------------------------ IBAA ----------------------------------*/
163 /*-------------------------- IBAA CSPRNG -------------------------------*/
166 * NOTE: The original source code from which this source code (IBAA)
167 * was taken has no copyright/license. The algorithm has no patent
168 * and is freely/publicly available from:
170 * http://www.burtleburtle.net/bob/rand/isaac.html
174 * ^ means XOR, & means bitwise AND, a<<b means shift a by b.
175 * barrel(a) shifts a 19 bits to the left, and bits wrap around
176 * ind(x) is (x AND 255), or (x mod 256)
178 typedef u_int32_t u4; /* unsigned four bytes, 32 bits */
181 #define SIZE (1 << ALPHA)
182 #define MASK (SIZE - 1)
183 #define ind(x) ((x) & (SIZE - 1))
184 #define barrel(a) (((a) << 20) ^ ((a) >> 12)) /* beta=32,shift=20 */
188 u4 *m, /* Memory: array of SIZE ALPHA-bit terms */
189 u4 *r, /* Results: the sequence, same size as m */
190 u4 *aa, /* Accumulator: a single value */
191 u4 *bb, /* the previous result */
192 u4 *counter /* counter */
200 for (i = 0; i < SIZE; ++i) {
202 a = barrel(a) + m[ind(i + (SIZE / 2))]; /* set a */
203 m[i] = y = m[ind(x)] + a + b; /* set m */
204 r[i] = b = m[ind(y >> ALPHA)] + x; /* set r */
209 /*-------------------------- IBAA CSPRNG -------------------------------*/
212 static u4 IBAA_memory[SIZE];
213 static u4 IBAA_results[SIZE];
216 static u4 IBAA_counter;
218 static volatile int IBAA_byte_index;
221 static void IBAA_Init(void);
222 static void IBAA_Call(void);
223 static void IBAA_Seed(const u_int32_t val);
224 static u_char IBAA_Byte(void);
234 for (i = 0; i < SIZE; ++i) {
237 IBAA_aa = IBAA_bb = 0;
239 IBAA_byte_index = sizeof(IBAA_results); /* force IBAA_Call() */
243 * PRIVATE: Call IBAA to produce 256 32-bit u4 results.
248 IBAA(IBAA_memory, IBAA_results, &IBAA_aa, &IBAA_bb, &IBAA_counter);
253 * Add a 32-bit u4 seed value into IBAAs memory. Mix the low 4 bits
254 * with 4 bits of PNG data to reduce the possibility of a seeding-based
258 IBAA_Seed (const u_int32_t val)
263 iptr = &IBAA_memory[memIndex & MASK];
264 *iptr = ((*iptr << 3) | (*iptr >> 29)) + (val ^ (IBAA_Byte() & 15));
269 IBAA_Vector (const char *buf, int bytes)
273 while (bytes >= sizeof(int)) {
274 IBAA_Seed(*(const int *)buf);
276 bytes -= sizeof(int);
280 * Warm up the generator to get rid of weak initial states.
282 for (i = 0; i < 10; ++i)
287 * Extract a byte from IBAAs 256 32-bit u4 results array.
289 * NOTE: This code is designed to prevent MP races from taking
290 * IBAA_byte_index out of bounds.
298 index = IBAA_byte_index;
299 if (index == sizeof(IBAA_results)) {
303 result = ((u_char *)IBAA_results)[index];
304 IBAA_byte_index = index + 1;
308 /*------------------------------ IBAA ----------------------------------*/
311 /*------------------------------- L15 ----------------------------------*/
314 * IMPORTANT NOTE: LByteType must be exactly 8-bits in size or this software
315 * will not function correctly.
317 typedef unsigned char LByteType;
319 #define L15_STATE_SIZE 256
321 static LByteType L15_x, L15_y;
322 static LByteType L15_start_x;
323 static LByteType L15_state[L15_STATE_SIZE];
329 static void L15_Swap(const LByteType pos1, const LByteType pos2);
330 static void L15_InitState(void);
331 static void L15_KSA(const LByteType * const key,
332 const size_t keyLen);
333 static void L15_Discard(const LByteType numCalls);
338 static void L15(const LByteType * const key, const size_t keyLen);
339 static LByteType L15_Byte(void);
340 static void L15_Vector(const LByteType * const key,
341 const size_t keyLen);
344 L15_Swap(const LByteType pos1, const LByteType pos2)
346 const LByteType save1 = L15_state[pos1];
348 L15_state[pos1] = L15_state[pos2];
349 L15_state[pos2] = save1;
356 for (i = 0; i < L15_STATE_SIZE; ++i)
360 #define L_SCHEDULE(xx) \
362 for (i = 0; i < L15_STATE_SIZE; ++i) { \
363 L15_Swap(i, (stateIndex += (L15_state[i] + (xx)))); \
367 L15_KSA (const LByteType * const key, const size_t keyLen)
370 static LByteType stateIndex = 0;
372 for (keyIndex = 0; keyIndex < keyLen; ++keyIndex) {
373 L_SCHEDULE(key[keyIndex]);
379 L15_Discard(const LByteType numCalls)
382 for (i = 0; i < numCalls; ++i) {
392 L15(const LByteType * const key, const size_t keyLen)
394 L15_x = L15_start_x = 0;
395 L15_y = L15_STATE_SIZE - 1;
397 L15_KSA(key, keyLen);
398 L15_Discard(L15_Byte());
406 L15_Swap(L15_state[L15_x], L15_y);
407 z = (L15_state [L15_x++] + L15_state[L15_y--]);
408 if (L15_x == L15_start_x) {
411 return (L15_state[z]);
415 L15_Vector (const LByteType * const key, const size_t keyLen)
417 L15_KSA(key, keyLen);
420 /*------------------------------- L15 ----------------------------------*/
422 /************************************************************************
424 ************************************************************************
426 * By Robin J Carey, Matthew Dillon and Alex Hornung.
429 static int rand_thread_value;
430 static void NANOUP_EVENT(void);
431 static thread_t rand_td;
432 static struct spinlock rand_spin;
434 static int sysctl_kern_random(SYSCTL_HANDLER_ARGS);
436 static int nrandevents;
437 static int rand_mode = 2;
438 static struct systimer systimer_rand;
440 static int sysctl_kern_rand_mode(SYSCTL_HANDLER_ARGS);
442 SYSCTL_INT(_kern, OID_AUTO, nrandevents, CTLFLAG_RD, &nrandevents, 0, "");
443 SYSCTL_PROC(_kern, OID_AUTO, random, CTLFLAG_RD | CTLFLAG_ANYBODY, 0, 0,
444 sysctl_kern_random, "I", "Acquire random data");
445 SYSCTL_PROC(_kern, OID_AUTO, rand_mode, CTLTYPE_STRING | CTLFLAG_RW, NULL, 0,
446 sysctl_kern_rand_mode, "A", "RNG mode (csprng, ibaa or mixed)");
450 * Called from early boot (pre-SMP)
453 rand_initialize(void)
458 csprng_init(&csprng_state);
461 * XXX: we do the reseeding when someone uses the RNG instead
462 * of regularly using init_reseed (which initializes a callout)
463 * to avoid unnecessary and regular reseeding.
465 csprng_init_reseed(&csprng_state);
469 spin_init(&rand_spin, "randinit");
471 /* Initialize IBAA. */
474 /* Initialize L15. */
476 L15((const LByteType *)&now.tv_nsec, sizeof(now.tv_nsec));
477 for (i = 0; i < (SIZE / 2); ++i) {
479 add_buffer_randomness_src((const uint8_t *)&now.tv_nsec,
480 sizeof(now.tv_nsec), RAND_SRC_TIMING);
482 add_buffer_randomness_src((const uint8_t *)&now.tv_nsec,
483 sizeof(now.tv_nsec), RAND_SRC_TIMING);
487 * Warm up the generator to get rid of weak initial states.
489 for (i = 0; i < 10; ++i)
497 add_keyboard_randomness(u_char scancode)
499 spin_lock(&rand_spin);
500 L15_Vector((const LByteType *) &scancode, sizeof (scancode));
501 spin_unlock(&rand_spin);
502 add_interrupt_randomness(0);
506 * Interrupt events. This is SMP safe and allowed to race.
508 * This adjusts rand_thread_value which will be incorporated into the next
509 * time-buffered seed. It does not effect the seeding period per-say.
512 add_interrupt_randomness(int intr)
515 rand_thread_value = (rand_thread_value << 4) ^ 1 ^
516 ((int)rdtsc() % 151);
518 ++rand_thread_value; /* ~1 bit */
522 * True random number source
525 add_buffer_randomness(const char *buf, int bytes)
527 spin_lock(&rand_spin);
528 L15_Vector((const LByteType *)buf, bytes);
529 IBAA_Vector(buf, bytes);
530 spin_unlock(&rand_spin);
532 atomic_add_int(&nrandevents, 1);
534 csprng_add_entropy(&csprng_state, RAND_SRC_UNKNOWN,
535 (const uint8_t *)buf, bytes, 0);
542 add_buffer_randomness_src(const char *buf, int bytes, int srcid)
544 spin_lock(&rand_spin);
545 L15_Vector((const LByteType *)buf, bytes);
546 IBAA_Vector(buf, bytes);
547 spin_unlock(&rand_spin);
549 atomic_add_int(&nrandevents, 1);
551 csprng_add_entropy(&csprng_state, srcid & 0xff,
552 (const uint8_t *)buf, bytes, 0);
559 * Kqueue filter (always succeeds)
562 random_filter_read(struct knote *kn, long hint)
568 * Heavy weight random number generator. May return less then the
569 * requested number of bytes.
571 * Instead of stopping early,
574 read_random(void *buf, u_int nbytes)
578 if (rand_mode == 0) {
579 /* Only use CSPRNG */
580 i = csprng_get_random(&csprng_state, buf, nbytes, 0);
581 } else if (rand_mode == 1) {
583 spin_lock(&rand_spin);
584 for (i = 0; i < nbytes; i++)
585 ((u_char *)buf)[i] = IBAA_Byte();
586 spin_unlock(&rand_spin);
588 /* Mix both CSPRNG and IBAA */
589 i = csprng_get_random(&csprng_state, buf, nbytes, 0);
590 spin_lock(&rand_spin);
591 for (j = 0; j < i; j++)
592 ((u_char *)buf)[j] ^= IBAA_Byte();
593 spin_unlock(&rand_spin);
596 add_interrupt_randomness(0);
597 return (i > 0) ? i : 0;
601 * Heavy weight random number generator. Must return the requested
605 read_random_unlimited(void *buf, u_int nbytes)
609 spin_lock(&rand_spin);
610 for (i = 0; i < nbytes; ++i)
611 ((u_char *)buf)[i] = IBAA_Byte();
612 spin_unlock(&rand_spin);
613 add_interrupt_randomness(0);
618 * Read random data via sysctl().
622 sysctl_kern_random(SYSCTL_HANDLER_ARGS)
633 if ((r = n) > sizeof(buf))
635 read_random_unlimited(buf, r);
636 error = SYSCTL_OUT(req, buf, r);
645 * Change the random mode via sysctl().
649 rand_mode_to_str(int mode)
665 sysctl_kern_rand_mode(SYSCTL_HANDLER_ARGS)
670 strncpy(mode, rand_mode_to_str(rand_mode), sizeof(mode)-1);
671 error = sysctl_handle_string(oidp, mode, sizeof(mode), req);
672 if (error || req->newptr == NULL)
675 if ((strncmp(mode, "csprng", sizeof(mode))) == 0)
677 else if ((strncmp(mode, "ibaa", sizeof(mode))) == 0)
679 else if ((strncmp(mode, "mixed", sizeof(mode))) == 0)
688 * Random number generator helper thread. This limits code overhead from
689 * high frequency events by delaying the clearing of rand_thread_value.
691 * This is a time-buffered loop, with a randomizing delay. Note that interrupt
692 * entropy does not cause the thread to wakeup any faster, but does improve the
693 * quality of the entropy produced.
697 rand_thread_loop(void *dummy)
706 spin_lock(&rand_spin);
707 count = (uint8_t)L15_Byte();
708 spin_unlock(&rand_spin);
711 * Calculate 1/10 of a second to 2/10 of a second, fine-grained
712 * using a L15_Byte() feedback.
714 * Go faster in the first 1200 seconds after boot. This effects
715 * the time-after-next interrupt (pipeline delay).
717 count = sys_cputimer->freq * (count + 256) / (256 * 10);
718 if (time_uptime < 120)
719 count = count / 10 + 1;
720 systimer_rand.periodic = count;
722 tsleep(rand_td, 0, "rwait", 0);
727 * Systimer trigger - fine-grained random trigger
731 rand_thread_wakeup(struct systimer *timer, int in_ipi, struct intrframe *frame)
738 rand_thread_init(void)
740 systimer_init_periodic_nq(&systimer_rand, rand_thread_wakeup, NULL, 25);
741 lwkt_create(rand_thread_loop, NULL, &rand_td, NULL, 0, 0, "random");
744 SYSINIT(rand, SI_SUB_HELPER_THREADS, SI_ORDER_ANY, rand_thread_init, 0);
747 * Caller is time-buffered. Incorporate any accumulated interrupt randomness
748 * as well as the high frequency bits of the TSC.
750 * A delta nanoseconds value is used to remove absolute time from the generated
751 * entropy. Even though we are pushing 32 bits, this entropy is probably only
752 * good for one or two bits without any interrupt sources, and possibly 8 bits with.
757 static struct timespec last;
762 * Delta nanoseconds since last event
765 nsec = now.tv_nsec - last.tv_nsec;
769 * Interrupt randomness.
771 nsec ^= rand_thread_value;
774 * The TSC, if present, generally has an even higher
775 * resolution. Integrate a portion of it into our seed.
778 nsec ^= (rdtsc() & 255) << 8;
784 add_buffer_randomness_src((const uint8_t *)&nsec, sizeof(nsec), RAND_SRC_INTR);