ElGamal encryption

The algorithm

ElGamal encryption consists of three components: the key generator, the encryption algorithm, and the decryption algorithm.

Key generation

The key generator works as follows:

Alice generates an efficient description of a cyclic group G of order q with generator g . See below for a discussion on the required properties of this group.

Alice chooses an x randomly from { 1 , … , q − 1 } .

Alice computes h := g x .

Alice publishes h , along with the description of G , q , g , as her public key. Alice retains x as her private key, which must be kept secret.

Encryption

The encryption algorithm works as follows: to encrypt a message m to Alice under her public key ( G , q , g , h ) ,

Bob chooses a random y from { 1 , … , q − 1 } , then calculates c 1 := g y .

Bob calculates the shared secret s := h y := g x y .

Bob maps his secret message m onto an element m ′ of G .

Bob calculates c 2 := m ′ ⋅ s .

Bob sends the ciphertext ( c 1 , c 2 ) = ( g y , m ′ ⋅ h y ) = ( g y , m ′ ⋅ g x y ) to Alice

Note that one can easily find h y if one knows m ′ . Therefore, a new y is generated for every message to improve security. For this reason, y is also called an ephemeral key.

Decryption

The decryption algorithm works as follows: to decrypt a ciphertext ( c 1 , c 2 ) with her private key x ,

Alice calculates the shared secret s := c 1 x

and then computes m ′ := c 2 ⋅ s − 1 which she then converts back into the plaintext message m , where s − 1 is the inverse of s in the group G . (E.g. modular multiplicative inverse if G is a subgroup of a multiplicative group of integers modulo n).

The decryption algorithm produces the intended message, since

Practical use

The ElGamal cryptosystem is usually used in a hybrid cryptosystem. I.e., the message itself is encrypted using a symmetric cryptosystem and ElGamal is then used to encrypt the key used for the symmetric cryptosystem. This is because asymmetric cryptosystems like Elgamal are usually slower than symmetric ones for the same level of security, so it is faster to encrypt the symmetric key (which most of the time is quite small if compared to the size of the message) with Elgamal and the message (which can be arbitrarily large) with a symmetric cypher.

Security

The security of the ElGamal scheme depends on the properties of the underlying group G as well as any padding scheme used on the messages.

If the computational Diffie–Hellman assumption (CDH) holds in the underlying cyclic group G , then the encryption function is one-way.

If the decisional Diffie–Hellman assumption (DDH) holds in G , then ElGamal achieves semantic security. Semantic security is not implied by the computational Diffie–Hellman assumption alone. See decisional Diffie–Hellman assumption for a discussion of groups where the assumption is believed to hold.

ElGamal encryption is unconditionally malleable, and therefore is not secure under chosen ciphertext attack. For example, given an encryption ( c 1 , c 2 ) of some (possibly unknown) message m , one can easily construct a valid encryption ( c 1 , 2 c 2 ) of the message 2 m .

To achieve chosen-ciphertext security, the scheme must be further modified, or an appropriate padding scheme must be used. Depending on the modification, the DDH assumption may or may not be necessary.

Other schemes related to ElGamal which achieve security against chosen ciphertext attacks have also been proposed. The Cramer–Shoup cryptosystem is secure under chosen ciphertext attack assuming DDH holds for G . Its proof does not use the random oracle model. Another proposed scheme is DHAES, whose proof requires an assumption that is weaker than the DDH assumption.

Efficiency

ElGamal encryption is probabilistic, meaning that a single plaintext can be encrypted to many possible ciphertexts, with the consequence that a general ElGamal encryption produces a 2:1 expansion in size from plaintext to ciphertext.

Encryption under ElGamal requires two exponentiations; however, these exponentiations are independent of the message and can be computed ahead of time if need be. Decryption only requires one exponentiation:

Decryption

The division by s can be avoided by using an alternative method for decryption. To decrypt a ciphertext ( c 1 , c 2 ) with Alice's private key x ,

Alice calculates s ′ = c 1 q − x = g ( q − x ) y .

s ′ is the inverse of s . This is a consequence of Lagrange's theorem, because

where e is the identity element of G .

Alice then computes m ′ = c 2 ⋅ s ′ , which she then converts back into the plaintext message m .

The decryption algorithm produces the intended message, since