navajo 0.0.2

cryptographic APIs
Documentation 
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

use super::Algorithm;
use crate::{
    daead::cipher::Cipher,
    error::{DecryptDeterministicallyError, EncryptDeterministicallyError},
    key::{Key, KeyMaterial},
    sensitive, Aad, Buffer, Rng,
};
use alloc::{vec, vec::Vec};
use serde::{Deserialize, Serialize};
use zeroize::ZeroizeOnDrop;

#[derive(Clone, ZeroizeOnDrop, Serialize, Debug)]
pub(crate) struct Material {
    #[zeroize(skip)]
    #[serde(rename = "alg")]
    algorithm: Algorithm,
    value: sensitive::Bytes,
}

impl<'de> Deserialize<'de> for Material {
    fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
    where
        D: serde::Deserializer<'de>,
    {
        #[derive(Deserialize)]
        struct Data {
            #[serde(rename = "alg")]
            algorithm: Algorithm,
            value: sensitive::Bytes,
        }
        let data = Data::deserialize(deserializer)?;
        if data.value.len() != data.algorithm.key_len() {
            return Err(serde::de::Error::custom("invalid key length"));
        }

        Cipher::new(data.algorithm, &data.value).map_err(serde::de::Error::custom)?;

        Ok(Self {
            algorithm: data.algorithm,
            value: data.value,
        })
    }
}

impl PartialEq for Material {
    fn eq(&self, other: &Self) -> bool {
        self.algorithm == other.algorithm && self.value == other.value
    }
}
impl Eq for Material {}

impl Material {
    pub(super) fn generate<N>(rng: &N, algorithm: Algorithm) -> Self
    where
        N: Rng,
    {
        let mut bytes = vec![0u8; algorithm.key_len()];
        rng.fill(&mut bytes).unwrap();

        Self {
            value: sensitive::Bytes::new(&bytes),
            algorithm,
        }
    }
}

impl Key<Material> {
    pub(super) fn encrypt_deterministically<A>(
        &self,
        aad: Aad<A>,
        plaintext: &[u8],
    ) -> Result<Vec<u8>, EncryptDeterministicallyError>
    where
        A: AsRef<[u8]>,
    {
        let mut buf = plaintext.to_vec();
        self.encrypt_in_place_deterministically(aad, &mut buf)?;
        Ok(buf)
    }

    pub(super) fn encrypt_in_place_deterministically<A, B>(
        &self,
        aad: Aad<A>,
        plaintext: &mut B,
    ) -> Result<(), EncryptDeterministicallyError>
    where
        A: AsRef<[u8]>,
        B: Buffer,
    {
        let mut cipher = self.cipher();
        cipher.encrypt_in_place(aad, plaintext)?;
        plaintext.prepend_slice(&self.key_bytes()[..]);
        Ok(())
    }

    pub(super) fn decrypt_in_place_deterministically<A, B>(
        &self,
        aad: Aad<A>,
        ciphertext: &mut B,
    ) -> Result<(), DecryptDeterministicallyError>
    where
        A: AsRef<[u8]>,
        B: Buffer,
    {
        let mut cipher = self.cipher();
        cipher.decrypt_in_place(aad, ciphertext)?;
        Ok(())
    }

    fn cipher(&self) -> Cipher {
        Cipher::new(self.algorithm(), &self.material().value).unwrap()
    }
}

impl KeyMaterial for Material {
    type Algorithm = Algorithm;
    fn algorithm(&self) -> Self::Algorithm {
        self.algorithm
    }

    fn kind() -> crate::primitive::Kind {
        crate::primitive::Kind::Daead
    }
}

#[cfg(test)]
mod tests {

    // use aes_siv::siv::Aes256Siv;
    // use rust_crypto_aead::KeyInit;

    // use crate::SystemRng;

    // use super::*;

    // #[test]
    // fn spike() {
    //     let mut bytes = vec![0u8; 64];
    //     SystemRng.fill(&mut bytes).unwrap();
    //     let _: sensitive::Bytes = bytes.into();

    //     let k = Aes256Siv::generate_key(rand_core::OsRng::default());
    //     dbg!(k.len());
    // }
}