json-web-key 0.1.0

A ser(de) for JWKS, and the basic structs for representing them.
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

use serde::{Deserialize, Serialize};
use std::hash::Hash;

use crate::{cert::Certificate, encoded_bytes_field::EncodedBytesField};

#[derive(Clone, Debug, Deserialize, Serialize)]
pub struct RsaWebKey {
    #[serde(flatten)]
    pub cert: Certificate,
    #[serde(rename = "kid")]
    pub key_id: Box<str>,
    #[serde(default)]
    pub key_ops: Box<[Box<str>]>,
    #[serde(default, flatten)]
    pub key_type: KeyType,
    #[serde(rename = "use", default)]
    pub use_case: Box<str>,
    #[serde(rename = "e", with = "EncodedBytesField")]
    pub exponent: Box<[u8]>,
    #[serde(rename = "n", with = "EncodedBytesField")]
    pub modulus: Box<[u8]>,
}

#[derive(Clone, Debug, Default, Deserialize, PartialEq, Serialize)]
#[serde(tag = "kty")]
pub enum KeyType {
    #[default]
    RSA,
}

impl Default for RsaWebKey {
    fn default() -> Self {
        Self {
            cert: Certificate::default(),
            key_id: "".into(),
            key_ops: [].into(),
            key_type: KeyType::default(),
            exponent: [].into(),
            modulus: [].into(),
            use_case: "".into(),
        }
    }
}

// Derive equality based off key_id, not accurate but --
// just like database records, we can save a lot of
// performance by just assuming the key_id is accurate.
impl Eq for RsaWebKey {}

impl Hash for RsaWebKey {
    fn hash<H: std::hash::Hasher>(&self, state: &mut H) {
        self.key_id.hash(state)
    }
}

impl PartialEq for RsaWebKey {
    fn eq(&self, other: &Self) -> bool {
        self.key_id.eq(&other.key_id)
    }
}