Struct ring::rsa::public_key::Inner

pub(crate) struct Inner {
    n: PublicModulus,
    e: PublicExponent,
}

PublicKey but without any superfluous allocations, optimized for one-shot RSA signature verification.

Fields

n: PublicModulus

e: PublicExponent

Implementations

impl Inner

pub(super) fn from_modulus_and_exponent( n: Input<'_>, e: Input<'_>, n_min_bits: BitLength, n_max_bits: BitLength, e_min_value: PublicExponent, cpu_features: Features, ) -> Result<Self, KeyRejected>

pub(super) fn n(&self) -> &PublicModulus

The public modulus.

pub(super) fn e(&self) -> PublicExponent

The public exponent.

pub(super) fn exponentiate<'out>( &self, base: Input<'_>, out_buffer: &'out mut [u8; 1024], cpu_features: Features, ) -> Result<&'out [u8], Unspecified>

Calculates base**e (mod n), filling the first part of out_buffer with the result.

This is constant-time with respect to the value in base (only).

The result will be a slice of the encoded bytes of the result within out_buffer, if successful.

pub(super) fn exponentiate_elem( &self, base: &Elem<N>, cpu_features: Features, ) -> Elem<N>

Calculates base**e (mod n).

This is constant-time with respect to base only.

Trait Implementations

impl Clone for Inner

fn clone(&self) -> Inner

Returns a copy of the value.

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

Performs copy-assignment from source.