A | B | C | D | E | F | G | H | CH | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9
The ElGamal signature scheme is a digital signature scheme which is based on the difficulty of computing discrete logarithms. It was described by Taher Elgamal in 1985.[1]
The ElGamal signature algorithm is rarely used in practice. A variant developed at the NSA and known as the Digital Signature Algorithm is much more widely used. There are several other variants.[2] The ElGamal signature scheme must not be confused with ElGamal encryption which was also invented by Taher Elgamal.
Overview
The ElGamal signature scheme is a digital signature scheme based on the algebraic properties of modular exponentiation, together with the discrete logarithm problem. 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), 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).
History
The ElGamal signature scheme was described by Taher Elgamal in 1985.[1] It is based on the Diffie–Hellman problem.
Operation
The scheme involves four operations: key generation (which creates the key pair), key distribution, signing and signature verification.
Key generation
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 a single key pair for one user.
Parameter generation
- Choose a key length .
- Choose a -bit prime number
- Choose a cryptographic hash function with output length bits. If , only the leftmost bits of the hash output are used.
- Choose a generator of the multiplicative group of integers modulo p, .
The algorithm parameters are . These parameters may be shared between users of the system.
Per-user keys
Given a set of parameters, the second phase computes the key pair for a single user:
- Choose an integer randomly from .
- Compute .
is the private key and is the public key.
Key distribution
The signer should send the public key to the receiver via a reliable, but not necessarily secret, mechanism. The signer should keep the private key secret.
Signing
A message is signed as follows:
- Choose an integer randomly from with relatively prime to .
- Compute .
- Compute .
- In the unlikely event that start again with a different random .
The signature is .
Verifying a signature
One can verify that a signature is a valid signature for a message as follows:
- Verify that and .
- The signature is valid if and only if
Correctness
The algorithm is correct in the sense that a signature generated with the signing algorithm will always be accepted by the verifier.
The computation of during signature generation implies
Since is relatively prime to ,
Security
A third party can forge signatures either by finding the signer's secret key x or by finding collisions in the hash function
Antropológia
Aplikované vedy
Bibliometria
Dejiny vedy
Encyklopédie
Filozofia vedy
Forenzné vedy
Humanitné vedy
Knižničná veda
Kryogenika
Kryptológia
Kulturológia
Literárna veda
Medzidisciplinárne oblasti
Metódy kvantitatívnej analýzy
Metavedy
Metodika
Text je dostupný za podmienok Creative
Commons Attribution/Share-Alike License 3.0 Unported; prípadne za ďalších
podmienok.
Podrobnejšie informácie nájdete na stránke Podmienky
použitia.
www.astronomia.sk | www.biologia.sk | www.botanika.sk | www.dejiny.sk | www.economy.sk | www.elektrotechnika.sk | www.estetika.sk | www.farmakologia.sk | www.filozofia.sk | Fyzika | www.futurologia.sk | www.genetika.sk | www.chemia.sk | www.lingvistika.sk | www.politologia.sk | www.psychologia.sk | www.sexuologia.sk | www.sociologia.sk | www.veda.sk I www.zoologia.sk