Project on Digital

Signature

Presented by:Nidhi Kant(10-csu-097)

Poonam Goel(10-csu-105)
Priya Ahuja(10-csu-110)
Project Guide: Ms. Neha
Sahu

Contents of the project:

Process of Digital Signature
Signed Messages
Literature Survey
Proposed System
Algorithms Used
Screenshots
Future Scope
Bibliography

Process of Digital
Signature
Key Generation
Random Numbers
RSA Key Pair [Private/Public Key]

Digital Signature
Generate Message Digest [SHA1]
Encrypting Digest using Private
Key [Signatures]
Attaching the Signatures to the
message.

Verification of Signatures
Run the test for Authentication,
Integrity and Non repudiation.

Signed Messages
Calculated
Calculated
Hash
Hash

Message
Message
Message
Message
++
signature
signature
Hash
Hash

Sent through Internet

Message
Message
++
Signature
Signature
COMPARE
COMPARE

Sign
e
Mess d
age

SIGN
SIGNhash
hash
With
Senders
With Senders
Private
Privatekey
key

Sender

if

Hash
Hash

Receiver

Decrypt
Decrypt
Signature
Signature
With
WithSenders
Senders
Public
PublicKey
Key

OK
Signatur
es
verified

Literature
Survey

Research Paper 1
Ravi Shankar Dhakar, Amit Kumar Gupta, Prashant
Sharma Modified RSA Encryption Algorithm
(MREA), 2012 Second International Conference
on Advanced Computing & Communication
Technologies
Performance:
MREA increases the complexity but security is
increased manifold.

Conclusion:
MREA is secure compared to RSA as it is based on
factoring problem as well as decisional composite
assumptions

Research Paper 2
B R Ambedkar, Ashwani Gupta, Pratiksha Gautam, SS
Bedi An Efficient Method to Factorize the RSA Public
Key Encryption, 2011 International Conference on
Communication Systems and Network Technologies
Performance:
Elapsed time for prime factorization are decreasing as
compare to the Fermat and trial division method.
Conclusion:
If we find prime factor of RSA Modulo N, then we can
generate private key and decrypt to the secret
message. Also elapsed time for prime factorization are
decreasing as compare to the Fermat and trial division
method

Research Paper 3
Kashif Latif, Kashif Latif, Arshad Aziz High
Throughput Hardware Implementation of Secure
Hash Algorithm (SHA-3) Finalist: BLAKE, 2011
Frontiers of Information Technology
Performance: Most of previously reported results
are for 10 rounds of the algorithm. BLAKE-256 has
been tweaked from 10 to 14 rounds.
Conclusion: this paper represented the
implementation in terms of area, throughput and
throughput per area and compared it with
previously reported implementation results.
Results achieved in this work are exceeding the
performance for implementations reported so far.

PROPOSED SYSTEM

Concepts

A 1024 bits number is a very big number much

bigger than the total number of electrons in whole
world.
Trillions of Trillions of pairs of numbers exist in this
range with each pair having following property

A message encrypted with one element of the

pair can be decrypted ONLY by the other element
of the same pair
Two numbers of a pair are called keys, the Public
Key & the Private Key. User himself generates his
own key pair on his computer
Any message irrespective of its length can be
compressed or abridged uniquely into a smaller
length message called the Digest or the Hash.
Smallest change in the message will change the
Hash value

Digital Signatures
I agree

efcc61c1c03db8d8ea8569545c073c814a0ed755
My place of birth is at Gwalior.

fe1188eecd44ee23e13c4b6655edc8cd5cdb6f25
I am 62 years old.

0e6d7d56c4520756f59235b6ae981cdb5f9820a0
I am an Engineer.

ea0ae29b3b2c20fc018aaca45c3746a057b893e7
I am a Engineer.

01f1d8abd9c2e6130870842055d97d315dff1ea3
These are digital signatures of same person on different documents

Digital Signatures are numbers

They are document content dependent

ENCRYPTION

DECRYPTION

Message 1

Encrypted Message 1

Encrypted Message 1

Message 1

Central to the growth of e-commerce and egovernance is the issue of trust in electronic
environment.

9a46894335be49f0b9cab28d755aaa9cd
98571b275bbb0adb405e6931e856ca3e
5e569edd135285482

9a46894335be49f0b9cab28d755aaa9cd985
71b275bbb0adb405e6931e856ca3e5e569ed
d135285482

