Which Of The Following Asymmetric Cryptography Algorithms Is Most Commonly Used?

Which of the following asymmetric cryptography algorithms is most commonly used?
We use RSA asymmetric key algorithm is most commonly used. Now, let us learn in detail about the asymmetric algorithm. In starting years, cryptography is based on the symmetric keys where the sender encrypts the message and sends it to the receiver.

The Receiver then decrypts the messages by using the specific key. The sender and receiver use the same key to communicate with each other. Encryption is like mapping for some of the messages by using a specific key to the ciphertext message.

In order to decrypt the ciphertext, we use the same key as we used to encrypt the data. So when two persons want to communicate with each other securely, they share identical keys. But it is difficult to establish a shared key or it requires extra communication overhead when using the Diffie helmen key exchange. Suppose if a single person needs to communicate with many persons. The person should maintain different shared keys with all the other persons. This becomes a difficult process. So the RSA algorithm has been introduced.

The sender uses a private secret key and sends the message to the receiver. If the receivers want to send a message to the sender then the receiver mixes a secret key to the public message sent by the sender and sends the resulting mixture back to the sender. Now sender adds the private key to the message sent by the receiver by taking the secret key of the receiver. This is how it works.

But a mathematical solution was needed to make this work. The modular exponentiation was introduced as clock arithmetic in the Diffie helmen key exchange. For example, take a number and raised it to some exponent that is divided by the modulus and output the remainder. This can be used to encrypt the messages.

Let say sender A has a message that is converted into the number M, then we multiply the number by itself by E times. Here E represents the public exponent that divides the result by some random number n and outputs the remainder of the division.
M^e mod N=c is the mathematical solution. This is the easy calculation that we can perform

In the above mathematical solution, it is easy to know the value of e and N. But to find the value of M, we need to perform the trial and error method. It is easy to perform, but difficult to reverse. The key makes the process easy to reverse the encryption.

To reverse, we need to raise the result with some other exponent as below. c^d mod N that results in the initial operation that we applied to M and returns the original message.

Let us take an example let Sender B has a message to send to Sender A. The sender B converted the message into the form of a number by using the padding scheme. Let call the result N. Now the sender A generates the public and private key by selecting two random numbers at first and multiples them to get N. Then we can find the result.