Struct Keycode

pub struct Keycode(/* private fields */);

Input to regenerate keys “stored” in the PUF.

TODO: split into

• key code valid (first four bytes)
• key parameters (user/generated, length, …?)
• actual keycode = last 52 bytes

Empirically, these arrays start with either ‘59595959 01000002’ for 16B keys, or ‘59595959 00000004’ for 32B keys.

A generated UDS key example seens in the wild starts with 59595959 010F0004 however.

Presumably (entire paragraph is speculative), this is followed by 32B of input to be XOR’d or whatnot with the 32B “fingerprint” derived from PUF “startup data” via error correction with the “activation code” (and then truncated to key length). Which would leave 16B hash.

Implementations

impl Keycode

pub fn valid(&self) -> bool

Not sure if this is true (in analogy with “header”)

pub fn generated_key(&self) -> bool

pub fn user_key(&self) -> bool

Trait Implementations

impl AsRef<[u8]> for Keycode

fn as_ref(&self) -> &[u8]

Converts this type into a shared reference of the (usually inferred) input type.

impl Clone for Keycode

fn clone(&self) -> Keycode

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Keycode

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Keycode

fn default() -> Self

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for Keycode

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Hash for Keycode

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for Keycode

fn cmp(&self, other: &Keycode) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for Keycode

fn eq(&self, other: &Keycode) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for Keycode

fn partial_cmp(&self, other: &Keycode) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Serialize for Keycode

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Copy for Keycode

impl Eq for Keycode

impl StructuralPartialEq for Keycode