Symmetric and Asymmetric Encryption
Symmetric and Asymmetric Encryption
Key terms:
Plaintext: the original data being sent from sender to the receiver is known as plaintext
Ciphertext: an encryption algorithm is applied on the plain text. The text produced after this
the process is called ciphertext
Encryption algorithm/key: key or algorithm used to convert the plain text into ciphertext is
called encryption algorithm or key.
Decryption algorithm: key or algorithm used to convert cipher text into plaintext is called
decryption algorithm or key.
C O M P U T E R
4 2 9 1 3 6 2 8
G Q V Q X Z G Z
Plaintext on the top line of the figure - ciphertext shown on the bottom
However modern computers could crack this encryption code this encryption key. We now
use 256 bit binary encryption keys that give 2^256 (approximately 1.2 x 10^77) possible
codes. Even this may not be enough as we head towards quantum computers.
1) Jane uses an algorithm to generate a matching pair of keys (private and public) that must
be kept on their computers, matching pairs of keys are mathematically similar but cannot be
derived from each other.
3) Tom now uses Jane’s public key to encrypt the document he wishes to send to her. He
then sends his encrypted document (ciphertext) back to Jane.
4) Jane uses her matching private key to unlock Tom’s document and decrypt it; this works
because the public key used to encrypt the document and the private key to decrypt it are a
matching pair generated on Jane’s computer. (Jane cannot use public key to decrypt the
message)
Jane can also exchange her public key with any number of people, so she is able to receive
encrypted messages (which have been encrypted with her public key) and she can decrypt
them using her matching private key.
If all of them want a two way communication then each of them have to generate their
matching private and public code.