Professional Documents
Culture Documents
Digital Signature Schemes
Digital Signature Schemes
Presented By:
Munaiza Matin
Sender Receiver
Input Output Input
data Forward Inverse
data data
Cryptographic Cryptographic
Transformation Transformation
Key Key
Key Key
Do not share the same key information and one key may be public
El Gamal
Signing
r = (gk mod p) mod q s = [k-1 (H(M) = xr)] mod q
Signature = (r, s)
Verifying
w = (s’)-1 mod q
u1 = [H(M’)w] mod q u2 = (r’)w mod q v = [(gu1yu2) mod p] mod q
Test: v = r’
The Digital
CSE 597E Fall 2001
Signature Algorithm (DSA)
PennState University 15
DSS
DSA
- M = message to be signed
- H(M) = hash of M using SHA
- M’, r’, s’ = received versions of M,
r, s
y = ax mod p
18
El Gamal Signature Scheme
Step 1 Randomly choose an integer k such that (k, p-1) = 1,
1<k<p-1, and k has not been used to sign a previous
message
Step 2 Calculate r = ak (mod p)
Step 3 Find s such that M = xr + ks (mod (p-1))
Step 4 Collect the pair (r, s) as the digital signature on the
message M