Code No: RR410504 Set No.

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

in
1. Write short notes on

(a) Steganography [5]

.
(b) Transposition cipher [5]
(c) Hill cipher. [6]

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

3. (a) List the differences between Conventional and public key Encryption.
or [8]
(b) List four general categories of schemes for distribution of public keys. [8]

4. (a) Define a Groups, a Rings and a Fields?

(b) Construct Additive table and Multiplicative table for GF(7)? [6+10]

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

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

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

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

7. (a) What are the basic approaches to building SAs?

(b) What are the roles of the Oakley key determination protocol and ISAKMP in
IPSec? [6+10]
nt

8. Write notes on

(a) Packet-Filtering Router

(b) Trusted systems. [8+8]
Aj

⋆⋆⋆⋆⋆

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

in
1. Discuss in detail Simple-DES. [16]

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

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

ld
3. (a) What are Principal elements of a public - key crypto systems? [8]
(b) What are the roles of the public and private key? [8]

4. (a) State properties of Modular Arithmetic.

or
(b) What is difference between modular arithmetic and ordinary arithmetic?
(c) Prove the following :
i. a ≡b mod n implies b ≡ a mod n
ii. a ≡ b mod n and b ≡ c mod n imply a ≡ c mod n. [6+4+6]
uW
5. (a) What is a message authentication code?
(b) When a combination of symmetric encryption and an error control code is
used for message authentication, in what order must the two functions be
performed?
(c) Explain Data Authentication Algorithm. [4+4+8]

6. (a) What is R64 conversion?

(b) Why is R64 conversion useful for an e-mail application?
nt

(c) Why is the segmentation and reassembly function in PGP needed? [4+6+6]

7. (a) What parameters identify an SA and what parameters characterize the nature
of a particular SA?
Aj

(b) What is the difference between transport mode and tunnel mode? [8+8]

8. (a) what information used by a typical packet-filtering router?

(b) What are some weaknesses of a packet-filtering router?
(c) What is the difference between a packet-filtering router and a stateful inspec-
tion firewall? [8+4+4]

⋆⋆⋆⋆⋆

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

in
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

ld
1000 1001 1010 1011 1100 1101 1110 1111

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

(b) Derive L0 , R0 or
(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.
uW
(g) Apply the permutation to get P(B).
(h) Calculate R1=P(B) ⊕ L0
(i) write down the cipher text. [16]

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

3. (a) What are three broad categories of applications of public-key Cryptography?

[6]
nt

(b) Explain RSA Algorithm? [10]

4. (a) what is a primitive root of a number?

(b) Find all primitive roots of 7.
Aj

(c) Using Fermat’s theorem, find 3201 mod 11. [6+6+4]

5. (a) What is a message authentication code?

(b) When a combination of symmetric encryption and an error control code is
used for message authentication, in what order must the two functions be
performed?
(c) Explain Data Authentication Algorithm. [4+4+8]

6. Explain X.509 Authentication services [16]

1 of 2
Code No: RR410504 Set No. 3
7. Write a note on IP security. [16]

8. (a) what information used by a typical packet-filtering router?

(b) What are some weaknesses of a packet-filtering router?
(c) What is the difference between a packet-filtering router and a stateful inspec-
tion firewall? [8+4+4]

in
⋆⋆⋆⋆⋆

.
ld
or
uW
nt
Aj

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

in
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

ld
1000 1001 1010 1011 1100 1101 1110 1111

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

(b) Derive L0 , R0 or
(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.
uW
(g) Apply the permutation to get P(B).
(h) Calculate R1=P(B) ⊕ L0
(i) write down the cipher text. [16]

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

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

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

nt

(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 ?
Aj

ii. If user B has public key YB = 3, what is the shared key K? [10]

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

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

5. (a) What requirements should a digital signature scheme satisfy?

(b) What is the difference between direct and arbitrated digital signature? [8+8]

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

1 of 2
Code No: RR410504 Set No. 4
(b) List limitations of SMTP/822 scheme? [8+8]

7. (a) What are the basic approaches to building SAs?

(b) What are the roles of the Oakley key determination protocol and ISAKMP in
IPSec? [6+10]

8. Write notes on

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

.
⋆⋆⋆⋆⋆

ld
or
uW
nt
Aj

2 of 2