Professional Documents
Culture Documents
Associate Professor,
(Project Guide)
College of Engineering,
College of Engineering,
ANDHRA UNIVERSITY.
ANDHRA UNIVERSITY.
By
A.Vasudeva Rao
Regd. No: 97036204
September 27, 2016
ABSTRACT
Aim of Project:
- provides security by providing
Confidentiality,
Authenticity and
integrity for the message to be sent to any system in
Network.
The security is terms of encryption, digital signature.
Confidentiality for the data is obtained by encrypting the data by
Algorithms DES and AES.
The digital signatures are a way of
providing
AuthenticityFleand
integrity to digital documents.
September 27, 2016
Security And Authentication
Overview of Project
Phase-1:
Data is encrypted by using DES and AES using secret key
The encrypted data is send to the destination and secret key
Phase-2:
The data is to be sent is digitally signed by DSA algorithm
September 27
September 27
64-bit plaintext
Initial permutation
Permuted key
K1
Round 1
Permuted key
Permuted key
Permuted key
K2
Round 2
K16
Round 16
32-bit swap
Inverse permute
64-bit ciphertext
September
27
transformation
Expansion permutation
S-Box Substitution
P-Box Permutation
XOR and Swap
September 27
September 27
September 27
September 27
September 27
10
September 27
11
September 27
12
September 27
13
DSA parameters
The DSA makes use of the following parameters:
1. p = a prime modulus, where 2L-1 < p < 2L for 512 = < L = <1024
and L a
multiple of 64
2. q = a prime divisor of p - 1, where 2159 < q < 2160
3. g = h(p-1)/q mod p, where h is any integer with 1 < h < p - 1 such
that
h(p-1)/q mod p > 1 (g has order q mod p)
4. x = a randomly or pseudo randomly generated integer with 0 < x <
q
5. y = gx mod p
6. k = a randomly or pseudo randomly generated integer with 0 < k <
q
September 27
14
Signature Generation
The signature of a message M is the pair of
numbers r and s computed according to the
equations below:
r = (gk mod p) mod q and
s = (k-1(SHA(M) + xr)) mod q.
September 27
15
Signature Verification
w
= (s1)-1 mod q
u1 = ((SHA(M1)w) mod q
u2 = ((r1)w) mod q
v = (((g)ul (y)u2) mod p) mod q.
If v = r the signature is said to be verified.
Otherwise , it is rejected
September 27
16
September 27
17
Working of SHA
Padding
Append
Length
Divide the input into 512 blocks
Initializing chaining variables
Process message in clocks
Output
September 27
18
CPU
Processor Speed
RAM
Hard Disk
:
:
:
:
September 27
PENTIUM-IV
2 GHZ
256MB
1 GB and above
19
Output Screens
September 27
20
September 27
21
CONCLUSION
It
September 27
22
September 27
23
BIBLOGRAPHY
BIBLOGRAPHY
1.Cryptography and Network Security
-William Stallings ,Third Edition ,
Prentice-Hall.
2.The Laws of Cryptography with JAVA Code
-Neal R.Wagner.
3.The Complete Reference JAVA2
-Herbert Schildt ,Fifth Edition,
TATA McGraw-Hill Edition.
4.Object-Oriented Software Engineering
Timothy C.Lethbridge, Robert Laganiere
TMH Publications
REFERENCES
http://en.wikipedia.org/
http://w3schools.com/
http://www.owasp.org/
September 27
24
Thanks
September 27
25