1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
|
// FIXME: This is mostlikely incredibly inefficent and insecure.
#include <assert.h>
#include <crypto/ChaCha20/chacha20.h>
#include <crypto/SHA1/sha1.h>
#include <crypto/xoshiro256plusplus/xoshiro256plusplus.h>
#include <fcntl.h>
#include <fs/devfs.h>
#include <fs/vfs.h>
#include <random.h>
#include <stddef.h>
#include <string.h>
#define HASH_CTX SHA1_CTX
#define HASH_LEN SHA1_LEN
u32 internal_chacha_block[16] = {
// Constant ascii values of "expand 32-byte k"
0x61707865,
0x3320646e,
0x79622d32,
0x6b206574,
// The unique key
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
0x00000000,
// Block counter
0x00000000,
// Nonce
0x00000000,
0x00000000,
};
void mix_chacha(void) {
u8 rand_data[BLOCK_SIZE];
get_random((BYTEPTR)rand_data, BLOCK_SIZE);
memcpy(internal_chacha_block + KEY, rand_data, KEY_SIZE);
memcpy(internal_chacha_block + NONCE, rand_data + KEY_SIZE, NONCE_SIZE);
internal_chacha_block[COUNT] = 0;
}
void get_fast_insecure_random(u8 *buffer, u64 len) {
static u8 is_fast_random_seeded = 0;
if (!is_fast_random_seeded) {
uint64_t seed[4];
get_random((u8 *)&seed, sizeof(seed));
seed_xoshiro_256_pp(seed);
is_fast_random_seeded = 1;
}
for (; len >= 8; len -= 8, buffer += 8) {
*((uint64_t *)buffer) = xoshiro_256_pp();
}
for (; len > 0; len--, buffer++) {
*((uint8_t *)buffer) = xoshiro_256_pp() & 0xFF;
}
}
void get_random(u8 *buffer, u64 len) {
u8 rand_data[BLOCK_SIZE];
for (; len > 0;) {
if (COUNT_MAX - 1 == internal_chacha_block[COUNT]) {
// The current block has used up all the 2^32 counts. If the
// key and/or the nonce are not changed and the count
// overflows back to zero then the random values would
// repeate. This is of course not desiered behaviour. The
// solution is to create a new nonce and key using the
// already established chacha block.
internal_chacha_block[COUNT]++;
mix_chacha();
}
u32 read_len = (BLOCK_SIZE < len) ? (BLOCK_SIZE) : len;
chacha_block((u32 *)rand_data, internal_chacha_block);
internal_chacha_block[COUNT]++;
memcpy(buffer, rand_data, read_len);
buffer += read_len;
len -= read_len;
}
}
HASH_CTX hash_pool;
u32 hash_pool_size = 0;
void add_hash_pool(void) {
u8 new_chacha_key[KEY_SIZE];
get_random(new_chacha_key, KEY_SIZE);
u8 hash_buffer[HASH_LEN];
SHA1_Final(&hash_pool, hash_buffer);
for (size_t i = 0; i < HASH_LEN; i++) {
new_chacha_key[i % KEY_SIZE] ^= hash_buffer[i];
}
SHA1_Init(&hash_pool);
SHA1_Update(&hash_pool, hash_buffer, HASH_LEN);
u8 block[BLOCK_SIZE];
get_random(block, BLOCK_SIZE);
SHA1_Update(&hash_pool, block, BLOCK_SIZE);
memcpy(internal_chacha_block + KEY, new_chacha_key, KEY_SIZE);
mix_chacha();
u64 seed[4];
get_random((u8 *)seed, sizeof(seed));
seed_xoshiro_256_pp(seed);
}
u64 entropy_fast_state = 0;
static inline uint64_t xorshift64(void) {
uint64_t x = entropy_fast_state;
x ^= x << 13;
x ^= x >> 7;
x ^= x << 17;
return entropy_fast_state = x;
}
void random_add_entropy(u8 *buffer, u64 size) {
SHA1_Update(&hash_pool, &entropy_fast_state, sizeof(entropy_fast_state));
xorshift64();
SHA1_Update(&hash_pool, buffer, size);
hash_pool_size += size;
if (hash_pool_size >= HASH_LEN * 2) {
add_hash_pool();
}
}
void random_add_entropy_fast(u8 *buffer, u64 size) {
for (u64 i = 0; i < size; i++) {
entropy_fast_state ^= ((u64)buffer[i] << (8 * (i % 8)));
if (0 == i % 8) {
xorshift64();
}
}
xorshift64();
}
void setup_random(void) {
SHA1_Init(&hash_pool);
return;
}
int random_write(BYTEPTR buffer, u64 offset, u64 len, vfs_fd_t *fd) {
(void)offset;
(void)fd;
random_add_entropy(buffer, len);
return len; // random_add_entropy() never fails to recieve (len) amount of
// data.
}
int random_read(BYTEPTR buffer, u64 offset, u64 len, vfs_fd_t *fd) {
(void)offset;
(void)fd;
get_random(buffer, len);
return len; // get_random() never fails to give "len" amount of data.
}
void add_random_devices(void) {
devfs_add_file("/random", random_read, random_write, NULL, always_has_data,
always_can_write, FS_TYPE_CHAR_DEVICE);
devfs_add_file("/urandom", random_read, random_write, NULL, always_has_data,
always_can_write, FS_TYPE_CHAR_DEVICE);
BYTE seed[1024];
int rand_fd = vfs_open("/etc/seed", O_RDWR, 0);
if (0 > rand_fd) {
klog(LOG_WARN, "/etc/seed not found");
add_hash_pool();
return;
}
size_t offset = 0;
for (int rc; (rc = vfs_pread(rand_fd, seed, 1024, offset)); offset += rc) {
if (0 > rc) {
klog(LOG_WARN, "/etc/seed read error");
break;
}
random_add_entropy(seed, rc);
}
add_hash_pool();
// Update the /etc/seed file to ensure we get a new state upon next
// boot.
get_random(seed, 1024);
vfs_pwrite(rand_fd, seed, 1024, 0);
vfs_close(rand_fd);
}
|
