Digital Signature Algorithm

DSA — a variant of the Schnorr and ElGamal signature schemes, based on modular exponentiation and the discrete logarithm problem.

Keys

General

Find a prime number Q that matches the digit capacity of the message being signed. — Try the numbers until you find a prime number Find a prime number P such that P-1 is divisible by number Q — P - 1 = Q * n Find a subgroup generator h — a random number, but 2 is usually used

Personal Keys

Secret key Public key

Signing

Message for signature Random number, session secret key. A unique K must be used for each message. Reuse K will reveal the secret key. The pair (R,S) are the signature of Msg.

Verifying

Subskribita.net