DSA algorithm of encryption algorithm

Digital Signature Algorithm (DSA) is a variant of the Schnorr and ElGamal signature algorithm, which was used as a DSS (DigitalSignature Standard) by the United States NIST. The following parameters are applied in the algorithm: p:l bits are primes. L is a multiple of 64, ranging from 512 to 1024;q:p-1 of the 160bits factor; g:g = h^ ((p-1)/q) mod p,h satisfies the H < P-1, h^ ((p-1)/q) mod p > 1;x:x < q,x as the private key; y:y = g ^x mod p, (p, Q, G, Y) is a public key; H (x): One-way hash function. The DSS selects Sha (Secure Hash algorithm). P, Q, G can be shared by a group of users, but in practical applications, the use of public modules may pose a threat. The signature and verification agreement are as follows: 1. P produces random number K,k < q;2. P Calculates r = (g^k mod p) mod qs = (k^ ( -1) (H (m) + XR)) mod q signature result is (M, R, s). 3. When validating w = s^ ( -1) mod qu1 = (H (m) * W) mod qu2 = (r * W) mod qv = ((G^U1 * y^u2) mod p) mod q if v = r, the signature is considered valid. DSA is based on the problem of integer finite domain discrete logarithm, and its security is similar to that of RSA. An important feature of DSA is that two primes are exposed, so that when you use the P and Q of Others, you can confirm whether they are randomly generated or not, even if you don't know the private key. RSA algorithms do not. To force (0 Votes) Tempted (0 Votes) nonsense (0 Votes) Professional (0 Votes) The title party (0 Votes) passing (0 Votes) The original: Encryption algorithm DSA algorithm return to the network security home