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
use crate::types::{
AEADAlgorithm,
SymmetricAlgorithm,
};
use crate::packet;
use crate::Packet;
use crate::Error;
use crate::Result;
#[derive(Clone, Debug)]
pub struct AED1 {
pub(crate) common: packet::Common,
sym_algo: SymmetricAlgorithm,
aead: AEADAlgorithm,
chunk_size: usize,
iv: Box<[u8]>,
container: packet::Container,
}
impl PartialEq for AED1 {
fn eq(&self, other: &AED1) -> bool {
self.sym_algo == other.sym_algo
&& self.aead == other.aead
&& self.chunk_size == other.chunk_size
&& self.iv == other.iv
&& self.container == other.container
}
}
impl Eq for AED1 {}
impl std::hash::Hash for AED1 {
fn hash<H: std::hash::Hasher>(&self, state: &mut H) {
std::hash::Hash::hash(&self.sym_algo, state);
std::hash::Hash::hash(&self.aead, state);
std::hash::Hash::hash(&self.chunk_size, state);
std::hash::Hash::hash(&self.iv, state);
std::hash::Hash::hash(&self.container, state);
}
}
impl AED1 {
pub fn new(sym_algo: SymmetricAlgorithm,
aead: AEADAlgorithm,
chunk_size: usize,
iv: Box<[u8]>) -> Result<Self> {
if chunk_size.count_ones() != 1 {
return Err(Error::InvalidArgument(
format!("chunk size is not a power of two: {}", chunk_size))
.into());
}
if chunk_size < 64 {
return Err(Error::InvalidArgument(
format!("chunk size is too small: {}", chunk_size))
.into());
}
Ok(AED1 {
common: Default::default(),
sym_algo: sym_algo,
aead: aead,
chunk_size: chunk_size,
iv: iv,
container: Default::default(),
})
}
pub fn symmetric_algo(&self) -> SymmetricAlgorithm {
self.sym_algo
}
pub fn set_sym_algo(&mut self, sym_algo: SymmetricAlgorithm)
-> SymmetricAlgorithm {
::std::mem::replace(&mut self.sym_algo, sym_algo)
}
pub fn aead(&self) -> AEADAlgorithm {
self.aead
}
pub fn set_aead(&mut self, aead: AEADAlgorithm) -> AEADAlgorithm {
::std::mem::replace(&mut self.aead, aead)
}
pub fn chunk_size(&self) -> usize {
self.chunk_size
}
pub fn set_chunk_size(&mut self, chunk_size: usize) -> Result<()> {
if chunk_size.count_ones() != 1 {
return Err(Error::InvalidArgument(
format!("chunk size is not a power of two: {}", chunk_size))
.into());
}
if chunk_size < 64 {
return Err(Error::InvalidArgument(
format!("chunk size is too small: {}", chunk_size))
.into());
}
self.chunk_size = chunk_size;
Ok(())
}
pub fn chunk_digest_size(&self) -> Result<usize> {
Ok(self.chunk_size + self.aead.digest_size()?)
}
pub fn iv(&self) -> &[u8] {
&self.iv
}
pub fn set_iv(&mut self, iv: Box<[u8]>) -> Box<[u8]> {
::std::mem::replace(&mut self.iv, iv)
}
}
impl_container_forwards!(AED1);
impl From<AED1> for Packet {
fn from(p: AED1) -> Self {
super::AED::from(p).into()
}
}
impl From<AED1> for super::AED {
fn from(p: AED1) -> Self {
super::AED::V1(p)
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn deref() {
let mut s = AED1::new(SymmetricAlgorithm::AES128,
AEADAlgorithm::EAX,
64,
vec![].into_boxed_slice()).unwrap();
assert_eq!(s.body(), &[]);
s.set_body(vec![0, 1, 2]);
assert_eq!(s.body(), &[0, 1, 2]);
}
}