Scribd
Upload
83 views13 pages

Digital Signature Schemes: Maria Alabbadi

This document provides an overview of digital signature schemes, including the need for authentication, digital signature concepts and standards, and descriptions of specific digital signature algorithms like RSA, ElGamal, Rabin, and elliptic curve. It explains how public/private key pairs are used to generate and verify digital signatures to authenticate the sender of a message.

Uploaded by

MARIA AL-ABBADI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
83 views13 pages

Digital Signature Schemes: Maria Alabbadi

This document provides an overview of digital signature schemes, including the need for authentication, digital signature concepts and standards, and descriptions of specific digital signature algorithms like RSA, ElGamal, Rabin, and elliptic curve. It explains how public/private key pairs are used to generate and verify digital signatures to authenticate the sender of a message.

Uploaded by

MARIA AL-ABBADI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13

Digital Signature Schemes

Maria Alabbadi
Outline
• Authentication
• Digital signature concepts and standards
• RSA digital signature scheme
• ElGamal signature scheme 
• Signature with redundancy function (Rabin signature
algorithm)
• elliptic curve digital signature scheme
• Knapsack Digital signature (shamir signature
knapsack)
Need for Authentication
• Authentication Problem:
How can recipient be sure that message was sent by
particular person?

“Give Darth a $10,000 raise


-- Alice”
E
Masquerading as Alice

3
Authentication
• Terminology:
– Claimant: Entity desiring to prove their
identity
(real or fraudulent )

– Verifier: Entity checking identity of claimant

4
Digital Signatures
• Based on some signing algorithm
– Algorithm applied to message (like message digest)
– Message and signature sent to recipient
– Recipient uses related algorithm to verify signature
• Must involve “secret knowledge” known only to signer
– Otherwise, adversary could “forge” signature

“I can’t create this”

5
Public Keys and Digital Signatures
• Signing algorithm involves private key
– Public/private key pair generated by sender
• Opposite of public key encryption
– Sender stores private key, gives public key to recipient
• Private key used to sign message
• Public key used to verify signature

6
Digital Signatures and Confidentiality
• Sender:
– Signs message with sender private key
– Encrypts message with recipient public key
Authentication
• Recipient Confidentiality
– Decrypts message with recipient private key
– Verifies signature with sender public key

7
Digital Signature Standard
• NIST standard (FIPS 186)
• Algorithms:
– SHA-512 hashing
– Schnorr public key encryption scheme (similar to ElGamal)

8
DSS Components
• Global public key components (PUG)
– p : Large prime (between 512 and 1024 bits)
– q : prime divisor of p -1 (approx. 160 bits)
– g = h(p-1)/q mod p
where h is some integer < p -1 such that
h(p-1)/q mod p > 1
• Sender’s private key (PRa)
– Random integer < q
• Sender’s public key (PUa)
– PUa = gPRa mod p
9
Signing a Message
• Generate random one-time key k < q
• Compute components of message:
– r = (gk mod p) mod q
– s = [k -1 (H(M) + PUa)] mod q
• Signature = (r, s)

• Efficiency: only modular


exponentiation is gk mod p
which can be computed
in advance 10
Verifying a Message
• w = s -1 mod q
• u1 = [H(M) w] mod q
• u2 = (r w) mod q
• v = [(gu1 PUau2) mod p) mod q

• Verified if v = r

11
RSA Digital Signature Scheme
• Encryption/Decryption:
– Encryption by sender: C = Pe mod n
– Decryption by recipient: P = Cd mod n = Pde mod n

• Digital signature just reverses order


– Key pair generated in same way
• Public key: n, e
• Private key: d
– Signature by sender: S = Md mod n
– Verification by recipient: M = Se mod n = Mde mod n
– Works since d  e = e  d
12
RSA Digital Signature Scheme
• Recipient has sender’s public key
• Sent message M and signature S generated from M
• Uses key to “decrypt” signature S and compare to M

13

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy