]> git.saurik.com Git - apple/libc.git/blob - gen/FreeBSD/arc4random.3
Libc-1439.100.3.tar.gz
[apple/libc.git] / gen / FreeBSD / arc4random.3
1 .\" $OpenBSD: arc4random.3,v 1.34 2014/07/19 16:11:16 naddy Exp $
2 .\"
3 .\" Copyright 1997 Niels Provos <provos@physnet.uni-hamburg.de>
4 .\" All rights reserved.
5 .\"
6 .\" Redistribution and use in source and binary forms, with or without
7 .\" modification, are permitted provided that the following conditions
8 .\" are met:
9 .\" 1. Redistributions of source code must retain the above copyright
10 .\" notice, this list of conditions and the following disclaimer.
11 .\" 2. Redistributions in binary form must reproduce the above copyright
12 .\" notice, this list of conditions and the following disclaimer in the
13 .\" documentation and/or other materials provided with the distribution.
14 .\" 3. All advertising materials mentioning features or use of this software
15 .\" must display the following acknowledgement:
16 .\" This product includes software developed by Niels Provos.
17 .\" 4. The name of the author may not be used to endorse or promote products
18 .\" derived from this software without specific prior written permission.
19 .\"
20 .\" THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
21 .\" IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
22 .\" OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
23 .\" IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
24 .\" INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
25 .\" NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26 .\" DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27 .\" THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28 .\" (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
29 .\" THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 .\"
31 .\" Manual page, using -mandoc macros
32 .\"
33 .Dd July 30, 2015
34 .Dt ARC4RANDOM 3
35 .Os
36 .Sh NAME
37 .Nm arc4random ,
38 .Nm arc4random_buf ,
39 .Nm arc4random_uniform
40 .Nd random number generator
41 .Sh SYNOPSIS
42 .In stdlib.h
43 .Ft uint32_t
44 .Fn arc4random "void"
45 .Ft void
46 .Fn arc4random_buf "void *buf" "size_t nbytes"
47 .Ft uint32_t
48 .Fn arc4random_uniform "uint32_t upper_bound"
49 .Sh DESCRIPTION
50 .Pp
51 These functions use a cryptographic pseudo-random number generator to generate
52 high quality random bytes very quickly. One data pool is used for all
53 consumers in a process, so that consumption under program flow can act as
54 additional stirring. The subsystem is re-seeded from the kernel random number
55 subsystem on a regular basis, and also upon
56 .Xr fork 2 .
57 .Pp
58 This family of functions provides higher quality random data than those
59 described in
60 .Xr rand 3 ,
61 .Xr random 3 ,
62 and
63 .Xr rand48 3 .
64 They can be called in almost all environments, including
65 .Xr chroot 2 ,
66 and their use is encouraged over all other standard library functions for
67 random numbers.
68 .Pp
69 .Fn arc4random
70 returns a single 32-bit value.
71 .Pp
72 .Fn arc4random_buf
73 fills the region
74 .Fa buf
75 of length
76 .Fa nbytes
77 with random data.
78 .Pp
79 .Fn arc4random_uniform
80 will return a single 32-bit value, uniformly distributed but less than
81 .Fa upper_bound .
82 This is recommended over constructions like
83 .Dq Li arc4random() % upper_bound
84 as it avoids "modulo bias" when the upper bound is not a power of two.
85 In the worst case, this function may require multiple iterations
86 to ensure uniformity.
87 .Sh RETURN VALUES
88 These functions are always successful, and no return value is
89 reserved to indicate an error.
90 .Sh SEE ALSO
91 .Xr rand 3 ,
92 .Xr rand48 3 ,
93 .Xr random 3 ,
94 .Xr random 4
95 .Sh HISTORY
96 The original version of this random number generator used the RC4 (also known
97 as ARC4) algorithm. In OS X 10.12 it was replaced with the NIST-approved AES
98 cipher, and it may be replaced again in the future as cryptographic techniques
99 advance. A good mnemonic is
100 .Dq A Replacement Call for Random .