Asymmetric Encryption Algorithms

Different keys are used for encryption and encryption in the process of asymmetric encryption, however, it is a normal practice to arrange “key-pairs”, to enable each user in a network, to possess a public as well as a private key. The public key as its name implies, is made available to each user, whereas the private key is for use only by the person to whom, it belongs.

The process of performing mathematical operations, in the conducting of substitutions and transformation to plain text, is applied by asymmetric encryption algorithms and involves six main segments. In the instance of an algorithm being applied to a text message, it is referred to as “Plain-text”. Mathematical actions such as the conducting of substitutions and transformations to the plain-text, is termed an “Encryption Algorithm” the primary association with asymmetric encryption.

The next segment within the asymmetric encryption algorithms system includes the previously mentioned public and private keys; used respectively for encryption and decryption. An encrypted or scrambled message, by the application of an algorithm to the plaintext message user key, is designated by the heading of “Cipher-text”. A “Decryption Algorithm” is the generator of the cipher-text, also the matching key for then production of the plain-text.

The system of asymmetric encryption requires the message sender and the receiver, to be established with the same software. A public and a private key, or a “key-pair”, are designed by the receiver, with both keys enabled to be unlocked by the same password. Public keys can be freely distributed, as they are only utilized in the encryption, or scrambling of data. However, the private key is a totally different concept; it is designed to ensure that the designated recipient is the only person able to decrypt or unscramble data sent to them.

Named after its inventors, Rivest, Shamir and Adleman, “RSA” is the best recognized asymmetric encryption algorithms using public and private keys that are the functions of two large prime numbers. The security of this system is built on the complexity of factoring large integers. It is able to be used for public key encryption and digital generated signatures, with the keys used for encryption and decryption in RSA algorithm, being generated by the utilization of random data.