Central to the growth of e-commerce and egovernance is the issue of trust in electronic
environment.

Message 2

Same Key

SYMMETRIC

The Internet knows no geographical boundaries.

It has redefined time and space. Advances in
computer and telecommunication technologies
have led to the explosive growth of the Internet.
This in turn is affecting the methods of
communication,
work,
study,
education,
interaction, leisure, health, governance, trade
and commerce.

Encrypted Message 2

a520eecb61a770f947ca856cd675463f1c95a
9a2b8d4e6a71f80830c87f5715f5f59334978
dd7e97da0707b48a1138d77ced56feba2b46
7c398683c7dbeb86b854f120606a7ae1ed93
4f5703672adab0d7be66dccde1a763c736cb
9001d0731d541106f50bb7e54240c40ba780
[Keys of a pair Public and Private]
b7a553bea570b99c9ab3df13d75f8ccfdddea
af3a749fd1411

Different Keys

ASYMMETRIC
[PKI]

Encrypted Message 2

a520eecb61a770f947ca856cd675463f1
c95a9a2b8d4e6a71f80830c87f5715f5f5
9334978dd7e97da0707b48a1138d77ce
d56feba2b467c398683c7dbeb86b854f1
20606a7ae1ed934f5703672adab0d7be
66dccde1a763c736cb9001d0731d5411
06f50bb7e54240c40ba780b7a553bea5
70b99c9ab3df13d75f8ccfdddeaaf3a749
fd1411

Message 2

The Internet knows no geographical

boundaries. It has redefined time and space.
Advances
in
computer
and
telecommunication technologies have led to
the explosive growth of the Internet. This in
turn
is
affecting
the
methods
of
communication, work, study, education,
interaction, leisure, health, governance,
trade and commerce.

Encryption
Caesar Cipher
The shift is linear and equidistributed

I agree

lcdjuhh

i+3=l
Space=c [+3]

Key Cipher
The shift is linear (cyclic)

k.n.gupta 62
k+2=m
(dot)=e [+6]
n=w [+9]

269

3 changes

Char
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
0
1
2
3
4
5
6
7
8
9
. (Dot)
Space

mewam3rzjba

1
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
0
1
2
3
4
5
6
7
8
9
.
a

2
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
0
1
2
3
4
5
6
7
8
9
.
a
b

3
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
0
1
2
3
4
5
6
7
8
9
.

4
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
0
1
2
3
4
5
6
7
8
9
.

a
a b
b c
c d

5
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
0
1
2
3
4
5
6
7
8
9
.
a
b
c
d
e

6
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
0
1
2
3
4
5
6
7
8
9
.
a
b
c
d
e
f

7
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
0
1
2
3
4
5
6
7
8
9
.
a
b
c
d
e
f
g

8
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
0
1
2
3
4
5
6
7
8
9
.
a
b
c
d
e
f
g
h

9
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
0
1
2
3
4
5
6
7
8
9
.
a
b
c
d
e
f
g
h
i

RSA Key pair

(including Algorithm identifier)

[2048 bit]

Private Key
3082
06d3
d854
463d
b35f
cf42
6c89
b4f8
04e3

010a
0d59
0aa5
1ef0
5a22
b2f0
2aca
cdf9
459e

0282
bd3e
2586
b92c
97ec
1cd5
da33
f400
a146

0101
c1ce
94ed
345f
199b
5ffb
1379
84b6
2840

00b1
4367
6356
8c7c
c105
6bed
c255
5742
8102

d311
018a
ff70
4c08
68fd
6856
8ced
859d
0301

e079
21a8
6ca3
299d
e6b7
7b39
9cbb
32a8
0001

5543
efbc
a119
4055
a991
2c72
f2cb
f92a

0708
ccd0
d278
eb3c
942c
38b0
5b10
54fb

4ccb
a2cc
be68
7d83
e478
ee93
f82e
ff78

0542
b055
2a44
deb5
4824
a9d3
6135
41bc

00e2
9653
5e2f
f0f7
1a25
7b77
c629
bd71

0d83
8466
cfcc
8a83
193a
3ceb
4c2a
28f4

Public Key
3082
0673
d8b4
463d
b35f
cf42
6c89
b4f8
04de

01e4
0d59
0aa5
1df0
5a22
b250
2aca
cdf9
45de

