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
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
|
// -*- coding: utf-8 -*-
//
// disktest - Hard drive tester
//
// Copyright 2020-2022 Michael Buesch <m@bues.ch>
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with this program; if not, write to the Free Software Foundation, Inc.,
// 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
//
use anyhow as ah;
use crate::generator::NextRandom;
use crate::util::fold;
use rand::prelude::*;
macro_rules! GeneratorChaCha {
( $Generator:ident,
$ChaChaRng:ident,
$testmodule:ident,
$testresult0:literal,
$testresult1:literal,
$testresult2:literal,
$testresult3:literal
) => {
use rand_chacha::$ChaChaRng;
pub struct $Generator {
rng: $ChaChaRng,
}
impl $Generator {
/// Size of the algorithm base output data.
pub const BASE_SIZE: usize = 1024 * 1024 * 3;
/// Chunk size. Multiple of the generator base size.
pub const CHUNK_FACTOR: usize = 1;
pub fn new(seed: &[u8]) -> $Generator {
assert!(!seed.is_empty());
let mut folded_seed = [0u8; 32];
folded_seed.copy_from_slice(&fold(seed, 32));
let rng = $ChaChaRng::from_seed(folded_seed);
$Generator {
rng,
}
}
}
impl NextRandom for $Generator {
fn get_base_size(&self) -> usize {
$Generator::BASE_SIZE
}
fn next(&mut self, buf: &mut [u8], count: usize) {
debug_assert!(buf.len() == $Generator::BASE_SIZE * count);
self.rng.fill(buf);
}
fn seek(&mut self, byte_offset: u64) -> ah::Result<()> {
if byte_offset % $Generator::BASE_SIZE as u64 != 0 {
return Err(ah::format_err!("ChaCha seek: Byte offset is not a \
multiple of the base size ({} bytes).",
$Generator::BASE_SIZE));
}
if byte_offset % 4 != 0 {
return Err(ah::format_err!("ChaCha seek: Byte offset is not a \
multiple of the word size (4 bytes)."));
}
let word_offset = byte_offset / 4;
self.rng.set_word_pos(word_offset as u128);
Ok(())
}
}
#[cfg(test)]
mod $testmodule {
use super::*;
#[test]
fn test_cmp_result() {
let mut a = $Generator::new(&vec![1,2,3]);
fn reduce(acc: u32, (i, x): (usize, &u8)) -> u32 {
acc.rotate_left(i as u32) ^ (*x as u32)
}
let mut buf = vec![0u8; $Generator::BASE_SIZE * 3];
a.next(&mut buf[0..$Generator::BASE_SIZE], 1);
assert_eq!(buf.iter().enumerate().fold(0, reduce), $testresult0);
a.next(&mut buf[0..$Generator::BASE_SIZE], 1);
assert_eq!(buf.iter().enumerate().fold(0, reduce), $testresult1);
a.next(&mut buf[0..$Generator::BASE_SIZE*2], 2);
assert_eq!(buf.iter().enumerate().fold(0, reduce), $testresult2);
a.next(&mut buf[0..$Generator::BASE_SIZE*3], 3);
assert_eq!(buf.iter().enumerate().fold(0, reduce), $testresult3);
}
#[test]
fn test_seed_equal() {
let mut a = $Generator::new(&vec![1,2,3]);
let mut b = $Generator::new(&vec![1,2,3]);
let mut res_a: Vec<Vec<u8>> = vec![];
let mut res_b: Vec<Vec<u8>> = vec![];
for _ in 0..2 {
let mut buf = vec![0u8; $Generator::BASE_SIZE];
a.next(&mut buf, 1);
res_a.push(buf);
let mut buf = vec![0u8; $Generator::BASE_SIZE];
b.next(&mut buf, 1);
res_b.push(buf);
}
assert_eq!(res_a[0], res_b[0]);
assert_eq!(res_a[1], res_b[1]);
assert_ne!(res_a[0], res_a[1]);
assert_ne!(res_b[0], res_b[1]);
}
#[test]
fn test_seed_diff() {
let mut a = $Generator::new(&vec![1,2,3]);
let mut b = $Generator::new(&vec![1,2,4]);
let mut res_a: Vec<Vec<u8>> = vec![];
let mut res_b: Vec<Vec<u8>> = vec![];
for _ in 0..2 {
let mut buf = vec![0u8; $Generator::BASE_SIZE];
a.next(&mut buf, 1);
res_a.push(buf);
let mut buf = vec![0u8; $Generator::BASE_SIZE];
b.next(&mut buf, 1);
res_b.push(buf);
}
assert_ne!(res_a[0], res_b[0]);
assert_ne!(res_a[1], res_b[1]);
assert_ne!(res_a[0], res_a[1]);
assert_ne!(res_b[0], res_b[1]);
}
#[test]
fn test_concat_equal() {
let mut a = $Generator::new(&vec![1,2,3]);
let mut b = $Generator::new(&vec![1,2,3]);
let mut buf_a = vec![0u8; $Generator::BASE_SIZE * 2];
a.next(&mut buf_a[0..$Generator::BASE_SIZE], 1);
a.next(&mut buf_a[$Generator::BASE_SIZE..$Generator::BASE_SIZE*2], 1);
let mut buf_b = vec![0u8; $Generator::BASE_SIZE * 2];
b.next(&mut buf_b, 2);
assert_eq!(buf_a, buf_b);
}
#[test]
fn test_seek() {
let mut a = $Generator::new(&vec![1,2,3]);
let mut b = $Generator::new(&vec![1,2,3]);
b.seek($Generator::BASE_SIZE as u64 * 2).unwrap();
let mut bdata = vec![0u8; $Generator::BASE_SIZE];
b.next(&mut bdata, 1);
let mut adata = vec![0u8; $Generator::BASE_SIZE];
a.next(&mut adata, 1);
assert_ne!(adata, bdata);
a.next(&mut adata, 1);
assert_ne!(adata, bdata);
a.next(&mut adata, 1);
assert_eq!(adata, bdata);
a.next(&mut adata, 1);
assert_ne!(adata, bdata);
}
}
};
}
GeneratorChaCha!(GeneratorChaCha20,
ChaCha20Rng,
tests_chacha20,
331195744,
1401252284,
1567136089,
3153433807);
GeneratorChaCha!(GeneratorChaCha12,
ChaCha12Rng,
tests_chacha12,
477482776,
774733417,
473700519,
3620480628);
GeneratorChaCha!(GeneratorChaCha8,
ChaCha8Rng,
tests_chacha8,
3691419247,
1996469034,
1245532037,
1660157839);
// vim: ts=4 sw=4 expandtab
|
