Editing Digital Signature Algorithm (section)

==Overview==
The DSA works in the framework of public-key cryptosystems and is based on the algebraic properties of [[modular exponentiation]], together with the [[Discrete logarithm#Cryptography|discrete logarithm problem]], which is considered to be computationally intractable. The algorithm uses a key pair consisting of a public key and a private key. The private key is used to generate a digital signature for a message, and such a signature can be verified by using the signer's corresponding public key. The digital signature provides [[message authentication]] (the receiver can verify the origin of the message), [[Data integrity|integrity]] (the receiver can verify that the message has not been modified since it was signed) and [[non-repudiation]] (the sender cannot falsely claim that they have not signed the message).