Information System Security
SWE · Final · Fall 25
Read the questions as text
Read off the PDF by AI, so it may have mistakes. The PDF is the original.
Daffodil International University
Department of Software Engineering
Faculty of Science & Information Technology
Final Examination, Fall 2025
Course Code: SE332/SWE322; Course Title: Information System Security/Software Security
Sections & Teachers: (MBH-A, B), (AE-C), (TM-D, E), (AE-F, G, H), (DDK-I)
Time: 2 Hour
Marks: 40
Answer ALL Questions
[The figures in the right margin indicate the full marks and corresponding course outcomes. All portions of each question must be answered sequentially.]
1.
Input value:
[Figure: A table showing Li-1 and Ri-1 binary values]
Appendix A: (Only index is given, not value)
[Figure: A table of Appendix A indices]
Appendix B: (Only index is given, not value)
[Figure: A table of Appendix B indices]
NB: Appendix A for Expansion Permutation and Appendix B for 32 bit Permutation of the output of S-Box.
-Answer all the questions with proper justification.
a) Summarize the issues associated with stream cipher used in Classical cryptographic algorithms and also demonstrate the process of Single Round of DES proposed by NIST. [Marks-5]
b) You are given the initial value of 32 bit of Ri-1, Use Appendix A to get the index number of 32 bit value of Ri-1 to determine the value of 48 bit of Expansion permutation. [Marks-4]
c) Consider the result of 1(b) as an input for your S-box to verify that the output of your S-box is 32-bit when the input is 48 bit.
Note: Use Appendix C for the calculation. [Marks-5]
d) Determine the value of Li and Ri. To select the process, the diagram that you presented in the answer of 1(a), will help you.
NOTE: While using the generated output of S-box to get the value of (Li OR Ri which one needed), apply Appendix B to get the permutation of that 32 bit. [Marks-7]
2.
a) Evaluate the AES encryption process when you have 128 bit of plain text, 192 bit of key size and round key size 4 in words. [Marks-4]
b) Determine the key value of the 3rd round key from the given value of the 2nd round key using AES key expansion process.
Note: Use Appendix D for the calculation.
[Figure: A 4x4 matrix of hex values]
[Marks-5]
3.
RSA: RSA (Rivest-Shamir-Adleman) is one of the most widely used public key cryptographic algorithms. It relies on the mathematical properties of large prime numbers and modular arithmetic. RSA is commonly used for secure data transmission, digital signatures, and key exchange in various cryptographic protocols.
Digital signature: is a cryptographic technique used to verify the authenticity and integrity of digital messages or documents. It involves the use of a mathematical algorithm to generate a unique code, or signature, based on the content of the message and the sender's private key. This signature can then be verified by anyone with access to the sender's public key, ensuring that the message has not been altered and confirming the identity of the sender. Digital signatures are widely used in secure communications, online transactions, and legal documents to provide assurance and security in the digital world.
-Answer all the questions with proper justification.
a) Using the prime numbers p=17 and q=11, and a public key of 19, identify the private key to verify the suitability of your private key and public keys when your message is 2. [Marks-5]
b) Illustrate the working procedure of DSA based digital signature to validate how this process ensures verification and integrity of a message and the owner of the message. Also explain the functional operations of this process. [Marks-5]
Appendix C:
[Figure: Appendix C S-box tables]
Appendix D:
[Figure: Appendix D AES S-box table]