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
use crate::digest::Digest;
use crate::hashing::blake2b;
use crate::mac::{Mac, MacResult};
use alloc::vec::Vec;
use core::iter::repeat;
pub type Context = blake2b::ContextDyn;
#[derive(Clone)]
pub struct Blake2b {
ctx: blake2b::ContextDyn,
computed: bool, }
impl Blake2b {
pub fn new(outlen: usize) -> Self {
let ctx = blake2b::ContextDyn::new(outlen);
Self {
ctx,
computed: false,
}
}
pub fn new_keyed(outlen: usize, key: &[u8]) -> Self {
assert!(key.len() <= 64);
let ctx = blake2b::ContextDyn::new_keyed(outlen, key);
Self {
ctx,
computed: false,
}
}
fn update(&mut self, input: &[u8]) {
assert!(!self.computed, "context is already finalized, needs reset");
self.ctx.update_mut(input);
}
fn finalize(&mut self, slice: &mut [u8]) {
assert!(!self.computed, "context is already finalized, needs reset");
self.ctx.finalize_reset_at(slice);
self.computed = true;
}
pub fn reset(&mut self) {
self.ctx.reset();
self.computed = false;
}
pub fn reset_with_key(&mut self, key: &[u8]) {
self.ctx.reset_with_key(key);
self.computed = false;
}
pub fn blake2b(out: &mut [u8], input: &[u8], key: &[u8]) {
let mut hasher: Blake2b = if !key.is_empty() {
Blake2b::new_keyed(out.len(), key)
} else {
Blake2b::new(out.len())
};
hasher.update(input);
hasher.finalize(out);
}
}
impl Digest for Blake2b {
fn input(&mut self, msg: &[u8]) {
self.update(msg);
}
fn reset(&mut self) {
Blake2b::reset(self);
}
fn result(&mut self, out: &mut [u8]) {
self.finalize(out);
}
fn output_bits(&self) -> usize {
self.ctx.output_bits()
}
fn block_size(&self) -> usize {
blake2b::Blake2b::<0>::BLOCK_BYTES
}
}
impl Mac for Blake2b {
fn input(&mut self, data: &[u8]) {
self.update(data);
}
fn reset(&mut self) {
Blake2b::reset(self);
}
fn result(&mut self) -> MacResult {
let mut mac: Vec<u8> = repeat(0).take(self.ctx.output_bits() / 8).collect();
self.raw_result(&mut mac);
MacResult::new_from_owned(mac)
}
fn raw_result(&mut self, output: &mut [u8]) {
self.finalize(output);
}
fn output_bytes(&self) -> usize {
self.ctx.output_bits() / 8
}
}
#[cfg(test)]
mod mac_tests {
use super::Blake2b;
use crate::mac::Mac;
#[test]
fn test_reset_with_key_same_as_new_keyed_if_empty() {
const KEY: &[u8] = &[];
const INPUT: &[u8] = &[];
let mut m = Blake2b::new_keyed(32, &KEY);
m.input(&INPUT);
let mac1 = m.result();
m.reset_with_key(&KEY);
m.input(&INPUT);
let mac2 = m.result();
assert_eq!(mac1.code(), mac2.code());
}
#[test]
fn test_blake2b_mac() {
let key: [u8; 64] = [
0, 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,
];
let mut m = Blake2b::new_keyed(64, &key[..]);
m.input(&[1, 2, 4, 8]);
let expected = [
0x8e, 0xc6, 0xcb, 0x71, 0xc4, 0x5c, 0x3c, 0x90, 0x91, 0xd0, 0x8a, 0x37, 0x1e, 0xa8,
0x5d, 0xc1, 0x22, 0xb5, 0xc8, 0xe2, 0xd9, 0xe5, 0x71, 0x42, 0xbf, 0xef, 0xce, 0x42,
0xd7, 0xbc, 0xf8, 0x8b, 0xb0, 0x31, 0x27, 0x88, 0x2e, 0x51, 0xa9, 0x21, 0x44, 0x62,
0x08, 0xf6, 0xa3, 0x58, 0xa9, 0xe0, 0x7d, 0x35, 0x3b, 0xd3, 0x1c, 0x41, 0x70, 0x15,
0x62, 0xac, 0xd5, 0x39, 0x4e, 0xee, 0x73, 0xae,
];
assert_eq!(m.result().code().to_vec(), expected.to_vec());
}
}