Struct MLDSAPrivateKey 

pub struct MLDSAPrivateKey<const k: usize, const l: usize, const eta: usize, const SK_LEN: usize, const PK_LEN: usize> { /* private fields */ }

An ML-DSA private key.

This will automatically inherit the Secret protections because Polynomial wraps the underlying data with Secret.

Trait Implementations

impl<const k: usize, const l: usize, const eta: usize, const SK_LEN: usize, const PK_LEN: usize> Clone for MLDSAPrivateKey<k, l, eta, SK_LEN, PK_LEN>

fn clone(&self) -> MLDSAPrivateKey<k, l, eta, SK_LEN, PK_LEN>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const k: usize, const l: usize, const eta: usize, const SK_LEN: usize, const PK_LEN: usize> Debug for MLDSAPrivateKey<k, l, eta, SK_LEN, PK_LEN>

Debug impl mainly to prevent the secret key from being printed in logs.

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

Formats the value using the given formatter.

impl<const k: usize, const l: usize, const eta: usize, const SK_LEN: usize, const PK_LEN: usize> Display for MLDSAPrivateKey<k, l, eta, SK_LEN, PK_LEN>

Display impl mainly to prevent the secret key from being printed in logs.

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

Formats the value using the given formatter.

impl<const k: usize, const l: usize, const eta: usize, const SK_LEN: usize, const PK_LEN: usize> MLDSAPrivateKeyTrait<k, l, eta, SK_LEN, PK_LEN> for MLDSAPrivateKey<k, l, eta, SK_LEN, PK_LEN>

fn seed(&self) -> Option<&KeyMaterial<32>>

Get a ref to the seed, if there is one stored with this private key

fn tr(&self) -> &[u8; 64]

Get a ref to the key hash tr.

fn A_hat(&self) -> Matrix<k, l>

Get the public matrix A_hat.

fn derive_pk(&self) -> MLDSAPublicKey<k, l, PK_LEN>

This is a partial implementation of keygen_internal(), and probably not allowed in FIPS mode.

fn sk_decode(sk: &[u8; SK_LEN]) -> Result<Self, SignatureError>

Algorithm 25 skDecode(𝑠𝑘) Reverses the procedure skEncode. Input: Private key 𝑠𝑘 ∈ 𝔹32+32+64+32⋅((ℓ+𝑘)⋅bitlen (2𝜂)+𝑑𝑘). Output: 𝜌 ∈ 𝔹32, 𝐾 ∈ 𝔹32, 𝑡𝑟 ∈ 𝔹64 , 𝐬1 ∈ 𝑅ℓ, 𝐬2 ∈ 𝑅𝑘, 𝐭0 ∈ 𝑅𝑘 with coefficients in [−2𝑑−1 + 1, 2𝑑−1].

impl<const k: usize, const l: usize, const eta: usize, const SK_LEN: usize, const PK_LEN: usize> PartialEq for MLDSAPrivateKey<k, l, eta, SK_LEN, PK_LEN>

fn eq(&self, other: &Self) -> 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<const k: usize, const l: usize, const eta: usize, const SK_LEN: usize, const PK_LEN: usize> SignaturePrivateKey<SK_LEN> for MLDSAPrivateKey<k, l, eta, SK_LEN, PK_LEN>

fn encode(&self) -> [u8; SK_LEN]

Write it out to bytes in its standard encoding.

fn encode_out(&self, out: &mut [u8; SK_LEN]) -> usize

Write it out to bytes in its standard encoding. The entire output buffer is zeroized before the encoding is written.

fn from_bytes(bytes: &[u8]) -> Result<Self, SignatureError>

Read it in from bytes in its standard encoding.

impl<const k: usize, const l: usize, const eta: usize, const SK_LEN: usize, const PK_LEN: usize> Eq for MLDSAPrivateKey<k, l, eta, SK_LEN, PK_LEN>