TTIIT
UTEO Bharatiya Vidya Bhavan's
L
INS F
SARDAR PATEL INSTITUTE OF TECHNOLOGY
OLOGYSARDA (Autonomous Institute Affiliated to University of Mumbai)
Munshi Nagar, Andheri (W), Mumbai 400 058. -
End Semester Examination
Dec. 2024
Max. Marks: 100 Duration: 180 Min.
Class: Final Year BTech(CE) Semester: VII
Course Code: CS401 Program: BTech(CE)
Name of the Course: Cryptography and System Security
Instruction:
1) All questions are compulsory.
2) Draw neat diagrams and write equations wherever necessary.
3) Assume suitable data if necessary but justify the same.
Course Outcomes: At the end of the course, student will be able to:
(1) Describe the different types of the cryptographic algorithms to secure information.
(2) Apply different cryptographic techniques to solve security-related problems
(3) Create a message digest from data to authenticate authorized user
(4) Use system security practices
Max. CO-
Q. No. Question
Marks BL
How many possible keys does the Playfair cipher have? Ignore the fact that
some keys might produce identical encryption results. Express your answer as
CO1-
Q. 1A an approximate power of 2 with a detailed justification. Now take into account 10
BL5
the fact that some Playfair keys produce the same encryption results. How many
effectively unique keys does the Playfair cipher have? Justify the same.
a) Encrypt the message "meet me at the usual place at ten rather than eight
41
oclock" using the Hill cipher with the key .Show your calculations and CO1-
Q. 1B the result.
10
BL3
b) Show the calculations for the corresponding decryption of the ciphertext to
recover the original plaintext.
This problem illustratesthe point that the Diffie-Hellman protocol is not
secure without the step where you take the modulus; i.e. the "Indiscrete
Log Problem" is not a hard problem! You are Eve, and have captured
Alice and Bob and imprisoned them. You overhear the following diaiog.
Bob: Oh, let's not bother with the prime in the Diffie-Hellman protocol,
it will make things easier. CO1-
Q. 2A 10
Alice: Okay, but we still need a base to raise things to. How about g 3? = BL3
Bob: All right, then my result is 27.
Alice: And mine is 243.
What is Bob's secret XB and Alice's secret XA? What is their secret
combined key? (Don't forget to show your work/calculations in detail.)
In RSA system, the public key of a given user is e
an 31, n 3599.
= =
What is the private key of this user? Hint: First use trial and error to CO2-
Q. 2B 10
determine p and q; then use the extended Euclidean algorithm to find the BL3
multiplicative inverse of 31 modulo ф(n).
Discuss Kerberos protocol and show all message exchanges of three
servers in Kerberos Protocol. Explain how the Kerberos protocol ensures CO2,3-
Q. 3A 10
BL4
secure authentication in a distributed system. What are the roles of the
Ticket Granting Ticket (TGT) and session keys in the process?
INSTITUTEOF Bharatiya Vidya Bhavan's
SARDAR PATEL INSTITUTE OF TECHNOLOGY
DAR (Autonomous Institute Affiliated to University of Mumbai)
OGYSAR
OLO
Munshi Nagar, Andheri (W), Mumbai 400 058. –
What characteristics are needed in a secure hash function? Show each
characteristic formally in terms hash function H, hash value H(x) for
input x etc. Discuss at least five characteristic in detail.
Q. 3B OR 10
CO3,4-
BL4
Show the message digest generation using SHA-512 in detail. Compare
different version of Secure Hash Algorithm (SHA) in terms of SHA
parameters.
a) Bob receives a PGP message. How can he find out the type of the packet if
the tag value is 8, 9 and 2. Disucss each packet in detail. CO2,3,
Q. 4A b) In PGP,
10
e-mail message use two different public-key algorithms for
can an 4-BL3
encryption and signing? How is defined in a message sent from Alice to Bob?
a) What are three benefits that can be provided by an intrusion detection
Q. 4B
system? CO4-
10
b) What is the difference between rule-based anomaly detection and rule- BL2
based penetration identification?
Draw a diagram and show actual ISAKMP packets that are exchanged
between an initiator and a responder using the preshared-key method in CO3,4-
Q. 5A 10
the main mode. Use at least two proposal packets with at least two BL3
transform packets for each proposal.
What are the length of the key-material (client and server authentication
keys, client and server encryption keys, client and server IV) and the
number of repeated modules needed, if the cipher suites are as follows:
a) SSL_RSA_WITH_NULL_MDS
CO3,4-
Q. 5B b) SSL_RSA_WITH_NULL_SHA 10
BL3
c) TLS RSA WITH DES CBC SHA
d) TLS_RSA_WITH_3DES_EDE_CBC_SHA
e) TLS_DHE_RSA_WITH_DES_CBC_SHA
f) TLS_DH_RSA_WITH_3DES_EDE_CBC SHA