Question Bank Cryptogrpahy Updated
Question Bank Cryptogrpahy Updated
Semester-VII
Program-B.Tech CSE
UNIT -1 2- MARKS
1 Define cryptography in the context of network security. CO1
2 What is the difference between authentication and authorization? CO1
3 What is steganography, and how does it differ from cryptography? CO1
4 What is watermarking in the context of data security? CO1
5 Explain the concept of confusion and diffusion as per Shannon’s theory. CO1
6 What is the purpose of a substitution cipher in cryptography? CO1
7 What is the purpose of a substitution cipher in cryptography? CO1
8 Define transposition cipher and give an example. CO1
9 What is the Feistel structure used for in block ciphers? CO1
10 Name any two types of classical ciphers. CO1
11 Define cryptanalysis. CO1
12 What is the role of key management in cryptography? CO1
13 Explain the basic working principle of the DES algorithm. CO1
14 What is the strength of a cipher in cryptography? CO1
15 What does the term "meet-in-the-middle" attack refer to? CO1
16 How does the Man-in-the-Middle attack work? CO1
17 What is the main purpose of encryption in cryptography? CO1
18 What is the difference between symmetric and asymmetric encryption models? CO1
19 Describe block cipher and stream cipher CO1
20 What is a brute force attack in cryptanalysis? CO1
21 What does the term cryptographic protocol mean? CO1
5 MARKS
22 Explain the services and mechanisms provided by cryptography in ensuring data CO1
security.
23 Describe the working of a classical substitution cipher. How does it encrypt and CO1
decrypt text?
24 Explain how a transposition cipher works. Provide an example. CO1
25 Discuss Shannon’s theory of confusion and diffusion. How do these concepts CO1
contribute to the strength of a cipher?
26 What is a Feistel cipher structure? Explain its use in modern block ciphers like CO1
DES.
27 Compare and contrast symmetric encryption and asymmetric encryption. CO1
Discuss their strengths and weaknesses.
28 Discuss the process of cryptanalysis. What are the main types of cryptanalytic CO1
attacks?
10 marks
29 Explain the DES (Data Encryption Standard) algorithm. How does it ensure data CO1
security? Discuss its main components.
30 Explain the various cryptographic services and mechanisms used to secure CO1
communication.
31 Explain the working of substitution ciphers such as the Caesar cipher and the CO1
monoalphabetic cipher. Discuss how these ciphers can be broken through
frequency analysis and other cryptanalytic methods. What are the main
limitations of substitution ciphers?
32 Discuss the Feistel cipher structure and its application in block ciphers such as CO1
DES.
33 Describe the working of the DES (Data Encryption Standard) algorithm and CO1
discuss its strengths and weaknesses.
34 What are the types of cryptographic attacks, and how do they apply to modern CO1
ciphers?
35 Describe the Man-in-the-Middle attack and discuss methods to prevent it. CO1
36 What are the key differences between symmetric and asymmetric encryption CO1
models, and what are their respective advantages in various applications?
UNIT-II 2 MARKS
1 What is the Euclidean Algorithm used for in number theory? CO2
2 Define modular arithmetic and give an example. CO2
3 What is a group in mathematical terms? CO2
4 Define a finite field. Give an example. CO2
5 What is the order of an element in a group? CO2
6 What does GF(p) stand for in finite fields? CO2
7 What is polynomial arithmetic in the context of cryptography? CO2
8 Explain the importance of prime numbers in cryptography. CO2
9 State Fermat’s Little Theorem. CO2
10 State Euler's Theorem. CO2
11 What is public key cryptography? CO2
12 What is the basic idea behind the RSA algorithm? CO2
13 What is the role of modular exponentiation in RSA? CO2
14 What is the Diffie-Hellman Key Exchange Algorithm used for? CO2
15 Explain Elliptic Curve Cryptography (ECC) in simple terms. CO2
16 What is a birthday attack in cryptography? CO2
17 Define pseudorandom numbers and why they are important in cryptography. CO2
18 How is the AES algorithm related to symmetric key encryption? CO2
19 What is a cipher block chaining (CBC) mode of AES encryption? CO2
20 What is the main advantage of Elliptic Curve Cryptography (ECC) over RSA? CO2
21 Explain the Euclidean Algorithm and its application in finding the greatest CO2
common divisor (GCD) of two numbers.
5 MARKS
22 Describe the steps involved in modular exponentiation and its significance in CO2
cryptographic algorithms like RSA.
23 Explain the concept of groups in number theory. Discuss the properties of a CO2
group, and give an example of a cryptographic application.
24 Discuss finite fields of the form GF(p). How are they used in cryptographic CO2
systems like AES and elliptic curve cryptography (ECC)?
25 Explain the working of the RSA algorithm. How does RSA use number theory CO2
concepts like modular exponentiation and prime factorization for encryption and
decryption?
26 Describe the Diffie-Hellman Key Exchange Algorithm. How do two parties CO2
securely exchange a secret key over an insecure channel using Diffie-Hellman?
27 Explain Fermat’s Little Theorem and its application in cryptography. How is it CO2
used in algorithms like RSA?
28 Explain Euler’s Theorem and its significance in number theory and CO2
cryptography.
10 MARKS
29 Explain in detail the operation of AES( Advance encryption standard) . How it CO2
works?
30 Explain the process of the Euclidean algorithm for finding the greatest common CO2
divisor (GCD) of two numbers. Illustrate its use in key generation, particularly
in the RSA algorithm and other cryptographic protocols.
31 Define modular arithmetic and demonstrate how it is used in public key CO2
cryptosystems like RSA. Explain how modular exponentiation works in RSA
encryption and decryption.
32 Define finite fields, specifically GF(p) (where p is a prime number), and discuss CO2
their properties. Explain how finite fields are used in cryptographic algorithms
like AES and Elliptic Curve Cryptography (ECC).
33 Provide a comprehensive explanation of the RSA algorithm, including the CO2
mathematical principles it relies on, such as modular exponentiation, prime
factorization, and Euler's theorem.
Alice selects her private key a=7, and Bob selects his private key b=11.
Compute the public keys A and B exchanged between Alice and Bob. Using the
public keys, calculate the shared secret key S that both Alice and Bob derive.