Struct RsaPublicKey

pub struct RsaPublicKey<T>
where
    T: UnsignedModularInt,
{ /* private fields */ }

Represents the public part of an RSA key.

Implementations

impl<T: UnsignedModularInt + Clone> RsaPublicKey<T>

pub fn encrypt<R: CryptoRngCore, P: PaddingScheme<T>>( &self, rng: &mut R, padding: P, msg: &[u8], storage: &mut [u8], ) -> Result<()>

Encrypt the given message.

pub fn verify<S: SignatureScheme<T>>( &self, scheme: S, hashed: &[u8], sig: &[u8], ) -> Result<()>

Verify a signed message.

hashed must be the result of hashing the input using the hashing function passed in through hash.

If the message is valid Ok(()) is returned, otherwise an Err indicating failure.

impl<T: UnsignedModularInt> RsaPublicKey<T>

pub const MIN_PUB_EXPONENT: u64 = 2u64

Minimum value of the public exponent e.

pub const MAX_PUB_EXPONENT: u64 = 8_589_934_591u64

Maximum value of the public exponent e.

pub const MAX_SIZE: usize = 4_096usize

Maximum size of the modulus n in bits.

pub fn new(n: T, e: T) -> Result<Self>

Create a new public key from its components.

This function accepts public keys with a modulus size up to 4096-bits, i.e. RsaPublicKey::MAX_SIZE.

pub fn new_with_max_size(n: T, e: T, max_size: usize) -> Result<Self>

Create a new public key from its components.

pub fn new_unchecked(n: T, e: T) -> Self

Create a new public key, bypassing checks around the modulus and public exponent size.

This method is not recommended, and only intended for unusual use cases. Most applications should use RsaPublicKey::new or RsaPublicKey::new_with_max_size instead.

Trait Implementations

impl<T: UnsignedModularInt> AsRef<RsaPublicKey<T>> for RsaPrivateKey<T>

fn as_ref(&self) -> &RsaPublicKey<T>

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

impl<D, T> AsRef<RsaPublicKey<T>> for VerifyingKey<D, T>

where T: UnsignedModularInt,

fn as_ref(&self) -> &RsaPublicKey<T>

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

impl<D, T> AsRef<RsaPublicKey<T>> for VerifyingKey<D, T>

where D: Digest, T: UnsignedModularInt,

fn as_ref(&self) -> &RsaPublicKey<T>

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

impl<T> Clone for RsaPublicKey<T>

where T: UnsignedModularInt + Clone,

fn clone(&self) -> RsaPublicKey<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Debug for RsaPublicKey<T>

where T: UnsignedModularInt + Debug,

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

Formats the value using the given formatter.

impl<'de, T> Deserialize<'de> for RsaPublicKey<T>

where T: UnsignedModularInt,

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T: UnsignedModularInt> From<&RsaPrivateKey<T>> for RsaPublicKey<T>

fn from(private_key: &RsaPrivateKey<T>) -> Self

Converts to this type from the input type.

impl<T: UnsignedModularInt> From<RsaPrivateKey<T>> for RsaPublicKey<T>

fn from(private_key: RsaPrivateKey<T>) -> Self

Converts to this type from the input type.

impl<D, T> From<RsaPublicKey<T>> for VerifyingKey<D, T>

where T: UnsignedModularInt, D: Digest + AssociatedOid,

fn from(key: RsaPublicKey<T>) -> Self

Converts to this type from the input type.

impl<D, T> From<RsaPublicKey<T>> for VerifyingKey<D, T>

where D: Digest, T: UnsignedModularInt,

fn from(key: RsaPublicKey<T>) -> Self

Converts to this type from the input type.

impl<D, T> From<VerifyingKey<D, T>> for RsaPublicKey<T>

where T: UnsignedModularInt,

fn from(key: VerifyingKey<D, T>) -> Self

Converts to this type from the input type.

impl<D, T> From<VerifyingKey<D, T>> for RsaPublicKey<T>

where D: Digest, T: UnsignedModularInt,

fn from(key: VerifyingKey<D, T>) -> Self

Converts to this type from the input type.

impl<T: UnsignedModularInt> Hash for RsaPublicKey<T>

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<T: UnsignedModularInt> PartialEq for RsaPublicKey<T>

fn eq(&self, other: &RsaPublicKey<T>) -> 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<T: UnsignedModularInt> PublicKeyParts<T> for RsaPublicKey<T>

fn n(&self) -> &T

Returns the modulus of the key.

fn e(&self) -> &T

Returns the public exponent of the key.

fn n_params(&self) -> &MontyParams<T>

Returns the parameters for montgomery operations.

fn size(&self) -> usize

Returns the modulus size in bytes. Raw signatures and ciphertexts for or by this public key will have the same size.

fn n_bits_precision(&self) -> u32

Returns precision (in bits) of n.

impl<T> Serialize for RsaPublicKey<T>

where T: UnsignedModularInt,

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<T> TryFrom<SubjectPublicKeyInfo<AnyRef<'_>, BitStringRef<'_>>> for RsaPublicKey<T>

where T: UnsignedModularInt,

type Error = Error

The type returned in the event of a conversion error.

fn try_from(spki: SubjectPublicKeyInfoRef<'_>) -> Result<Self>

Performs the conversion.

impl<T: UnsignedModularInt> Eq for RsaPublicKey<T>