Scribd
Upload
12 views3 pages

Be Sem 6 Pending Exam Form Data

The document consists of a series of questions related to cryptography and information security, covering various topics such as types of cryptanalytic attacks, security models, definitions of key terms, encryption methods, and specific algorithms like RSA and AES. It also addresses concepts like digital signatures, hash functions, and key distribution scenarios. Overall, it serves as a comprehensive guide for understanding fundamental principles and techniques in cryptography.

Uploaded by

hsathvara18
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
12 views3 pages

Be Sem 6 Pending Exam Form Data

The document consists of a series of questions related to cryptography and information security, covering various topics such as types of cryptanalytic attacks, security models, definitions of key terms, encryption methods, and specific algorithms like RSA and AES. It also addresses concepts like digital signatures, hash functions, and key distribution scenarios. Overall, it serves as a comprehensive guide for understanding fundamental principles and techniques in cryptography.

Uploaded by

hsathvara18
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Q.1.

Explain the various types of cryptanalytic attack, based on the amount of information known to
the cryptanalyst.
Q.2. Explain the conventional security model used for information security.
Q.3. Define the Terms:
Confidentiality, Integrity, Availability, Threat, Authentication, Nonrepudiation,
Cryptography, Cryptanalysis, brute force attack, Avalanche Effect, Access Control,
Relative Prime Number, diffusion and confusion.
Q.4. Explain different Types of Active attacks and passive attacks in details.
Q.5. Explain the Caesar cipher with example.
Q.6. A) What is the difference between a mono alphabetic cipher and a polyalphabetic cipher?
B) Consider a mono-alphabetic cipher with the following key value: (A B C D I J K L E F
G H M N O P U V W X Q R S T Y Z) What will be the encrypted form of the message
“W I N D O W”?
Q.7. A) Explain playfair cipher with example.
B) Construct a playfair matrix with the key “engineering”. And encrypt the message “test
this process”.
Q.8. A) Encrypt the message “EXAM” using the Hill Cipher with the Key = “HILL”
B) Encrypt the Plaintext “safe messages” for the given key: “ciphering”
C) Encrypt the message “security” using Hill Cipher with key (9 4 5 7 )
D) Encrypt the message “GTU Examination” using the Hill cipher algorithm with the key
matrix

Show your calculations and the result


Q.9. Explain the one time pad scheme and Vegenere Cipher.
Q.10. Differentiate symmetric and asymmetric key cryptography or Differentiate public key
cryptography and symmetric key cryptography
Q.11. Explain Rail Fence Technique and Row transposition Cipher technique.
Q.12. Define Block Cipher. Explain Design Principles of block cipher.
Q.13. Draw and explain Feistel’s structure for encryption and decryption.
Q.14. A) Write a short note on DES.
B) Explain Single round DES with diagram.
C) Explain S-boxes in DES
Q.15. Explain Sub key generation Process in Simplified DES algorithm with Example.
Q.16. Explain AES algorithm with Diagram.
Q.17. Explain four different stages of AES(Advance Encryption standard) structure.
Q.18. Explain Key Expansion in AES algorithm.
Q.19. Define Block Cipher Modes of Operation.
Q.20. Explain Double DES. What is a meet-in-the-middle attack?
Q.21. Explain Triple DES (Triple DES with Three Keys, Triple DES with Two Keys)
Q.22. A) Explain RSA algorithm.
B) Perform encryption and decryption using the RSA algorithm for p=3,q=11, e=7, M=5.
Q.23. A) Explain Four possible approaches to attacking the RSA algorithm
B) Explain the three approaches to attack RSA mathematically.
Q.24. A) Describe the Diffie Hellman key exchange Algorithm with example.
B) For Diffie-Hellman algorithm, two publicaly known numbers are prime number 353 and
primitive root of it is 3. A selects the random integer 97 and B selects 233. Compute the
public key of A and B. Also compute common secret key.
C) Calculate all the values for Diffie-Hellman key exchange, consider two primes q=353
and a=3. Assume other values appropriately.
D) Explain Diffie Hellman scheme with diagram. For Diffie Hellman algorithm, two
publically known numbers are prime number 11 and primitive root of it is 2. A selects
the random integer 9 and B selects 4. Compute the public key of A and B. Also compute
common secret key.
Q.25. Explain man-in-the middle attack on this Diffie Hellman key exchange.
Q.26. What is hash function? Explain different characteristics of hash function.
Q.27. Describe Hash function for Message Authentication and Digital Signature
Q.28. Explain SHA-512 Logic.
Q.29. How buffers are updated in SHA-512.
Q.30. Define HMAC in brief.
Q.31. Define Digital signature. Explain digital signature algorithm or Draw Generic Model of Digital
Signature Process.
Q.32. Explain Schnorr Digital Signature Scheme and Elgamal Digital Signature Scheme.
Q.33. Explain any one approach to Digital Signature
Q.34. What is Key Distribution Scenario? Explain in Briefly
Q.35. List four general categories of schemes for the distribution of public keys.
Q.36. Explain X.509 authentication service.
Q.37. Briefly Define Kerberos.
Q.38. Justify the Importance of SSL Handshake Protocol with detailed explanation.
Q.39. What is the Difference between an SSL connection and an SSL session.
Q.40. What is the purpose of HTTPS?

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy