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 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315
// MIT License
//
// Copyright (c) 2022-2024 Robin Doer
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to
// deal in the Software without restriction, including without limitation the
// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
// sell copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
// IN THE SOFTWARE.
#[cfg(test)]
mod tests;
use nuts_bytes::{FromBytes, ToBytes};
use openssl::error::ErrorStack;
use openssl::pkcs5::pbkdf2_hmac;
use std::fmt;
use std::num::ParseIntError;
use std::str::FromStr;
use thiserror::Error;
use crate::digest::Digest;
use crate::ossl;
use crate::svec::SecureVec;
/// [`Kdf`] related error codes.
#[derive(Debug, Error)]
pub enum KdfError {
/// An error in the OpenSSL library occured.
#[error(transparent)]
OpenSSL(#[from] ErrorStack),
}
/// Supported key derivation functions.
///
/// Defines data used to calculate a wrapping key.
///
/// The wrapping key is created used by an algorithm defined as a variant of
/// this enum. The variants holds fields to customize the algorithm.
///
/// Based on a password provided by the user one of the algorithms are used to
/// calculate a wrapping key. The wrapping key then is used for encryption of
/// the secret in the header of the container.
#[derive(Clone, FromBytes, PartialEq, ToBytes)]
pub enum Kdf {
/// No key derivation
None,
/// PBKDF2
Pbkdf2 {
/// Digest used by PBKDF2.
digest: Digest,
/// Number of iterations used by PBKDF2.
iterations: u32,
/// A salt value used by PBKDF2.
salt: Vec<u8>,
},
}
impl Kdf {
/// Creates a `Kdf` instance for the PBKDF2 algorithm.
///
/// The `digest`, `iterations` and the `salt` values are used to customize
/// the PBKDF2 algorithm.
///
/// # Examples
///
/// ```rust
/// use nuts_container::*;
///
/// let pbkdf2 = Kdf::pbkdf2(Digest::Sha1, 5, &[1, 2, 3]);
///
/// match pbkdf2 {
/// Kdf::Pbkdf2 {
/// digest,
/// iterations,
/// salt,
/// } => {
/// assert_eq!(digest, Digest::Sha1);
/// assert_eq!(iterations, 5);
/// assert_eq!(salt, [1, 2, 3]);
/// }
/// _ => panic!("invalid kdf"),
/// }
/// ```
pub fn pbkdf2(digest: Digest, iterations: u32, salt: &[u8]) -> Kdf {
Kdf::Pbkdf2 {
digest,
iterations,
salt: salt.to_vec(),
}
}
/// Generates a `Kdf` instance for the PBKDF2 algorithm.
///
/// The `digest`and `iterations` value is used to customize the PBKDF2
/// algorithm. For the [`salt`] `salt_len` bytes of random data are
/// generated.
///
/// # Errors
///
/// This method will return an [`Error::OpenSSL`] error if there was an
/// error generating the random data.
///
/// # Examples
///
/// ```rust
/// use nuts_container::*;
///
/// let kdf = Kdf::generate_pbkdf2(Digest::Sha1, 5, 3).unwrap();
///
/// match kdf {
/// Kdf::Pbkdf2 {
/// digest,
/// iterations,
/// salt,
/// } => {
/// assert_eq!(digest, Digest::Sha1);
/// assert_eq!(iterations, 5);
/// assert_eq!(salt.len(), 3); // salt filled with random data
/// }
/// _ => panic!("invalid kdf"),
/// }
/// ```
///
/// [`salt`]: #variant.Pbkdf2.field.salt
/// [`Error::OpenSSL`]: ../error/enum.Error.html#variant.OpenSSL
pub fn generate_pbkdf2(
digest: Digest,
iterations: u32,
salt_len: u32,
) -> Result<Kdf, KdfError> {
let mut salt = vec![0; salt_len as usize];
ossl::rand_bytes(&mut salt)?;
Ok(Kdf::Pbkdf2 {
digest,
iterations,
salt,
})
}
pub(crate) fn create_key(&self, password: &[u8]) -> Result<SecureVec, KdfError> {
match self {
Kdf::None => Ok(vec![].into()),
Kdf::Pbkdf2 {
digest,
iterations,
salt,
} => {
if password.is_empty() {
panic!("invalid password, cannot be empty");
}
if salt.is_empty() {
panic!("invalid salt, cannot be empty");
}
let md = digest.to_openssl();
let mut key = vec![0; digest.size()];
pbkdf2_hmac(password, salt, *iterations as usize, md, &mut key)?;
Ok(key.into())
}
}
}
}
impl fmt::Display for Kdf {
fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {
match self {
Kdf::None => fmt.write_str("none"),
Kdf::Pbkdf2 {
digest,
iterations,
salt,
} => {
write!(fmt, "pbkdf2:{}:{}:{}", digest, iterations, salt.len())
}
}
}
}
impl fmt::Debug for Kdf {
fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {
match self {
Kdf::None => fmt.debug_struct("None").finish(),
Kdf::Pbkdf2 {
digest,
iterations,
salt,
} => {
let salt = format!("<{} bytes>", salt.len());
fmt.debug_struct("Pbkdf2")
.field("digest", &digest)
.field("iterations", &iterations)
.field("salt", &salt)
.finish()
}
}
}
}
fn parse_none(v: &[&str]) -> Result<Kdf, ParseKdfNoneError> {
if v.is_empty() {
Ok(Kdf::None)
} else {
Err(ParseKdfNoneError::InvalidNumberOfArguments(v.len()))
}
}
fn parse_pbkdf2(v: &[&str]) -> Result<Kdf, ParseKdfPbkdf2Error> {
const DEFAULT_DIGEST: Digest = Digest::Sha1;
const DEFAULT_ITERATIONS: u32 = 65536;
const DEFAULT_SALT_LEN: u32 = 16;
if v.len() != 0 && v.len() != 3 {
return Err(ParseKdfPbkdf2Error::InvalidNumberOfArguments(v.len()));
}
let digest = if v.is_empty() || v[0].is_empty() {
DEFAULT_DIGEST
} else {
v[0].parse::<Digest>()
.map_err(|()| ParseKdfPbkdf2Error::InvalidDigest(v[0].to_string()))?
};
let iterations = if v.is_empty() || v[1].is_empty() {
DEFAULT_ITERATIONS
} else {
v[1].parse::<u32>()
.map_err(|err| ParseKdfPbkdf2Error::InvalidIterations(err))?
};
let salt_len = if v.is_empty() || v[2].is_empty() {
DEFAULT_SALT_LEN
} else {
v[2].parse::<u32>()
.map_err(|err| ParseKdfPbkdf2Error::InvalidSaltLen(err))?
};
Ok(Kdf::generate_pbkdf2(digest, iterations, salt_len)?)
}
#[derive(Debug, Error)]
pub enum ParseKdfNoneError {
#[error("invalid number of arguments for the none-kdf, expected none but got {0}")]
InvalidNumberOfArguments(usize),
}
#[derive(Debug, Error)]
pub enum ParseKdfPbkdf2Error {
#[error("invalid number of arguments for PBKDF2, got {0} but none or three are expected")]
InvalidNumberOfArguments(usize),
#[error("invalid digest: {0}")]
InvalidDigest(String),
#[error("invalid iterations: {0}")]
InvalidIterations(#[source] ParseIntError),
#[error("invalid salt length: {0}")]
InvalidSaltLen(#[source] ParseIntError),
#[error(transparent)]
Kdf(#[from] KdfError),
}
#[derive(Debug, Error)]
pub enum ParseKdfError {
#[error(transparent)]
None(ParseKdfNoneError),
#[error(transparent)]
Pbkdf2(ParseKdfPbkdf2Error),
#[error("unknown kdf: {0}")]
Unknown(String),
}
impl FromStr for Kdf {
type Err = ParseKdfError;
fn from_str(s: &str) -> Result<Self, ParseKdfError> {
let v: Vec<&str> = s
.split(':')
.map(|s| s.trim_matches(char::is_whitespace))
.collect();
if v.is_empty() {
todo!()
}
match v[0] {
"none" => parse_none(&v[1..]).map_err(|err| ParseKdfError::None(err)),
"pbkdf2" => parse_pbkdf2(&v[1..]).map_err(|err| ParseKdfError::Pbkdf2(err)),
_ => Err(ParseKdfError::Unknown(v[0].to_string())),
}
}
}