You are on page 1of 5

Code No: RR410504 Set No.

1
IV B.Tech I Semester Supplementary Examinations, February 2007
NETWORK SECURITY AND CRYPTOGRAPHY
(Computer Science & Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) What are two general approaches to attacking a cipher? [8M]


(b) What is the difference between an unconditionally secure cipher and a com-
putationally secure cipher? [8M]

2. Explain the process of encryption and decryption in IDEA algorithm. [16M]

3. (a) Explain RSA Algorithm ? [8M]


(b) Perform encryption and decryption using RSA algorithm for the following
i. p= 3, q=11,d=7, M=5
ii. p=11,q=13,e=11,M=7 [4M+4M]

4. (a) Explain in detail about Extended Euclid’s Algorithm.


(b) Determine Multiplicative inverse of 550 in GF(1759). [8+8]

5. (a) Is it necessary to recover the secret key in order to attack a MAC algorithm?
(b) What characteristics are needed in a secure hash function? [8+8]

6. (a) What problem was Kerberos designed to address?


(b) What are three threats associated with user authentication over a network or
Internet?
(c) List three approaches to secure user authentication over a network or Internet?
[4+4+8]

7. (a) What services are provided by the SSL Record Protocol?


(b) What steps are involved in the SSL Record Protocol transmission? [6+10]

8. (a) What is a digital immune system?


(b) Explain antivirus approaches [8+8]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR410504 Set No. 2
IV B.Tech I Semester Supplementary Examinations, February 2007
NETWORK SECURITY AND CRYPTOGRAPHY
(Computer Science & Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. This problem provides a numerical example of encryption using a one-round version


of DES. We start with the same bit pattern for the key and plain text, namely,
In hexadecimal notation 0 1 2 3 4 5 6 7 8 9 A B C D E F

Inbinary notation: 0000 0001 0010 0011 0100 0101 0110 0111
1000 1001 1010 1011 1100 1101 1110 1111

(a) Derive K1 , the first - round subkey.


(b) Derive L0 , R0
(c) Expand R0 to get E[R0 ]
(d) Calculate A=E[R0 ] ⊕ K1 .
(e) Group the 48-bit result of (d) into sets of 6 bits and evaluate the corresponding
S-box substitutions.
(f) Cancatenate the results of (e) to get a 32-bit result,B.
(g) Apply the permutation to get P(B).
(h) Calculate R1=P(B) ⊕ L0
(i) write down the cipher text. [16M]

2. (a) List the characteristics of advanced block ciphers. [8M]


(b) What are the differences between RC5 and RC2? [8M]

3. (a) Illustrate Diffie-hellman Key Exchange scheme for GF(P) [6M]


(b) Consider a diffie-helman scheme with a common prime q=11 and a primitive
rootα=2
i. If user A has public key YA = 9, what is A’s private key XA ?
ii. If user B has public key YB = 3, what is the shared key K? [10M]

4. (a) State and prove Fermat’s theorem?


(b) State and prove Euler’s theorem?
(c) Using Fermat’s theorem, find 3201 mod 11. [5M+5M+6M]

5. (a) List requirements for a Hash Function.


(b) What basic arithmetical and logical functions are used in SHA-1? [6+10]

6. Explain X.509 Authentication services [16]

1 of 2
Code No: RR410504 Set No. 2
7. Write a short note on

(a) Electronic mail Services


(b) Firewalls [8+8]

8. Write notes on

(a) Viruses
(b) Worms
(c) Bacteria [6+6+4]

⋆⋆⋆⋆⋆

2 of 2
Code No: RR410504 Set No. 3
IV B.Tech I Semester Supplementary Examinations, February 2007
NETWORK SECURITY AND CRYPTOGRAPHY
(Computer Science & Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) What are the various components of symmetric cipher model? Explain. [8M]
(b) Write short notes on crypto analysis. [8M]

2. (a) List the characteristics of advanced block ciphers. [8M]


(b) What are the differences between RC5 and RC2? [8M]

3. (a) Explain RSA Algorithm? [8M]


(b) In a RSA system, the public key of a given user is e=31,n=3599.What is the
private key of this user? [8M]

4. (a) State and prove Fermat’s theorem?


(b) State and prove Euler’s theorem?
(c) Using Fermat’s theorem, find 3201 mod 11. [5M+5M+6M]

5. (a) What is the difference between weak and strong collision resistance?
(b) What is the role of a compression function in a hash function? [6+10]

6. (a) Discuss cryptographic algorithms used in S/MIME


(b) List limitations of SMTP/822 scheme? [8+8]

7. Write note on Encapsulating security payload. [16]

8. Write notes on

(a) Fire walls


(b) Trusted systems [8+8]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR410504 Set No. 4
IV B.Tech I Semester Supplementary Examinations, February 2007
NETWORK SECURITY AND CRYPTOGRAPHY
(Computer Science & Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) What are the various components of symmetric cipher model? Explain. [8M]
(b) Write short notes on crypto analysis. [8M]

2. Demonstrate that Blow Fish decryption is inverse of Blowfish encryption. [16M]

3. (a) Explain public key Crypto Systems. [6M]


(b) Explain in detail about Euclid’s Algorithm. [5M]
(c) Give a brief account on Random number Generation. [5M]

4. (a) If p and q are two prime numbers ,with p6= q and n=pq
Prove that Φ(n)= Φ(pq)=(p-1)(q-1).
(b) Determine Φ(37) and Φ(35). [10+6]

5. (a) what are the requirements for a hash function?


(b) List and discuss the basic uses of hash function. [8+8]

6. (a) What is R64 conversion?


(b) Why is R64 conversion useful for an e-mail application?
(c) Why is the segmentation and reassembly function in PGP needed? [4+6+6]

7. Write note on Encapsulating security payload. [16]

8. Write notes on

(a) Fire walls


(b) Trojan Horse Defense [8+8]

⋆⋆⋆⋆⋆

1 of 1

You might also like