There are several ways of classifying cryptographic algorithms. For
purposes of this paper, they will be categorized based on the number of keys
that are employed for encryption and decryption, and further defined by their
application and use. The three types of algorithms that will be discussed are
(Figure 1):
|
|
Unlike symmetric key
cryptography, we do not find historical use of public-key cryptography. It is a
relatively new concept.
Symmetric cryptography
was well suited for organizations such as governments, military, and big
financial corporations were involved in the classified communication.
With the spread of more
unsecure computer networks in last few decades, a genuine need was felt to use
cryptography at larger scale. The symmetric key was found to be non-practical
due to challenges it faced for key management. This gave rise to the public key cryptosystems.
The process of
encryption and decryption is illustrated in the following figure:
The most important
properties of public key encryption scheme are −
·
Different keys are used for
encryption and decryption. This is a property which set this scheme different than
symmetric encryption scheme.
·
Each receiver possesses a
unique decryption key, generally referred to as his private key.
·
Receiver needs to publish
an encryption key,
referred to as his public key.
·
Some assurance of the
authenticity of a public key is needed in this scheme to avoid spoofing by adversary as the
receiver. Generally, this type of cryptosystem involves trusted third party
which certifies that a particular public key belongs to a specific person or
entity only.
·
Encryption algorithm is
complex enough to prohibit
attacker from deducing the plaintext from the ciphertext and the encryption
(public) key.
·
Though private and public keys are related mathematically, it is not be feasible to calculate the private key from the
public key. In fact, intelligent part of any public-key cryptosystem is in
designing a relationship between two keys.