As we mentioned the other popular asymmetric encryption algorithm is El-Gamal.
It was developed by an Egyptian cryptographer TR El-Gamal in the 80s after RSA generation is also the
most vital step for El-Gamal.
You have to select a large prime number P..
Then pick a random gene that satisfies the inequality G less than P2.
If the public and private Keep may be used interchangeably in RSA there's no such correlation in this
algorithm.
This results in the fact that the values P and G can be shared by many users in a system next.
Pick a random value x that is smaller than P
that and compute equation y equals G mod p.
The values PGE in y will be in your public key.
While the value X will be the private key
to encrypt the plaintext.
Pick any coprime integer k from the range up to p minus one
next.
Compute the following equation.
The ciphertext will be the value pair r and s.
The security of.
El-Gamal algorithm is less controversial than the security of RSA.
It does seem that calculating a discrete logarithm is indeed computationally difficult.
You can now encrypt the plaintext but encryption only serves to ensure data confidentiality.
It doesn't lead to a protection or establishing data authenticity authenticity can be as relevant as
or perhaps even more vital than confidentiality some other solution has to be used in that case.