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
40
#include <sys/types.h>
57
static const char *egd_path = "/var/run/egd-pool";
59
#define MAX_EGD_DATA 255
62
connect_egd(const char *path)
64
struct sockaddr_un addr;
67
memset(&addr, 0, sizeof(addr));
69
if (strlen(path) > sizeof(addr.sun_path))
72
addr.sun_family = AF_UNIX;
73
strlcpy(addr.sun_path, path, sizeof(addr.sun_path));
75
fd = socket(AF_UNIX, SOCK_STREAM, 0);
81
if (connect(fd, (struct sockaddr *)&addr, sizeof(addr)) != 0) {
90
get_entropy(int fd, void *data, size_t len)
94
assert(len <= MAX_EGD_DATA);
96
msg[0] = 0x02; /* read blocking data */
97
msg[1] = len; /* wanted length */
99
if (net_write(fd, msg, sizeof(msg)) != sizeof(msg))
102
if (net_read(fd, data, len) != len)
109
put_entropy(int fd, const void *data, size_t len)
111
unsigned char msg[4];
113
assert (len <= MAX_EGD_DATA);
115
msg[0] = 0x03; /* write data */
116
msg[1] = 0; /* dummy */
117
msg[2] = 0; /* entropy */
118
msg[3] = len; /* length */
120
if (net_write(fd, msg, sizeof(msg)) != sizeof(msg))
122
if (net_write(fd, data, len) != len)
133
egd_seed(const void *indata, int size)
138
fd = connect_egd(egd_path);
144
if (len > MAX_EGD_DATA)
146
ret = put_entropy(fd, indata, len);
149
indata = ((unsigned char *)indata) + len;
156
get_bytes(const char *path, unsigned char *outdata, int size)
164
fd = connect_egd(path);
170
if (len > MAX_EGD_DATA)
172
ret = get_entropy(fd, outdata, len);
184
egd_bytes(unsigned char *outdata, int size)
186
return get_bytes(NULL, outdata, size);
195
egd_add(const void *indata, int size, double entropi)
197
egd_seed(indata, size);
201
egd_pseudorand(unsigned char *outdata, int size)
203
return get_bytes(NULL, outdata, size);
210
fd = connect_egd(egd_path);
217
const RAND_METHOD hc_rand_egd_method = {
227
RAND_egd_method(void)
229
return &hc_rand_egd_method;
234
RAND_egd(const char *filename)
236
return RAND_egd_bytes(filename, 128);
240
RAND_egd_bytes(const char *filename, int size)
252
ret = get_bytes(filename, data, size);
258
RAND_seed(data, size);
260
memset(data, 0, size);