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
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
//! What a key may be used for.
use crate::error::{Error, ErrorCode, Located, Result};
use crate::extension::{self, Extension};
use structured_asn1::memory::{Memory, OwnedVec, Work};
use structured_asn1::{BitString, Element, Oid, Reader, ScopedReader, Tag, universal};
/// The purposes a key may be used for, as the bits the certificate set.
#[derive(Debug, Clone, Copy)]
pub struct KeyUsage<'a> {
bits: BitString<'a>,
}
impl<'a> KeyUsage<'a> {
/// Signing data.
#[must_use]
pub fn digital_signature(self) -> bool {
self.bits.bit(0)
}
/// Signing in a way the signer is not meant to be able to deny later,
/// which is the bit a signature under the Regulation rests on.
#[must_use]
pub fn content_commitment(self) -> bool {
self.bits.bit(1)
}
/// Enciphering a key.
#[must_use]
pub fn key_encipherment(self) -> bool {
self.bits.bit(2)
}
/// Enciphering data directly.
#[must_use]
pub fn data_encipherment(self) -> bool {
self.bits.bit(3)
}
/// Agreeing a key.
#[must_use]
pub fn key_agreement(self) -> bool {
self.bits.bit(4)
}
/// Signing certificates, which is what makes a certification authority
/// one.
#[must_use]
pub fn key_cert_sign(self) -> bool {
self.bits.bit(5)
}
/// Signing revocation lists.
#[must_use]
pub fn crl_sign(self) -> bool {
self.bits.bit(6)
}
/// Enciphering only, which means something only alongside key agreement.
#[must_use]
pub fn encipher_only(self) -> bool {
self.bits.bit(7)
}
/// Deciphering only, on the same terms.
#[must_use]
pub fn decipher_only(self) -> bool {
self.bits.bit(8)
}
/// The bits as they were written, for a report that has to say what a
/// certificate carries rather than what it means.
#[must_use]
pub fn bits(self) -> BitString<'a> {
self.bits
}
/// Reads the value of a key usage extension.
pub fn read<W: Work>(extension: &Extension<'a>, execution: &W) -> Result<Self> {
const FIELD: &str = "extensions.keyUsage";
let fail = |code| Error::new(code, FIELD, extension.span().start);
let mut reader = extension.reader_scoped(execution).field(FIELD)?;
let bits = reader.read_bit_string().field(FIELD)?;
if !reader.is_empty() {
return Err(fail(ErrorCode::TrailingData));
}
// The zero walk below touches every content byte, so it is charged
// to the shared work budget first: a caller bounding work must see
// an oversized string's scan on the same meter the reads use.
reader.charge(bits.as_bytes().len() as u64).field(FIELD)?;
// A key usage with no bit set forbids every use while claiming to
// permit one, and the schema asks for at least one. Written as a
// string of zero bits or as zero bytes, it says the same nothing.
if bits.as_bytes().iter().all(|byte| *byte == 0) {
return Err(fail(ErrorCode::MalformedValue));
}
// DER trims a named bit list to its last set bit, so trailing zero
// bits are a second spelling of a shorter value; and a set bit past
// decipherOnly is a bit this schema gives no name. BER carries no
// trimming rule, and past-the-end bits there read as unset.
if reader.encoding().is_der() {
let length = bits.len();
if !bits.bit(length - 1) {
return Err(fail(ErrorCode::MalformedValue));
}
if length > 9 {
return Err(fail(ErrorCode::MalformedValue));
}
}
let usage = Self { bits };
// The meaning of encipherOnly and decipherOnly is undefined in the
// absence of the keyAgreement bit (RFC 5280 4.2.1.3): a bit with no
// defined meaning cannot be read as permitting anything.
if (usage.encipher_only() || usage.decipher_only()) && !usage.key_agreement() {
return Err(fail(ErrorCode::MalformedValue));
}
Ok(usage)
}
}
/// Further purposes, named by identifier rather than by bit.
#[derive(Debug)]
pub struct ExtendedKeyUsage<'a> {
purposes: OwnedVec<Oid<'a>>,
at: u64,
}
impl<'a> ExtendedKeyUsage<'a> {
/// Reads an original EKU SEQUENCE using its producing reader and depth.
/// No certificate reconstruction or replacement parser is needed.
/// The returned catalogue retains its allocation charge; temporary lookup
/// storage is released before return. All decoding and storage work uses
/// the producing reader's local and aggregate execution bounds.
///
/// # Errors
/// Returns malformed or empty EKU syntax, inherited depth refusal, or a
/// located resource error before unfunded catalogue growth or copying.
pub fn read_value(parent: &ScopedReader<'a, '_>, value: &Element<'a>) -> Result<Self> {
const FIELD: &str = "extensions.extKeyUsage";
let fail = |code| Error::new(code, FIELD, value.span().start);
if value.tag() != Tag::constructed(universal::SEQUENCE) {
return Err(fail(ErrorCode::Encoding(
structured_asn1::ErrorCode::UnexpectedTag,
)));
}
Self::read_members(
parent.enter(value).field(FIELD)?,
parent.memory(),
value.span().start,
)
}
fn read_members(mut inside: ScopedReader<'a, '_>, execution: &Memory, at: u64) -> Result<Self> {
const FIELD: &str = "extensions.extKeyUsage";
let work = inside.execution_in(execution);
let mut purposes = work.vector();
let mut seen = work.map::<Oid<'a>, ()>();
// RFC5280 ยง4.2.1.12 gives a nonempty sequence of purpose OIDs, without
// a uniqueness constraint. Repeated purposes add no new capability;
// retain their first-occurrence order through this shared decoder.
// https://www.rfc-editor.org/rfc/rfc5280#section-4.2.1.12
while !inside.is_empty() {
let purpose = inside.read_oid().field(FIELD)?;
if seen
.try_insert(purpose, ())
.map_err(|reason| Error::resource(reason, FIELD, inside.offset()))?
.is_none()
{
purposes
.try_push(purpose)
.map_err(|reason| Error::resource(reason, FIELD, inside.offset()))?;
}
}
if purposes.is_empty() {
return Err(Error::new(ErrorCode::EmptySequence, FIELD, at));
}
Ok(Self {
purposes: purposes.into_owned(),
at,
})
}
/// The purposes, in the order the certificate holds them.
#[must_use]
pub fn purposes(&self) -> &[Oid<'a>] {
&self.purposes
}
/// Whether one purpose is among them.
///
/// The identifier that stands for any purpose is not treated as matching
/// everything here: whether it does is a policy question, and answering it
/// in the parser would hide the difference between a certificate that
/// names a purpose and one that names none.
pub fn has<W: Work>(&self, purpose: Oid<'_>, execution: &W) -> Result<bool> {
for candidate in &self.purposes {
let work = 1 + candidate.as_bytes().len().max(purpose.as_bytes().len()) as u64;
execution
.charge_work(work)
.map_err(|reason| Error::resource(reason, "extensions.extKeyUsage", self.at))?;
if *candidate == purpose {
return Ok(true);
}
}
Ok(false)
}
/// Reads the value of an extended key usage extension.
pub fn read<W: Work>(extension: &Extension<'a>, execution: &W) -> Result<Self> {
Self::read_members(
extension::sequence(extension, "extensions.extKeyUsage", execution)?,
execution.memory(),
extension.span().start,
)
}
/// Decodes the original value with current query and origin admission.
pub fn read_in<'work>(
extension: &Extension<'a>,
query: &Reader<'work>,
) -> Result<ExtendedKeyUsage<'work>>
where
'a: 'work,
{
let reader = extension.reader_in(query).field("extensions.extKeyUsage")?;
let inside =
extension::sequence_reader(reader, "extensions.extKeyUsage", extension.span().start)?;
ExtendedKeyUsage::read_members(inside, query.memory(), extension.span().start)
}
}
#[cfg(test)]
mod tests;