Struct GenericRsaPublicKey 

pub struct GenericRsaPublicKey<T, M>
where
    T: UnsignedModularInt,
    M: ModulusParams<Modulus = T>,
{ /* private fields */ }

Represents the public part of an RSA key.

Implementations

impl<T, M> GenericRsaPublicKey<T, M>

where T: UnsignedModularInt, M: ModulusParams<Modulus = T>,

pub fn from_components(n: T, e: T, n_params: M) -> Result<Self>

Create a public key from already-validated components and modulus parameters.

This is intended for alternate bigint backends that prepare their own modular arithmetic context outside the BoxedUint constructors.

impl<T, M> GenericRsaPublicKey<T, M>

where T: UnsignedModularInt, M: ModulusParams<Modulus = T>,

pub fn encrypt<R: CryptoRng + ?Sized, P: PaddingScheme>( &self, rng: &mut R, padding: P, msg: &[u8], ) -> Result<Vec<u8>>

Available on crate feature alloc only.

Encrypt the given message.

pub fn verify<S: SignatureScheme>( &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 GenericRsaPublicKey<BoxedUint, BoxedMontyParams>

pub const MIN_PUB_EXPONENT: u64 = 2

Available on crate feature alloc only.

Minimum value of the public exponent e.

pub const MAX_PUB_EXPONENT: u64

Available on crate feature alloc only.

Maximum value of the public exponent e.

Very large public exponents are a potential denial-of-service vector (a.k.a. “RSADoS”) because they increase the amount of work required for e.g. signature verification. See:

https://www.imperialviolet.org/2012/03/17/rsados.html

The particular constant below has been chosen to align with ring where this value was selected based on the history of this particular issue, API compatibility concerns, and benchmark-driven evaluation. See RustCrypto/RSA#155.

If for some reason you have a legitimate reason to use keys with public exponents larger than this value, use the special APIs:

• [RsaPublicKey::new_with_large_exp]
• RsaPrivateKey::from_components_with_large_exponent

pub const MAX_SIZE: usize = 8192

Available on crate feature alloc only.

Maximum size of the modulus n in bits.

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

Available on crate feature alloc only.

Create a new public key from its components.

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

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

Available on crate feature alloc only.

Create a new public key from its components.

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

Available on crate feature alloc only.

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 AsRef<GenericRsaPublicKey<BoxedUint, BoxedMontyParams>> for RsaPrivateKey

Available on crate feature private-key only.

fn as_ref(&self) -> &RsaPublicKey

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

impl<D, T, M> AsRef<GenericRsaPublicKey<T, M>> for GenericVerifyingKey<D, T, M>

where D: Digest, T: UnsignedModularInt, M: ModulusParams<Modulus = T>,

fn as_ref(&self) -> &GenericRsaPublicKey<T, M>

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

impl<D, T, M> AsRef<GenericRsaPublicKey<T, M>> for GenericVerifyingKey<D, T, M>

where D: Digest, T: UnsignedModularInt, M: ModulusParams<Modulus = T>,

fn as_ref(&self) -> &GenericRsaPublicKey<T, M>

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

impl<T, M> Clone for GenericRsaPublicKey<T, M>

where T: UnsignedModularInt + Clone, M: ModulusParams<Modulus = T> + Clone,

fn clone(&self) -> GenericRsaPublicKey<T, M>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T, M> Debug for GenericRsaPublicKey<T, M>

where T: UnsignedModularInt + Debug, M: ModulusParams<Modulus = T> + Debug,

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

Formats the value using the given formatter.

impl From<&RsaPrivateKey> for GenericRsaPublicKey<BoxedUint, BoxedMontyParams>

Available on crate feature private-key only.

fn from(private_key: &RsaPrivateKey) -> Self

Converts to this type from the input type.

impl<D, T, M> From<GenericRsaPublicKey<T, M>> for GenericVerifyingKey<D, T, M>

where D: Digest + AssociatedOid, T: UnsignedModularInt, M: ModulusParams<Modulus = T>,

fn from(key: GenericRsaPublicKey<T, M>) -> Self

Converts to this type from the input type.

impl<D, T, M> From<GenericRsaPublicKey<T, M>> for GenericVerifyingKey<D, T, M>

where D: Digest, T: UnsignedModularInt, M: ModulusParams<Modulus = T>,

fn from(key: GenericRsaPublicKey<T, M>) -> Self

Converts to this type from the input type.

impl<D, T, M> From<GenericVerifyingKey<D, T, M>> for GenericRsaPublicKey<T, M>

where D: Digest, T: UnsignedModularInt, M: ModulusParams<Modulus = T>,

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

Converts to this type from the input type.

impl<D, T, M> From<GenericVerifyingKey<D, T, M>> for GenericRsaPublicKey<T, M>

where D: Digest, T: UnsignedModularInt, M: ModulusParams<Modulus = T>,

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

Converts to this type from the input type.

impl From<RsaPrivateKey> for GenericRsaPublicKey<BoxedUint, BoxedMontyParams>

Available on crate feature private-key only.

fn from(private_key: RsaPrivateKey) -> Self

Converts to this type from the input type.

impl<T, M> Hash for GenericRsaPublicKey<T, M>

where T: UnsignedModularInt, M: ModulusParams<Modulus = 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, M> PartialEq for GenericRsaPublicKey<T, M>

where T: UnsignedModularInt + PartialEq, M: ModulusParams<Modulus = T>,

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

where T: UnsignedModularInt, M: ModulusParams<Modulus = T>,

type MontyParams = M

Montgomery parameter type matching this modulus type.

fn n(&self) -> &NonZero<T>

Returns the modulus of the key.

fn e(&self) -> &T

Returns the public exponent of the key.

fn n_params(&self) -> &M

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.

fn n_bytes(&self) -> Box<[u8]>

Available on crate feature alloc only.

Returns the big endian serialization of the modulus of the key

fn e_bytes(&self) -> Box<[u8]>

Available on crate feature alloc only.

Returns the big endian serialization of the public exponent of the key

impl<T, M> Eq for GenericRsaPublicKey<T, M>

where T: UnsignedModularInt + Eq, M: ModulusParams<Modulus = T>,