xref: /freebsd/lib/libc/gen/arc4random.c (revision d0b7445904f592bf379d64932fb6f1fdc29c4aa7)
1e9a2e4d1SXin LI /*	$OpenBSD: arc4random.c,v 1.58 2022/07/31 13:41:45 tb Exp $	*/
2c0b48470SDavid Schultz 
383a03b38SAndrey A. Chernov /*
4860c4e58SAndrey A. Chernov  * Copyright (c) 1996, David Mazieres <dm@uun.org>
5860c4e58SAndrey A. Chernov  * Copyright (c) 2008, Damien Miller <djm@openbsd.org>
6c1e80940SXin LI  * Copyright (c) 2013, Markus Friedl <markus@openbsd.org>
7c1e80940SXin LI  * Copyright (c) 2014, Theo de Raadt <deraadt@openbsd.org>
883a03b38SAndrey A. Chernov  *
9860c4e58SAndrey A. Chernov  * Permission to use, copy, modify, and distribute this software for any
10860c4e58SAndrey A. Chernov  * purpose with or without fee is hereby granted, provided that the above
11860c4e58SAndrey A. Chernov  * copyright notice and this permission notice appear in all copies.
12860c4e58SAndrey A. Chernov  *
13860c4e58SAndrey A. Chernov  * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
14860c4e58SAndrey A. Chernov  * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
15860c4e58SAndrey A. Chernov  * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
16860c4e58SAndrey A. Chernov  * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
17860c4e58SAndrey A. Chernov  * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
18860c4e58SAndrey A. Chernov  * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
19860c4e58SAndrey A. Chernov  * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
2083a03b38SAndrey A. Chernov  */
2183a03b38SAndrey A. Chernov 
2283a03b38SAndrey A. Chernov /*
23c1e80940SXin LI  * ChaCha based random number generator for OpenBSD.
2483a03b38SAndrey A. Chernov  */
2583a03b38SAndrey A. Chernov 
26d201fe46SDaniel Eischen #include "namespace.h"
27f8e8a06dSConrad Meyer #if defined(__FreeBSD__)
28f8e8a06dSConrad Meyer #include <assert.h>
29f8e8a06dSConrad Meyer #endif
3083a03b38SAndrey A. Chernov #include <fcntl.h>
317a0789b4SDavid Schultz #include <limits.h>
325295209eSBrian Feldman #include <pthread.h>
33c1e80940SXin LI #include <signal.h>
34c1e80940SXin LI #include <stdint.h>
35c1e80940SXin LI #include <stdlib.h>
36c1e80940SXin LI #include <string.h>
37c1e80940SXin LI #include <unistd.h>
38*d0b74459SKyle Evans #include <ssp/ssp.h>
39c1e80940SXin LI #include <sys/types.h>
40c1e80940SXin LI #include <sys/time.h>
415295209eSBrian Feldman 
425295209eSBrian Feldman #include "libc_private.h"
43d201fe46SDaniel Eischen #include "un-namespace.h"
4483a03b38SAndrey A. Chernov 
45243e0943SConrad Meyer #define CHACHA_EMBED
46c1e80940SXin LI #define KEYSTREAM_ONLY
47c2ca0667SAlex Richardson #if defined(__FreeBSD__)
48c2ca0667SAlex Richardson #define ARC4RANDOM_FXRNG 1
49c2ca0667SAlex Richardson #else
50c2ca0667SAlex Richardson #define ARC4RANDOM_FXRNG 0
51c2ca0667SAlex Richardson #endif
52c1e80940SXin LI #include "chacha.c"
53c1e80940SXin LI 
54c1e80940SXin LI #define minimum(a, b) ((a) < (b) ? (a) : (b))
55c1e80940SXin LI 
56c1e80940SXin LI #if defined(__GNUC__) || defined(_MSC_VER)
57c0b48470SDavid Schultz #define inline __inline
58c1e80940SXin LI #else				/* __GNUC__ || _MSC_VER */
59c0b48470SDavid Schultz #define inline
60c1e80940SXin LI #endif				/* !__GNUC__ && !_MSC_VER */
61c0b48470SDavid Schultz 
62c1e80940SXin LI #define KEYSZ	32
63c1e80940SXin LI #define IVSZ	8
64c1e80940SXin LI #define BLOCKSZ	64
65c1e80940SXin LI #define RSBUFSZ	(16*BLOCKSZ)
6683a03b38SAndrey A. Chernov 
67e9a2e4d1SXin LI #define REKEY_BASE	(1024*1024) /* NB. should be a power of 2 */
68e9a2e4d1SXin LI 
69c1e80940SXin LI /* Marked INHERIT_ZERO, so zero'd out in fork children. */
70c1e80940SXin LI static struct _rs {
71c1e80940SXin LI 	size_t		rs_have;	/* valid bytes at end of rs_buf */
72c1e80940SXin LI 	size_t		rs_count;	/* bytes till reseed */
73c1e80940SXin LI } *rs;
745295209eSBrian Feldman 
75c1e80940SXin LI /* Maybe be preserved in fork children, if _rs_allocate() decides. */
76c1e80940SXin LI static struct _rsx {
77c1e80940SXin LI 	chacha_ctx	rs_chacha;	/* chacha context for random keystream */
78c1e80940SXin LI 	u_char		rs_buf[RSBUFSZ];	/* keystream blocks */
79f8e8a06dSConrad Meyer #ifdef __FreeBSD__
80f8e8a06dSConrad Meyer 	uint32_t	rs_seed_generation;	/* 32-bit userspace RNG version */
81f8e8a06dSConrad Meyer #endif
82c1e80940SXin LI } *rsx;
835295209eSBrian Feldman 
84c1e80940SXin LI static inline int _rs_allocate(struct _rs **, struct _rsx **);
85c1e80940SXin LI static inline void _rs_forkdetect(void);
86c1e80940SXin LI #include "arc4random.h"
875295209eSBrian Feldman 
88c1e80940SXin LI static inline void _rs_rekey(u_char *dat, size_t datlen);
8960ce8b0eSDavid Schultz 
9083a03b38SAndrey A. Chernov static inline void
_rs_init(u_char * buf,size_t n)91c1e80940SXin LI _rs_init(u_char *buf, size_t n)
9283a03b38SAndrey A. Chernov {
93c1e80940SXin LI 	if (n < KEYSZ + IVSZ)
94c1e80940SXin LI 		return;
9583a03b38SAndrey A. Chernov 
96c1e80940SXin LI 	if (rs == NULL) {
97c1e80940SXin LI 		if (_rs_allocate(&rs, &rsx) == -1)
98d25a1430SXin LI 			_exit(1);
9949a6e1baSEd Maste 	}
10083a03b38SAndrey A. Chernov 
101c1e80940SXin LI 	chacha_keysetup(&rsx->rs_chacha, buf, KEYSZ * 8);
102c1e80940SXin LI 	chacha_ivsetup(&rsx->rs_chacha, buf + KEYSZ, NULL);
10383a03b38SAndrey A. Chernov }
10483a03b38SAndrey A. Chernov 
1057a0789b4SDavid Schultz static void
_rs_stir(void)106c1e80940SXin LI _rs_stir(void)
1077a0789b4SDavid Schultz {
108c1e80940SXin LI 	u_char rnd[KEYSZ + IVSZ];
109e9a2e4d1SXin LI 	uint32_t rekey_fuzz = 0;
1107a0789b4SDavid Schultz 
111f8e8a06dSConrad Meyer #if defined(__FreeBSD__)
112f8e8a06dSConrad Meyer 	bool need_init;
113f8e8a06dSConrad Meyer 
114f8e8a06dSConrad Meyer 	/*
115f8e8a06dSConrad Meyer 	 * De-couple allocation (which locates the vdso_fxrngp pointer in
116f8e8a06dSConrad Meyer 	 * auxinfo) from initialization.  This allows us to read the root seed
117f8e8a06dSConrad Meyer 	 * version before we fetch system entropy, maintaining the invariant
118f8e8a06dSConrad Meyer 	 * that the PRF was seeded with entropy from rs_seed_generation or a
119f8e8a06dSConrad Meyer 	 * later generation.  But never seeded from an earlier generation.
120f8e8a06dSConrad Meyer 	 * This invariant prevents us from missing a root reseed event.
121f8e8a06dSConrad Meyer 	 */
122f8e8a06dSConrad Meyer 	need_init = false;
123f8e8a06dSConrad Meyer 	if (rs == NULL) {
124f8e8a06dSConrad Meyer 		if (_rs_allocate(&rs, &rsx) == -1)
125f8e8a06dSConrad Meyer 			abort();
126f8e8a06dSConrad Meyer 		need_init = true;
127f8e8a06dSConrad Meyer 	}
128f8e8a06dSConrad Meyer 	/*
129f8e8a06dSConrad Meyer 	 * Transition period: new userspace on old kernel.  This should become
130f8e8a06dSConrad Meyer 	 * a hard error at some point, if the scheme is adopted.
131f8e8a06dSConrad Meyer 	 */
132f8e8a06dSConrad Meyer 	if (vdso_fxrngp != NULL)
133f8e8a06dSConrad Meyer 		rsx->rs_seed_generation =
134f8e8a06dSConrad Meyer 		    fxrng_load_acq_generation(&vdso_fxrngp->fx_generation32);
135f8e8a06dSConrad Meyer #endif
136f8e8a06dSConrad Meyer 
137c1e80940SXin LI 	if (getentropy(rnd, sizeof rnd) == -1)
138c1e80940SXin LI 		_getentropy_fail();
139c1e80940SXin LI 
140f8e8a06dSConrad Meyer #if !defined(__FreeBSD__)
141c1e80940SXin LI 	if (!rs)
142c1e80940SXin LI 		_rs_init(rnd, sizeof(rnd));
143f8e8a06dSConrad Meyer #else /* __FreeBSD__ */
144f8e8a06dSConrad Meyer 	assert(rs != NULL);
145f8e8a06dSConrad Meyer 	if (need_init)
146f8e8a06dSConrad Meyer 		_rs_init(rnd, sizeof(rnd));
147f8e8a06dSConrad Meyer #endif
148c1e80940SXin LI 	else
149c1e80940SXin LI 		_rs_rekey(rnd, sizeof(rnd));
150c1e80940SXin LI 	explicit_bzero(rnd, sizeof(rnd));	/* discard source seed */
151c1e80940SXin LI 
152c1e80940SXin LI 	/* invalidate rs_buf */
153c1e80940SXin LI 	rs->rs_have = 0;
154c1e80940SXin LI 	memset(rsx->rs_buf, 0, sizeof(rsx->rs_buf));
155c1e80940SXin LI 
156e9a2e4d1SXin LI 	/* rekey interval should not be predictable */
157e9a2e4d1SXin LI 	chacha_encrypt_bytes(&rsx->rs_chacha, (uint8_t *)&rekey_fuzz,
158e9a2e4d1SXin LI 	    (uint8_t *)&rekey_fuzz, sizeof(rekey_fuzz));
159e9a2e4d1SXin LI 	rs->rs_count = REKEY_BASE + (rekey_fuzz % REKEY_BASE);
1607a0789b4SDavid Schultz }
1617a0789b4SDavid Schultz 
162c1e80940SXin LI static inline void
_rs_stir_if_needed(size_t len)163c1e80940SXin LI _rs_stir_if_needed(size_t len)
16483a03b38SAndrey A. Chernov {
165c1e80940SXin LI 	_rs_forkdetect();
166c1e80940SXin LI 	if (!rs || rs->rs_count <= len)
167c1e80940SXin LI 		_rs_stir();
168c1e80940SXin LI 	if (rs->rs_count <= len)
169c1e80940SXin LI 		rs->rs_count = 0;
170c1e80940SXin LI 	else
171c1e80940SXin LI 		rs->rs_count -= len;
17283a03b38SAndrey A. Chernov }
17383a03b38SAndrey A. Chernov 
174c1e80940SXin LI static inline void
_rs_rekey(u_char * dat,size_t datlen)175c1e80940SXin LI _rs_rekey(u_char *dat, size_t datlen)
17683a03b38SAndrey A. Chernov {
177c1e80940SXin LI #ifndef KEYSTREAM_ONLY
178c1e80940SXin LI 	memset(rsx->rs_buf, 0, sizeof(rsx->rs_buf));
179c1e80940SXin LI #endif
180c1e80940SXin LI 	/* fill rs_buf with the keystream */
181c1e80940SXin LI 	chacha_encrypt_bytes(&rsx->rs_chacha, rsx->rs_buf,
182c1e80940SXin LI 	    rsx->rs_buf, sizeof(rsx->rs_buf));
183c1e80940SXin LI 	/* mix in optional user provided data */
184c1e80940SXin LI 	if (dat) {
185c1e80940SXin LI 		size_t i, m;
186c1e80940SXin LI 
187c1e80940SXin LI 		m = minimum(datlen, KEYSZ + IVSZ);
188c1e80940SXin LI 		for (i = 0; i < m; i++)
189c1e80940SXin LI 			rsx->rs_buf[i] ^= dat[i];
190c1e80940SXin LI 	}
191c1e80940SXin LI 	/* immediately reinit for backtracking resistance */
192c1e80940SXin LI 	_rs_init(rsx->rs_buf, KEYSZ + IVSZ);
193c1e80940SXin LI 	memset(rsx->rs_buf, 0, KEYSZ + IVSZ);
194c1e80940SXin LI 	rs->rs_have = sizeof(rsx->rs_buf) - KEYSZ - IVSZ;
19583a03b38SAndrey A. Chernov }
19683a03b38SAndrey A. Chernov 
197c1e80940SXin LI static inline void
_rs_random_buf(void * _buf,size_t n)198c1e80940SXin LI _rs_random_buf(void *_buf, size_t n)
199bc6847e2SAndrey A. Chernov {
200bc6847e2SAndrey A. Chernov 	u_char *buf = (u_char *)_buf;
201c1e80940SXin LI 	u_char *keystream;
202c1e80940SXin LI 	size_t m;
203c1e80940SXin LI 
204c1e80940SXin LI 	_rs_stir_if_needed(n);
205c1e80940SXin LI 	while (n > 0) {
206c1e80940SXin LI 		if (rs->rs_have > 0) {
207c1e80940SXin LI 			m = minimum(n, rs->rs_have);
208c1e80940SXin LI 			keystream = rsx->rs_buf + sizeof(rsx->rs_buf)
209c1e80940SXin LI 			    - rs->rs_have;
210c1e80940SXin LI 			memcpy(buf, keystream, m);
211c1e80940SXin LI 			memset(keystream, 0, m);
212c1e80940SXin LI 			buf += m;
213c1e80940SXin LI 			n -= m;
214c1e80940SXin LI 			rs->rs_have -= m;
215bc6847e2SAndrey A. Chernov 		}
216c1e80940SXin LI 		if (rs->rs_have == 0)
217c1e80940SXin LI 			_rs_rekey(NULL, 0);
218c1e80940SXin LI 	}
219c1e80940SXin LI }
220c1e80940SXin LI 
221c1e80940SXin LI static inline void
_rs_random_u32(uint32_t * val)222c1e80940SXin LI _rs_random_u32(uint32_t *val)
223c1e80940SXin LI {
224c1e80940SXin LI 	u_char *keystream;
225c1e80940SXin LI 
226c1e80940SXin LI 	_rs_stir_if_needed(sizeof(*val));
227c1e80940SXin LI 	if (rs->rs_have < sizeof(*val))
228c1e80940SXin LI 		_rs_rekey(NULL, 0);
229c1e80940SXin LI 	keystream = rsx->rs_buf + sizeof(rsx->rs_buf) - rs->rs_have;
230c1e80940SXin LI 	memcpy(val, keystream, sizeof(*val));
231c1e80940SXin LI 	memset(keystream, 0, sizeof(*val));
232c1e80940SXin LI 	rs->rs_have -= sizeof(*val);
233c1e80940SXin LI }
234c1e80940SXin LI 
235c1e80940SXin LI uint32_t
arc4random(void)236c1e80940SXin LI arc4random(void)
237c1e80940SXin LI {
238c1e80940SXin LI 	uint32_t val;
239c1e80940SXin LI 
240c1e80940SXin LI 	_ARC4_LOCK();
241c1e80940SXin LI 	_rs_random_u32(&val);
242c1e80940SXin LI 	_ARC4_UNLOCK();
243c1e80940SXin LI 	return val;
244c1e80940SXin LI }
245c1e80940SXin LI 
246c1e80940SXin LI void
__ssp_real(arc4random_buf)247*d0b74459SKyle Evans __ssp_real(arc4random_buf)(void *buf, size_t n)
248c1e80940SXin LI {
249c1e80940SXin LI 	_ARC4_LOCK();
250c1e80940SXin LI 	_rs_random_buf(buf, n);
251c0b48470SDavid Schultz 	_ARC4_UNLOCK();
252bc6847e2SAndrey A. Chernov }
253