RSA: Public-Key Cryptography in the 1970s

RSA or Rivest-Shamir-Adleman is one of the initial public-key cryptosystems, which are used to secure data transfer. In systems with asynchronous encryption, there are two keys: the public key, which is transmitted in clear form over the communication channel, and the private key, which is used to encrypt messages on one side of this communication channel. The advantage of such systems is that during transmission, it is not necessary to generate and exchange keys between the parties as in symmetric encryption, which increases the speed of information exchange and also reduces the cost of storing a large volume of keys. One of the most striking examples of an asynchronous cryptosystem is the RSA algorithm.

The main feature of this cryptosystem is the rather high cryptographic strength of the private key since the cracker needed to find a large enough natural prime number and then check the whole result in the ring of the dimension of this number. However, this cryptographic strength requires a rather huge cost of computer resources, such as processor time and memory. An RSA user creates and generates a key on the basis of two major prime numbers and the value of auxiliary, but the given numbers need to be concealed. It is important to note that any party is able to utilize the public key to create an encrypted message. However, this approach is not widely applied for direct encryption of data.

Most often, the RSA transmits keys, which are encrypted and shared, for a symmetric method of encoding, and the latter allows to conduct decoding operations at high rate of functionality. The basic principle of RSA is the fact that it is highly difficult to derive all value integers, such as n, e, and d. It is important to note that the modular exponent is m (with 0 m n): (me) d = m (modn). Possessing the knowledge of values, such as n and e does not guarantee that one can decode the d. In some cases, there is another form of the operations, where (md) e = m (modn). In the RSA algorithm, the essential keys are produced by selecting different values for q and p.

However, in order to ensure the security of the encryption, the given numbers must be generated in random fashion. Prime integers can be effectively found using the primitive test, and thus, it is critical to calculating n = pq. The presence of e short bit length and low Hamming weight leads to more efficient encryption – most often e = 216 + 1 = 65.537. However, in some settings, it was shown that much smaller values of e are less safe. It is not released as a public key indicator is stored as a private key indicator.

In addition, it is also important to understand that module factors, such as e and n, which are encryption values, must undergo privatization. It is done in order to keep the metrics of decryption secretive because these values can be captured and used for calculations. Therefore, RSA will be used in the future, but with the inventions of new encryption systems, it might be replaced with safer ones. For instance, elliptic cryptography is among the newer approaches for encryption procedures, which can be used to replace the RSA system with certain modifications.

Request for Removal

You can submit a removal request if you own the copyright to this content and don't want it to be available on our website anymore.