# RSAParameters Structure

**.NET Framework (current version)**

Note |
---|

The .NET API Reference documentation has a new home. Visit the .NET API Browser on docs.microsoft.com to see the new experience. |

Represents the standard parameters for the RSA algorithm.

**Namespace:**System.Security.Cryptography

**Assembly:**mscorlib (in mscorlib.dll)

Name | Description | |
---|---|---|

Equals(Object) | Indicates whether this instance and a specified object are equal.(Inherited from ValueType.) | |

GetHashCode() | Returns the hash code for this instance.(Inherited from ValueType.) | |

GetType() | ||

ToString() | Returns the fully qualified type name of this instance.(Inherited from ValueType.) |

Name | Description | |
---|---|---|

D | Represents the | |

DP | Represents the | |

DQ | Represents the | |

Exponent | Represents the | |

InverseQ | Represents the | |

Modulus | Represents the | |

P | Represents the | |

Q | Represents the |

The RSA class exposes an ExportParameters method that enables you to retrieve the raw RSA key in the form of an RSAParameters structure. Understanding the contents of this structure requires familiarity with how the RSA algorithm works. The next section discusses the algorithm briefly.

To generate a key pair, you start by creating two large prime numbers named *p* and *q*. These numbers are multiplied and the result is called *n*. Because *p* and *q* are both prime numbers, the only factors of *n* are 1, *p*, *q*, and *n*.

If we consider only numbers that are less than *n*, the count of numbers that are relatively prime to *n*, that is, have no factors in common with *n*, equals *(p - 1)(q - 1)*.

Now you choose a number *e*, which is relatively prime to the value you calculated. The public key is now represented as *{e, n}*.

To create the private key, you must calculate *d*, which is a number such that *(d)(e) mod (p - 1)(q - 1) = 1*. In accordance with the Euclidean algorithm, the private key is now *{d, n}*.

Encryption of plaintext *m* to ciphertext *c* is defined as *c = (m ^ e) mod n*. Decryption would then be defined as *m = (c ^ d) mod n*.

Section A.1.2 of the PKCS #1: RSA Cryptography Standard on the RSA Laboratories Web site defines a format for RSA private keys.

The following table summarizes the fields of the RSAParameters structure. The third column provides the corresponding field in section A.1.2 of PKCS #1: RSA Cryptography Standard.

RSAParameters field | Contains | Corresponding PKCS #1 field |
---|---|---|

| privateExponent | |

| exponent1 | |

| exponent2 | |

| publicExponent | |

| coefficient | |

| modulus | |

| prime1 | |

| prime2 |

The security of RSA derives from the fact that, given the public key *{ e, n }*, it is computationally infeasible to calculate *d*, either directly or by factoring *n* into *p* and *q*. Therefore, any part of the key related to *d*, *p*, or *q* must be kept secret. If you call

ExportParameters and ask for only the public key information, this is why you will receive only Exponent and Modulus. The other fields are available only if you have access to the private key, and you request it.

RSAParameters is not encrypted in any way, so you must be careful when you use it with the private key information. In fact, none of the fields that contain private key information can be serialized. If you try to serialize an RSAParameters structure with a remoting call or by using one of the serializers, you will receive only public key information. If you want to pass private key information, you will have to manually send that data. In all cases, if anyone can derive the parameters, the key that you transmit becomes useless.

**.NET Framework**

Available since 1.1

**Windows Phone Silverlight**

Available since 7.1

Any public static (
**Shared**
in Visual Basic) members of this type are thread safe. Any instance members are not guaranteed to be thread safe.