Computer

Networks
PRES EN T ED BY N AVAN EET H K RI S HN A AP
Signing the Digest
❖ In computer networking, signing the digest is a technique used to validate the authenticity
and integrity of a message

❖ In a digital signature system, our messages are normally long, but we have to use public
keys.

❖ It is an efficient way to sign a message when the message is long. In this method, the
sender creates a miniature version (digest) of the document and then signs it. The receiver
checks the signature of the miniature version

❖.The sender can sign the message digest, and the receiver can verify the message digest.
Signing the Digest
❖The hash function is used to create a digest of the message. The two most common hash
functions used are MD5 (Message Digest 5) and SHA-1 (Secure Hash Algorithm 1).
Services of digital signature
❖Message Integrity
In case an attacker has access to the data and modifies it, the digital signature verification at receiver
end fails. The hash of modified data and the output provided by the verification algorithm will not match.
Hence, receiver can safely deny the message assuming that data integrity has been breached.
❖ Message Authentication
When the verifier validates the digital signature using public key of a sender, he is assured that
signature has been created only by sender who possess the corresponding secret private key and no
one else.
❖ Message Non repudiation
Since it is assumed that only the signer has the knowledge of the signature key, he can only create
unique signature on a given data. Thus the receiver can present data and the digital signature to a third
party as evidence if any dispute arises in the future.
 RSA DigitalSignature Scheme
❖ RSA is an asymmetric cryptography algorithm.

❖The RSA idea is based on the fact that it is difficult to factorize a large integer.

❖It works with two keys, Public and private keys.

❖The public key consist of two numbers where, one number is the multiplication of two large prime
numbers.

❖The private key is also derived from the same two prime numbers. so, if somebody can factorize the
large number,the private key is compromized,.

❖So,The size of the key increases the key strength.

❖A typical RSA key can be 1024 or 2048 bis long,

RSA DigitalSignature Scheme
Mechanism
❖Select two prime numbers.
❖The public key consist of two parts n and e.
❖Let us calculate the first part
n=P*Q
=53*59=3127
❖To calculate the second part we need a small exponent ‘e’.
❖But ‘e’ must be an integer and not a factor of ϕ(n). 1<e<ϕ(n).
RSA DigitalSignature Scheme
❖So, Let us take ‘e’=3
❖Now our public key is made of n & e.
❖Generate Private key
we need to calculate ϕ(n).
ϕ(n)=(P-1)*(Q-1)

=(53-1)*(59-1)
=3016
Now calculate private key ‘d’
RSA DigitalSignature Scheme
d=(k* ϕ(n)+1)

for k=2,
d=2011

❖Example for Encrypting and Decrypting data using RSA

Public key(n=3127 and e=3)
private key=2011

word to Encrypt=HI
RSA DigitalSignature Scheme
❖Convert letters to integers H=8 and I=9.

❖Encrypt data C=89^e mod n

=89^3 mod 1327

The encypted data C=1394

❖Decrypt 1394

Decrypt data=C^d mod n

=1394^2011 mod 3127=89

8=H and 9=I