DIGITAL SIGNATURE

-Guide: Ms. Bindu Kiran A

What is a Digital Signature

A digital signature or digital signature scheme is a mathematical scheme for demonstrating the authenticity of a digital message or document. A valid digital signature gives a recipient reason to believe that the message was created by a known sender such that they cannot deny sending it

 Digital signature is a type of Cryptography. It helps in keeping communications private. There are two types of Cryptography I. Secret key or Symmetric Cryptography II. Public key or Asymmetric Cryptography

Secret key or Symmetric Cryptography

In Symmetric Cryptography the sender and receiver of a message know and use the same secret key to encrypt the message, and the receiver uses same key to decrypt the message.

Public key or Asymmetric Cryptography

Asymmetric (or public key) Cryptography involves two related keys. 1. One of which only the owner knows the private key. 2. The other which anyone can know the public key.

Asymmetric Cryptography
We use Asymmetric Cryptography for the implementation of Digital Signatures because of the following advantages. 1. Only one party needs to know the private key. 2. The knowledge of the public key by a third party does not compromise security of message transmission.

 A digital signature scheme typically consists of three algorithms: 1. Key Generation algorithm. 2. Signing algorithm. 3. Signature verifying algorithm.

Digital signature algorithms

RSA-based signature schemes, such as RSAPSS DSA and its elliptic curve variant ECDSA ElGamal signature scheme PointchevalStern signature algorithm Rabin signature algorithm Pairing-based schemes such as BLS Undeniable signatures

RSA-based signature scheme

Ron Rivest, Adi Shamir, and Leonard Adleman developed the RSA scheme. The following are the three main steps in RSA algorithm 1. Key Generation 2. Encryption 3. Decryption

Key Generation
RSA involves a public key and a private key. The public key can be known to everyone and is used for encrypting messages. Messages encrypted with the public key can only be decrypted using the private key.

Encryption
Person A transmits his/her public key to person B, keeping his/her private key secret. If person B wants to send a message to person A, he now encrypts the message to be sent to person A using the public key of person A.

Decryption
The message encrypted using the public key of person A by person B is received by person A. This message is then decrypted using the private key of the person A. The message cannot be accessed by anyone other than the person having the private key.

 Consider the following example, which shows the working of the RSA algorithm.

Key Generation
Select two large prime numbers p, q Compute n=pq v = (p-1) (q-1) Select small odd integer k relatively prime to v gcd(k, v) = 1 Compute d such that (d k)%v = (k d)%v = 1 Public key is (k, n) Private key is (d, n) example p = 11 q = 29 n = 319 v = 280 k=3 d = 187 public key (3, 319) private key (187, 319)

Encryption
Person A and person B would like to communicate in private Person A uses RSA algorithm to generate her public and private keys
person A makes key (k, n) publicly available to person B and anyone else wanting to send her private messages

Person B uses person As public key (k, n) to encrypt message M:

compute E(M) =(Mk)%n person B sends encrypted message E(M) to person

Decryption
Person A receives E(M) and uses private key (d, n) to decrypt it:
compute D(M) = (E(M)d)%n decrypted message D(M) is original message M

THANK YOU