Represents the abstract base class from which all implementations of the Digital Signature Algorithm () must inherit.
Assembly: mscorlib (in mscorlib.dll)
Gets or sets the size, in bits, of the key modulus used by the asymmetric algorithm.(Inherited from AsymmetricAlgorithm.)
Gets the key sizes that are supported by the asymmetric algorithm.(Inherited from AsymmetricAlgorithm.)
Creates the default cryptographic object used to perform the asymmetric algorithm.
Creates the specified cryptographic object used to perform the asymmetric algorithm.
When overridden in a derived class, creates thesignature for the specified data.
Determines whether the specified object is equal to the current object.(Inherited from Object.)
When overridden in a derived class, exports the DSAParameters.
Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection.(Inherited from Object.)
Reconstructs a AsymmetricAlgorithm.FromXmlString(String).)object from an XML string.(Overrides
Serves as the default hash function. (Inherited from Object.)
When overridden in a derived class, imports the specified DSAParameters.
Returns a string that represents the current object.(Inherited from Object.)
Creates and returns an XML string representation of the current AsymmetricAlgorithm.ToXmlString(Boolean).)object.(Overrides
When overridden in a derived class, verifies thesignature for the specified data.
You can use the DSACryptoServiceProvider provides an implementation of this class.class and derived classes to create digital signatures that help protect the integrity of your data. The
To use a public-key system to digitally sign a message, the sender first applies a hash function to the message to create a message digest. The sender then encrypts the message digest with the sender's private key to create the sender's personal signature. Upon receiving the message and signature, the receiver decrypts the signature using the sender's public key to recover the message digest and hashes the message using the same hash algorithm that the sender used. If the message digest that the receiver computes exactly matches the message digest received from the sender, the receiver can assume that the message was not altered while in transit. Note that a signature can be verified by anyone, because the sender's public key is common knowledge.
Newer asymmetric algorithms are available. Consider using the RSA class, the ECDsa class, or the ECDiffieHellman class instead of the class. Use only for compatibility with legacy applications and data.
This algorithm supports key lengths from 512 bits to 1024 bits in increments of 64 bits.
Available since 1.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.