// Copyright (c) 2017 Emmanuel Gil Peyrot // // This Source Code Form is subject to the terms of the Mozilla Public // License, v. 2.0. If a copy of the MPL was not distributed with this // file, You can obtain one at http://mozilla.org/MPL/2.0/. use std::str::FromStr; use minidom::IntoAttributeValue; use crate::error::Error; use crate::helpers::Base64; use base64; /// List of the algorithms we support, or Unknown. #[allow(non_camel_case_types)] #[derive(Debug, Clone, PartialEq, Eq, Hash)] pub enum Algo { /// The Secure Hash Algorithm 1, with known vulnerabilities, do not use it. /// /// See https://tools.ietf.org/html/rfc3174 Sha_1, /// The Secure Hash Algorithm 2, in its 256-bit version. /// /// See https://tools.ietf.org/html/rfc6234 Sha_256, /// The Secure Hash Algorithm 2, in its 512-bit version. /// /// See https://tools.ietf.org/html/rfc6234 Sha_512, /// The Secure Hash Algorithm 3, based on Keccak, in its 256-bit version. /// /// See https://keccak.team/files/Keccak-submission-3.pdf Sha3_256, /// The Secure Hash Algorithm 3, based on Keccak, in its 512-bit version. /// /// See https://keccak.team/files/Keccak-submission-3.pdf Sha3_512, /// The BLAKE2 hash algorithm, for a 256-bit output. /// /// See https://tools.ietf.org/html/rfc7693 Blake2b_256, /// The BLAKE2 hash algorithm, for a 512-bit output. /// /// See https://tools.ietf.org/html/rfc7693 Blake2b_512, /// An unknown hash not in this list, you can probably reject it. Unknown(String), } impl FromStr for Algo { type Err = Error; fn from_str(s: &str) -> Result { Ok(match s { "" => return Err(Error::ParseError("'algo' argument can’t be empty.")), "sha-1" => Algo::Sha_1, "sha-256" => Algo::Sha_256, "sha-512" => Algo::Sha_512, "sha3-256" => Algo::Sha3_256, "sha3-512" => Algo::Sha3_512, "blake2b-256" => Algo::Blake2b_256, "blake2b-512" => Algo::Blake2b_512, value => Algo::Unknown(value.to_owned()), }) } } impl From for String { fn from(algo: Algo) -> String { String::from(match algo { Algo::Sha_1 => "sha-1", Algo::Sha_256 => "sha-256", Algo::Sha_512 => "sha-512", Algo::Sha3_256 => "sha3-256", Algo::Sha3_512 => "sha3-512", Algo::Blake2b_256 => "blake2b-256", Algo::Blake2b_512 => "blake2b-512", Algo::Unknown(text) => return text, }) } } impl IntoAttributeValue for Algo { fn into_attribute_value(self) -> Option { Some(String::from(self)) } } generate_element!( /// This element represents a hash of some data, defined by the hash /// algorithm used and the computed value. #[derive(PartialEq)] Hash, "hash", HASHES, attributes: [ /// The algorithm used to create this hash. algo: Algo = "algo" => required ], text: ( /// The hash value, as a vector of bytes. hash: Base64> ) ); impl Hash { /// Creates a [Hash] element with the given algo and data. pub fn new(algo: Algo, hash: Vec) -> Hash { Hash { algo, hash, } } /// Like [new](#method.new) but takes base64-encoded data before decoding /// it. pub fn from_base64(algo: Algo, hash: &str) -> Result { Ok(Hash::new(algo, base64::decode(hash)?)) } } #[cfg(test)] mod tests { use super::*; use try_from::TryFrom; use minidom::Element; #[cfg(target_pointer_width = "32")] #[test] fn test_size() { assert_size!(Algo, 16); assert_size!(Hash, 28); } #[cfg(target_pointer_width = "64")] #[test] fn test_size() { assert_size!(Algo, 32); assert_size!(Hash, 56); } #[test] fn test_simple() { let elem: Element = "2XarmwTlNxDAMkvymloX3S5+VbylNrJt/l5QyPa+YoU=".parse().unwrap(); let hash = Hash::try_from(elem).unwrap(); assert_eq!(hash.algo, Algo::Sha_256); assert_eq!(hash.hash, base64::decode("2XarmwTlNxDAMkvymloX3S5+VbylNrJt/l5QyPa+YoU=").unwrap()); } #[test] fn test_unknown() { let elem: Element = "".parse().unwrap(); let error = Hash::try_from(elem).unwrap_err(); let message = match error { Error::ParseError(string) => string, _ => panic!(), }; assert_eq!(message, "This is not a hash element."); } #[test] fn test_invalid_child() { let elem: Element = "".parse().unwrap(); let error = Hash::try_from(elem).unwrap_err(); let message = match error { Error::ParseError(string) => string, _ => panic!(), }; assert_eq!(message, "Unknown child in hash element."); } }