f267
bf3e
2586
b92c
97ec
1cd5
da33
f400
af46

0142
c1ce
94ed
345f
199b
5ffb
1379
84b6
2240

0f61
4367
6356
8c7c
c105
6bed
c255
5742
8410

dd12
012a
ff70
4c08
68fd
6856
8ced
859d
02f1

e089
11a8
6ca3
299d
e6b7
7b39
9cbb
32a8
0001

5547
efbc
a119
4055
a991
2c72
f2cb
f92a

0f08
ccd0
d278
eb3c
942c
38b0
5b10
54fb

4ccb
a2cc
be68
7d83
e478
ee93
f82e
ff78

0542
b055
2a44
deb5
4824
a9d3
6135
41bc

00e2
9653
5e2f
f0f7
1a25
7b77
c629
bd71

0d83
8466
cfcc
8a83
193a
3ceb
4c2a
28f4

463d
0500
185e
0ea1
eb95
7103
d02a
bb90

e493
da44
47bc
4cb4
9c39
a938
63d1
bcff

bab6
4980
3ab1
3aa5
0a8a
4a16
6559
9634

463d
0500
185e
0ea1
eb95
7103
d02a
bb90

e493
da44
47bc
4cb4
9c39
a938
63d1
bcff

bab6
4980
3ab1
3aa5
0a8a
4a16
6559
9634

ALGORITHMS USED

Our Approach to RSA

Algorithm
1. Let N = P*Q.
2. Compute X =ceil (sqrt (N)).
3. Compute Y =sqrt (X2 N).
4. If Y is integer .
5. Compute P =X Y and Q =X + Y.
Stop.
6. Otherwise X X +1, X+ 2,. , X + 2*X, ,X+
N.
7. Continue step 3 to 6, till Y is integer.

Another Approach to RSA

Algorithm
Key Generation Algorithm:
1. Choose four large prime numbers p, q, r and s randomly
and independently of each other. All primes should be of
equivalent length.
2. Compute n = p x q, m= r x s, _ =(p-1) x (q-1) and _ =(r1) x (s-1).
3. Choose an integer e, 1 < e < _, such that gcd (e, _) = 1.
4. Compute the secret exponent d, 1 < d < _, such that e x
d mod _=1.
5. Select an integer g=m+1.
6.Compute the modular multiplicative inverse: _ = _ -1
mod m.
7. The public (encryption) key is (n, m, g, e).
8. The private (decryption) key is (d, _, _).

Another Approach to RSA

Algorithm(Continued)
Encryption:
i. Let m be a message to be encrypted where 0<
mesg < n.
ii. Select random r where r < m.
iii. Compute ciphertext as: c=gmesg^e mod n x rm
mod m2.
Decryption
i. Compute message: m = (((c_ mod m2 1)/ m) x _
mod m)d mod n.

SHA Algorithm
A hash value of plaintext is generated by a hash
function of the form
H=h(M)
The output of compression function is a new chain
Value h=h0..=h7 . We can write compression function
as
h=compress(h,m,s,t)
To calculate hash of a message greater than 512-bits
(16 32-bit words), BLAKE-256 compression function is
used iteratively as follows:
h0IV
For i=0,..,N-1
h (i+1) compress(hi ,mi ,s, li)
Return hN

SHA Algorithm (Continued)

The throughput TP of a given design can be calculated by:

TP=Blocksize/Thash
Where
T hash=T. N clk

FUTURE SCOPE

Digital Encryption of data is useful during eHealth Programs.

Digital Signature in Global and National

Commerce Act has opened a new frontier

Use of biometric information in digital signature

instead of using the smart cards or passwords
would eliminate the chances of any tampering.

Bibliography
http://
ieeexplore.ieee.org/xpl/abstractAuthors.jsp?arnumber
=5966415
http://ieeexplore.ieee.org/xpl/login.jsp?tp=&
arnumber=6137143&url=http%3A%2F%2Fieeexplore.ieee
.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D6137143
1)http://ieeexplore.ieee.org/xpl/articleDetails.jsp?t
p=&arnumber=6021216&queryText%3DRSA+Algorithm
http
://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arn
umber=4659731&queryText%3DRSA+Algorithm
http
://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arn
umber=6516389&queryText%3DRSA+Algorithm
http
://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnu
mber=6027423&queryText%3Ddigital+signature
http