Struct PeerKeyEntry 

pub struct PeerKeyEntry {
    pub public_key: [u8; 32],
    pub k_enc: [u8; 16],
    pub k_mic: [u8; 16],
}

One PROP_HOST_PEER_KEYS entry in item form: the peer’s public key and the pairwise keys derived by the host. Secret-bearing — the digest form is Self::public_key alone.

Inserting an entry whose public key matches an existing entry replaces that entry’s key material (the spec’s exception to the STATUS_ALREADY duplicate rule).

Fields

public_key: [u8; 32]

k_enc: [u8; 16]

k_mic: [u8; 16]

Implementations

impl PeerKeyEntry

pub const WIRE_LEN: usize = 64usize

pub fn encode(&self, out: &mut [u8]) -> Result<usize, ItemError>

pub fn decode(input: &[u8]) -> Result<Self, ItemError>

Decode an item occupying the whole input.

pub fn digest(&self) -> &[u8; 32]

The entry’s digest form (and remove selector): the public key, never the pairwise keys.

Trait Implementations

impl Clone for PeerKeyEntry

fn clone(&self) -> PeerKeyEntry

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PeerKeyEntry

Debug intentionally omits k_enc/k_mic: entries must never leak key material into logs or panic messages.

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

Formats the value using the given formatter.

impl PartialEq for PeerKeyEntry

fn eq(&self, other: &PeerKeyEntry) -> 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 Copy for PeerKeyEntry

impl Eq for PeerKeyEntry

impl StructuralPartialEq for PeerKeyEntry