PROJECT PRESENTATION

ON
DIGITAL SIGNATURE


OBJECTIVES:
-Introduction
-Literature Review
-Problem Formulation
-Methodology
-Conclusion
-Software Used
-References

INTRODUCTION

A digital signature is a data string which

associates a message (in digital form)
with some originating entity.
A digital signature generation algorithm
(or signature generation algorithm) is a
method for producing a digital signature.
A digital signature of a message is a
number dependent on some secret
known only to the signer, and,
additionally, on the content of the
message being signed.

LITERATURE REVIEW:
Cryptography:-

It provides the
mechanisms necessary to provide
accountability, accuracy and
confidentiality in inherently public
communication mediums such as the
Internet.
Internet as a trusted medium for
communication and commerce has
made cryptography an essential
component of modern information
systems.

Cryptography can be classified into

(1) Symmetric Cryptography.
(2) Asymmetric Cryptography.
Symmetric cryptography:

two types:

(i) Same key for encryption and decryption

(ii) Key distribution problem

Asymmetric cryptography:
(i)Mathematically related key pairs for

encryption and decryption

(ii) Public and private keys

How Asymmetric key is used in

Digital Signature
MESSAGE BODY

SIGNATURE

(Digest signed with senders private

keyVerified with public key
Formulation)
SERVER URL

SERVER
PUBLIC KEY

SIGNATURE

(A certificate is made up of a server URL

and a server public key)

PROBLEM FORMULATION
In

most cases authentication is

through a combination of
potentially strong passwords and
users IDs.
Some systems also limit the
number of login attempts as a
security measure.

MTHODOLOGY
RSA Algorithm
RSA is a public key algorithm invented in 1977
by Ron Rivest, Adi Shamir and Leonard
Adleman (RSA)

Supports Encryption and Digital Signatures

Most widely used public key algorithm

Gets

its security from integer factorization

problem
Relatively easy to understand and implement

CONCLUSION

It Identifies the subscriber verified

by certification authority
Contains subscribers public key
And Identifies the certification
authority
Digitally signed by certification
authority
may include a reliance

RESULT
By

RSA algorithm the signature is safely transferd

Find two large primes: p & q

Calculate n = pq
Calculate e & d such that ed = 1 (mod (p-1)(q-1))
(e,n) can be published as your public key
(d,n) can be kept as your secret key
It can be shown that Med (mod n) = M (mod n)
To encrypt a message M:
C = Me (mod n)

To decrypt:
M = Cd (mod n) since Cd = Med

RSA Example
Example of RSA with small numbers:
p = 47, q = 71, compute n = pq = 3337
Compute phi = 46 * 70 = 3220
Let e be 79, compute d = 79-1 mod 3220
= 1019
Public key is n and e, private key d, discard
p and q.
Encrypt message m = 688, 68879 mod
3337 = 1570 = c.
Decrypt message c = 1570, 15701019 mod
3337 = 688 = m.

RSA Signature Generation

Signature of a message m is a
straightforward modular exponentiation
using the hash of the message and the
private key. The signature s can be
obtained by:

s = hash(m)d (mod n)
A common hash algorithm used is SHA-1

RSA Signature Verification

To verify a signature s for message m,
the signature must first be decrypted
using the authors public key (n, e). The
hash h is thus obtained by
h = se (mod n)
If h matches hash (m), then the
signature is valid the message was
signed by the author, and the message
has not been modified since signing

THANK YOU