Cryptography Exam Questions PDF
Document Details
Uploaded by ConciseProtagonist
Tags
Summary
This document contains 42 questions on cryptography, covering topics like parity, entropy, block ciphers, and public key cryptography. The questions are suitable for an undergraduate-level course.
Full Transcript
Q1. Explain even & odd parity with using example.(4M) Q2. Formulate measure of information. Calculate the amt of info. Q3. Differentiate between entropy & conditional entropy. Q4. Explain 3 properties of entropy. Q5. Drawback of fixed dictionary coding. Q6. List 2 types of source & channel coding. Q...
Q1. Explain even & odd parity with using example.(4M) Q2. Formulate measure of information. Calculate the amt of info. Q3. Differentiate between entropy & conditional entropy. Q4. Explain 3 properties of entropy. Q5. Drawback of fixed dictionary coding. Q6. List 2 types of source & channel coding. Q7. Discuss the properties of linear block code. Q8. List limitations of sysmmetric cipher. Q9. Draw diagram for straight P, S box. Q10. '' for DES (Data Encryption Standard). Q11. Defien crypt analysis. Q12. Discuss Mono-alphabetic cipher. Q13. Types of asymmetric & symmetric encryption techniques. Q14. Common types Cryptographic Attacks. Q15. Diagram for Compression in S Box. Q16. Explain variable length coding. Q17. Explain techniques of Ceaser Cipher. Q18. Compare Block & Stream Cipher. Q19. Discuss techniques of Mono-alphabetic Ceaser Cipher. Q20. Discuss importance of authenticity & non-reputation in secure communication. Q21. '' '' of poly-alphabetic. Q22. Compare linear & non-linear S Boxes. Q23. Solce the parity bits p for k = 10 & t = 1. Q24. Apply LZW dictionary coding approach for message "***". Q25. Identify Advantages & disadvantages of Adaptive Huffman coding. Q26. Apply Adaptive Huffman Decoding on mssge "**". Q27. Apply LZ77 dictionary approach with window size m & look ahead buffer size l for the mssge "**". Q28. Compare Adaptive & Traditional Huffman Coding. Q29. A descrere source emits 1 of 6 symbols in m sec, the symbol probablities are {1/2, 1/4, 1/8, 1/16, 1/32, 1/32}. Calculate the source entropy & information rate. Q30. Steps for building Tree Updaption in Adaptive Huffman Coding. Do for the code word "***". Q31. Construct the key generation encryption/decryption steps involved in RSA. Q32. Discuss basic steps of DES Algorithm with neat diagra and why it was replaced by AES. Q33. Apply process of creating & verifying digital signature usung public key cryptography. Q34. Discuss techniques of Transposition Cipher with example. Q35. Explain key ditribution in symmetric encipherment. Q36. Discuss digital signature ensure both the authentication & entigrity of a message. Q37. Explain how a Block Cipher works & why padding is required for these algorithms. Q38. Explain RSA Algorithm. Q39. Dicuss about improvements of SHA-1 over MD-5. Q40. Outline the process of key agreement in RSA algorithm. Q41. Explain initial permutation, final permutation and fistel permutation. Q42. Explain DES algorithm with diagram.