Cryptography:
This is for data security.
Data is converted to cipher text, which is transferred.
Receiver will convert back cypher text to original text
Series of action:
plan text -> cypher text : Encryption
cypher text -> plan text : Decryption
Symmetric cryptography:
Same key is used for encryption and decryption
Challenges:
. If any one knows about key, he can read original message as well write or
modify message by using the key.
Hence sharing the key should be in secure manner.
Asymmetric key/ public key cryptography:
different key is used for encryption and decryption.
even if the public key is known by all, private key is kept secret.
Usage of Public key cryptography:
1. authenticate identity of the sender:
It will be possible to ascertain who was sender of message, and no intruder
will be able to fake it => We can validate a sender claim as being sender
In this process we authenticate the sender of the message as the person of
claim
2. authenticate the message received as actual:
It will be possible to authenticate the message received as original or not
=> reliability of the message
Em, M both received. We can verify Dm == M => original message was M
3. Only receiver can read the message:
As original message is encrypted with public key, hence private key is
required to retrieve original message from encrypted message.
Example :
Encryption: E(M, K[public]) => encrypted message(Em)
Decryption: D(Em, K[private]) => original message(M)
Benefit of these usage:
Message sender, content can be validated.
Sender can't deny the message as sent by him.
Example of public key cryptography: RSA
Task can be completed : mathametics behind RSA
Example :
S => sender
R => recipient
S has public key K[public]
S has private key K[private]
M => message to be send by S
S performs Encryption: E(M, K[private]) => encrypted message(Em)
S send Em to R
S send claim M to R
Who has send Em? => Identity of sender
R perform Decryption: D(Em, K[public]) => Decrypted message(Dm)
Dm == M => This ensure message was originally encrypted by K[private] =>
sender is Authenticated as => S
Dm != M => S is not the sender.
Did S actually send M? => reliability of message
Dm == M ==> M was original message send by S
Dm != M => M is not the original message
Why digital signature concept cameup:
A scenario where sender send the message along with signature. Here no further
claim is send.
The signature helps to satify => Authenticating origin of the message, adds
reliability of the message.
Reliability of the message is ensured as :
Receiver need to produce digest(Di) of the message(M). Di(M) == received
digest