2 * Copyright (c) 2007 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the name of the Institute nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 #include <sys/types.h>
53 static const char *egd_path = "/var/run/egd-pool";
55 #define MAX_EGD_DATA 255
58 connect_egd(const char *path)
60 struct sockaddr_un addr;
63 memset(&addr, 0, sizeof(addr));
65 if (strlen(path) > sizeof(addr.sun_path))
68 addr.sun_family = AF_UNIX;
69 strlcpy(addr.sun_path, path, sizeof(addr.sun_path));
71 fd = socket(AF_UNIX, SOCK_STREAM, 0);
77 if (connect(fd, (struct sockaddr *)&addr, sizeof(addr)) != 0) {
86 get_entropy(int fd, void *data, size_t len)
90 assert(len <= MAX_EGD_DATA);
92 msg[0] = 0x02; /* read blocking data */
93 msg[1] = len; /* wanted length */
95 if (net_write(fd, msg, sizeof(msg)) != sizeof(msg))
98 if (net_read(fd, data, len) != len)
105 put_entropy(int fd, const void *data, size_t len)
107 unsigned char msg[4];
109 assert (len <= MAX_EGD_DATA);
111 msg[0] = 0x03; /* write data */
112 msg[1] = 0; /* dummy */
113 msg[2] = 0; /* entropy */
114 msg[3] = len; /* length */
116 if (net_write(fd, msg, sizeof(msg)) != sizeof(msg))
118 if (net_write(fd, data, len) != len)
129 egd_seed(const void *indata, int size)
134 fd = connect_egd(egd_path);
140 if (len > MAX_EGD_DATA)
142 ret = put_entropy(fd, indata, len);
145 indata = ((unsigned char *)indata) + len;
152 get_bytes(const char *path, unsigned char *outdata, int size)
160 fd = connect_egd(path);
166 if (len > MAX_EGD_DATA)
168 ret = get_entropy(fd, outdata, len);
180 egd_bytes(unsigned char *outdata, int size)
182 return get_bytes(NULL, outdata, size);
191 egd_add(const void *indata, int size, double entropi)
193 egd_seed(indata, size);
197 egd_pseudorand(unsigned char *outdata, int size)
199 return get_bytes(NULL, outdata, size);
206 fd = connect_egd(egd_path);
213 const RAND_METHOD hc_rand_egd_method = {
223 RAND_egd_method(void)
225 return &hc_rand_egd_method;
230 RAND_egd(const char *filename)
232 return RAND_egd_bytes(filename, 128);
236 RAND_egd_bytes(const char *filename, int size)
248 ret = get_bytes(filename, data, size);
254 RAND_seed(data, size);
256 memset(data, 0, size);