Welcome to **EverybodyWiki** ! Sign in or create an account to improve, watchlist or **create an article** like a company page or a **bio** (yours ?)...

# Digital Signature Algorithm

The **Digital Signature Algorithm** (**DSA**) is a Federal Information Processing Standard for **digital signatures**, based on the mathematical concept of modular exponentiations and the discrete logarithm problem.

In August 1991 the National Institute of Standards and Technology (NIST) proposed DSA for use in their **Digital Signature Standard** (**DSS**) and adopted it as FIPS 186 in 1994.^{[1]} Four revisions to the initial specification have been released: FIPS 186-1 in 1996,^{[2]} FIPS 186-2 in 2000,^{[3]} FIPS 186-3 in 2009,^{[4]} and FIPS 186-4 in 2013.^{[5]}

DSA is covered by U.S. Patent 5,231,668, filed July 26, 1991 and attributed to David W. Kravitz,^{[6]} a former NSA employee. This patent was given to "The United States of America as represented by the Secretary of Commerce, Washington, D.C.", and NIST has made this patent available worldwide royalty-free.^{[7]} Claus P. Schnorr claims that his U.S. Patent 4,995,082 (expired) covered DSA; this claim is disputed.^{[8]} DSA is a variant of the ElGamal signature scheme.

## Contents

## DSA: How does it work?[edit]

The **DSA** algorithm works in the framework of public-key cryptosystems and is based on the algebraic properties of the **modular exponentiations,** together with the **discrete logarithm problem** (which is considered to be computationally intractable). Messages are **signed** by the signer's **private key** and the signatures are **verified** by the signer's corresponding **public key**. The digital signature provides message authentication, integrity and non-repudiation.

## Key generation[edit]

Key generation has two phases. The first phase is a choice of *algorithm parameters* which may be shared between different users of the system, while the second phase computes public and private keys for a single user.

### Parameter generation[edit]

- Choose an approved cryptographic hash function
*H*. In the original DSS,*H*was always SHA-1, but the stronger SHA-2 hash functions are approved for use in the current DSS.^{[5]}^{[9]}The hash output may be truncated to the size of a key pair. - Decide on a key length
*L*and*N*. This is the primary measure of the cryptographic strength of the key. The original DSS constrained*L*to be a multiple of 64 between 512 and 1,024 (inclusive). NIST 800-57 recommends lengths of 2,048 (or 3,072) for keys with security lifetimes extending beyond 2010 (or 2030), using correspondingly longer*N*.^{[10]}FIPS 186-3 specifies*L*and*N*length pairs of (1,024, 160), (2,048, 224), (2,048, 256), and (3,072, 256).^{[4]}*N*must be less than or equal to the output length of the hash*H*. - Choose an
*N*-bit prime*q*. - Choose an
*L*-bit prime*p*such that*p*− 1 is a multiple of*q*. - Choose
*g*, a number whose multiplicative order modulo*p*is*q*. This means that*q*is the smallest positive integer such that*g*^{q}=1 mod*p*. This may be done by setting*g*=*h*^{(p − 1)/q}mod*p*for some arbitrary*h*(1 <*h*<*p*− 1), and trying again with a different*h*if the result comes out as 1. Most choices of*h*will lead to a usable*g*; commonly*h*= 2 is used.

The algorithm parameters (*p*, *q*, *g*) may be shared between different users of the system.

### Per-user keys[edit]

Given a set of parameters, the second phase computes private and public keys for a single user:

- Choose a secret private key
*x*by some random method, where 0 <*x*<*q*. - Calculate the public key
*y*=*g*mod^{x}*p*.

There exist efficient algorithms for computing the modular exponentiations *h*^{(p − 1)/q} mod *p* and *g ^{x}* mod

*p*, such as exponentiation by squaring.

## Signing[edit]

Let be the hashing function and the message:

- Generate a random per-message value where
- Calculate
- In the unlikely case that , start again with a different random
- Calculate
- In the unlikely case that , start again with a different random
- The signature is

The first two steps amount to creating a new per-message key. The modular exponentiation here is the most computationally expensive part of the signing operation, and it may be computed before the message hash is known. The modular inverse is the second most expensive part, and it may also be computed before the message hash is known. It may be computed using the extended Euclidean algorithm or using Fermat's little theorem as .

