Professional Documents
Culture Documents
Cryptography and Network Security
Cryptography and Network Security
Cryptography and Network Security
Presented By
Presented By
Md.
Md.Golam
GolamMostafa
Mostafa
ID:173311037
ID:173311037
Department
DepartmentofofComputer
ComputerScience
Science&&Engineering
Engineering
Varendra
VarendraUniversity
University
RSA Algorithm Math
9.2 Perform encryption and decryption using RSA algorithm where
5 * 5 = 1 mod 24
Here: d = 5
Comparison between public key authority and public key
certificate
Public key authority Public key certificate
Key back is not possible as the authority Key back, it is possible as all keys are
never stores the keys it only sends to the stores in the certification authority.
corresponding request.
Key pairs are required as there is double There is no need of pair of key as only
encryption first with the authority and one key is require to encrypt the
second by initiator or responder which certificate which reduces the complexity.
increases the complexity.
Not possible as no record saved. Possible as each and every key is store
with the certificate.
Comparison between cipher feedback and output
feedback
Cipher Feedback
Cipher Feedback (CFB) mode is very similar to CBC; the primary difference is
CFB is a stream mode. It uses feedback (the name for chaining when used in
stream modes) to destroy patterns. Like CBC, CFB uses an initialization vector
and destroys patterns, and errors propagate.
Output Feedback
Output Feedback (OFB) mode differs from CFB in the way feedback is
accomplished. CFB uses the previous ciphertext for feedback. The previous
ciphertext is the subkey XORed to the plaintext. OFB uses the subkey before it
is XORed to the plaintext. Since the subkey is not affected by encryption
errors, errors will not propagate.
Man-in-the-Middle Attack
USER A
XA
YA USER B XB
KAD1=* YB
KBD2=#
KAD1= YD1^XA
K(BD2)= YD2^XB
XD1 XD2
YD1 D YD2
KAD1=* KBD2=#
KBD2= YB^XD2
KAD1= YA^XD1
Diffie-Hellman key exchange technique
Users A and B use the Diffie-Hellman key exchange technique with a
common prime q = 71 and a primitive root .
a. If user A has private key ,what is A’s public key ?
b. b. If user B has private key ,what is B’s public key ?
c. c. What is the shared secret key?
SOLUTION:
GIVEN THAT, AGREE ON PRIME NUMBER Q=71,
Α=7,XA=5,XB=12.
COMPUTE PUBLIC KEYS:
5
A’S PUBLIC KEY : YA = 7 MOD 71 = 51
12
B’S PUBLIC KEY :YB = 7 MOD 71 = 4
X
WE KNOW THAT : YA = Α A MOD Q
IF 2^9 MOD 11 = XA THEN
PRIVATE KEY: XA= 6