Digital Signature

Outline

• Introduction
• Working
• Common Uses
• Issues and Way forward
 Digital Signature

• Digital Information Interchange

• Cryptography
• Asymmetric Encryption – RSA
• Key Pair and Digital Signature
• Digital Signature Certificate and
PKI
 Public Key Infrastructure
• Controller of Certifying Authorities
(CCA) – Legal entity mandated to be
final repository of trust relations
• Certifying Authority (CA) – Authorised
agency for issuing Digital signature
certificates thus linking physical
identity to key pair
• Key Pair – Private key + Public Key
Private Key to be kept secret and
Public Key is available to all
Private Key to Sign; Public key to verify
 Digital Signature Process
Message
Message
Transmit
Hash Concatenate & Split
Receive
Hash
Digital Signature Digital Signature

Hash Verify

Public Key
Private Key

Recipient
Originator
 Underlying Algorithm
• RSA Algorithm – Key Generation
• Choose 2 large Prime numbers ‘p’ & ‘q’
• Define ‘n’ = pXq
• Define ‘z’ =(p-1) X (q-1) – Euler’s Totient (ɸ)
• Choose ‘e’ (1<e<z) s.t : e and z are
coprime – gcd(e,z) = 1
• Compute ‘d’ s.t. (eXd)mod z = 1
• Private Key (d,n)
Key Pair
• Public Key (e,n)
 RSA Algorithm - Signing
• Hash – ‘h’ ; Signature – ‘s’
• Signing (Private Key – d,n)
s = h d mod n
• Verifying (Public Key – e,n)
h = s e mod n
 Advantages of Digital Signature

• Integrity
• Authenticity
• Non-Repudiation
• Time stamping
 Common Uses

• Secure Mail
• Online Contracts
• Medical Records
• Secure Communication (TLS)
• Encryption
 Issues and Way Forward

• Government policies – Spread of DSC

• Processing Power – Factorising easier
• Elliptical curve cryptography
• FIPS-186 revision
Thank You!
 Example
• Let p = 5 and q = 13
• n = p X q = 5 X 13 = 65
• z = (p-1) X (q-1) = 4 X 12 = 48
• Let e = 43 (1<e<z, gcd(e,z)=1)
• To get d = 19 (1 = (e X d)mod z)
• Let Hash h = 2
• S = 2 19 mod 65 = 63 – Signature
• H = 63 43 mod 65 = 2 – Verified