## Verifying[edit]

- Reject the signature if or is not satisfied.
- Calculate
- Calculate
- Calculate
- Calculate
- The signature is valid if and only if

DSA is similar to the ElGamal signature scheme.

## Correctness of the algorithm[edit]

The signature scheme is correct in the sense that the verifier will always accept genuine signatures. This can be shown as follows:

First, if , it follows that by Fermat's little theorem. Since and is prime, must have order .

The signer computes

Thus

Since has order we have

Finally, the correctness of DSA follows from

## Sensitivity[edit]

With DSA, the entropy, secrecy, and uniqueness of the random signature value *k* are critical. It is so critical that violating any one of those three requirements can reveal the entire private key to an attacker.^{[11]} Using the same value twice (even while keeping *k* secret), using a predictable value, or leaking even a few bits of *k* in each of several signatures, is enough to reveal the private key *x*.^{[12]}

This issue affects both DSA and ECDSA – in December 2010, a group calling itself *fail0verflow* announced recovery of the ECDSA private key used by Sony to sign software for the PlayStation 3 game console. The attack was made possible because Sony failed to generate a new random *k* for each signature.^{[13]}

This issue can be prevented by deriving *k* deterministically from the private key and the message hash, as described by RFC 6979. This ensures that *k* is different for each *H(m)* and unpredictable for attackers who do not know the private key *x*.

In addition, malicious implementations of DSA and ECDSA can be created where *k* is chosen in order to subliminally leak information via signatures. For example, an offline private key could be leaked from a perfect offline device that only released innocent-looking signatures.^{[14]}

## Implementations[edit]

Below is a list of cryptographic libraries that provide support for DSA:

- Botan
- Bouncy Castle
- cryptlib
- Crypto++
- libgcrypt
- libsodium
- Nettle
- OpenSSL
- wolfCrypt

## See also[edit]

- Modular arithmetic

## References[edit]

- ↑ "FIPS PUB 186: Digital Signature Standard (DSS), 1994-05-19".
*qcsrc.nist.gov*. Archived from the original on 2013-12-13. - ↑ "FIPS PUB 186-1: Digital Signature Standard (DSS), 1998-12-15" (PDF).
*csrc.nist.gov*. Archived from the original (PDF) on 2013-12-26. - ↑ "FIPS PUB 186-2: Digital Signature Standard (DSS), 2000-01-27" (PDF).
*csrc.nist.gov*. - ↑
^{4.0}^{4.1}"FIPS PUB 186-3: Digital Signature Standard (DSS), June 2009" (PDF).*csrc.nist.gov*. - ↑
^{5.0}^{5.1}"FIPS PUB 186-4: Digital Signature Standard (DSS), July 2013" (PDF).*csrc.nist.gov*. - ↑ Dr. David W. Kravitz Archived January 9, 2013, at the Wayback Machine
- ↑ Werner Koch. "DSA and patents"
- ↑ "Wayback Machine". 26 August 2009.
- ↑ "FIPS PUB 180-4: Secure Hash Standard (SHS), March 2012" (PDF).
*csrc.nist.gov*. - ↑ "NIST Special Publication 800-57" (PDF).
*csrc.nist.gov*. Archived from the original (PDF) on 2014-06-06. - ↑ "The Debian PGP disaster that almost was".
*root labs rdist*. - ↑ DSA
*k*-value Requirements - ↑ Bendel, Mike (2010-12-29). "Hackers Describe PS3 Security As Epic Fail, Gain Unrestricted Access". Exophase.com. Retrieved 2011-01-05.
- ↑ Verbücheln, Stephan (2 January 2015). "How Perfect Offline Wallets Can Still Leak Bitcoin Private Keys". arXiv:1501.00447 [cs.CR].

## External links[edit]

- FIPS PUB 186-4: Digital Signature Standard (DSS), the fourth (and current) revision of the official DSA specification.
- Recommendation for Key Management -- Part 1: general, NIST Special Publication 800-57, p. 62–63

This article "Digital Signature Algorithm" is from Wikipedia. The list of its authors can be seen in its historical. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.