0% found this document useful (0 votes)
61 views5 pages

CNS-Question Paper 1

1. The document contains a student exam with multiple choice and short answer questions about cryptography topics like symmetric and asymmetric encryption, hash functions, digital signatures, and number theory. 2. The multiple choice section tests knowledge of concepts like greatest common divisors, block ciphers, confusion and diffusion properties, and properties of integers. 3. The short answer questions require explaining majority and conditional functions in SHA-512, comparing digital signatures and asymmetric encryption, determining the key domain of a hypothetical cipher, differentiating one-way and trapdoor one-way functions, calculating the number of elements in a group, and deriving a private key given public key components in RSA.
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
0% found this document useful (0 votes)
61 views5 pages

CNS-Question Paper 1

1. The document contains a student exam with multiple choice and short answer questions about cryptography topics like symmetric and asymmetric encryption, hash functions, digital signatures, and number theory. 2. The multiple choice section tests knowledge of concepts like greatest common divisors, block ciphers, confusion and diffusion properties, and properties of integers. 3. The short answer questions require explaining majority and conditional functions in SHA-512, comparing digital signatures and asymmetric encryption, determining the key domain of a hypothetical cipher, differentiating one-way and trapdoor one-way functions, calculating the number of elements in a group, and deriving a private key given public key components in RSA.
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/ 5

Student Name___________________________________ Reg. No.

_______________________________

Q1: Answers the following questions [30]

1. The GCD (161, 28) is 7. (T/F)


2. CMAC can use AES. (T/F)
3. Confusion implies that if a single bit in the key is changed, several or all symbols in the plain text will also be
changed. (T/F)
4. Different keys are used in symmetric key encipherment and asymmetric key decipherment. ( T / F)
5. The 8-bit word related to the polynomial x5 + x2 + x is…….……………….
6. The result of (x5 + x2 + x) ⊗ (x7 + x4 + x3 + x2 + x) in GF(28) with irreducible polynomial (x8 + x4 + x3 + x + 1)
is……………………………….
7. The result of −18 mod 14 is..............
8. The additive inverse of 7 in Z15 is…………….
9. The multiplicative inverse of 7 in Z41 is……………
10. 4 and 12 are…….…..
a. Integers b. composite numbers c. coprime d. all of the mentioned
11. A non-Feistel cipher can have…………… component.
a. self-invertible b. invertible c. noninvertible. d. all of the mentioned
12. The equation 64x + 32y = 37 has……………solutions.
a. Infinite b. finite c. 4 d. 8
13. The equation 10 x ≡ 15(mod 15) has…………solutions
a. Infinite b. finite c. 5 d. 10
14. ….…………prevent unauthorized users from making modifications to data.
a. Confidentiality b. Integrity c. Availability d. none of the mentioned
15. Replaying attack threatens………………..of the data
a. Confidentiality b. Integrity c. Availability
16. …….. service provides the protection against denial by one of the parties in a communication
a. Non-Repudiation b. Authentication c. Access Control
17. An expansion P-box is a P-box with n inputs and m outputs where
a. m > n b. m < n c. m = n d. m >= n
18. According to Kerckhoff’s principle, resistance of the cipher to attack must be based on the secrecy of the----------
a. Plaintext b. cipher text c. cipher key d. cipher key as well as
encryption and decryption algorithm
19. Whirlpool uses ……..bits message block and …….bits cipher key to create the message digest of …….. bits
a. 512,128,256 b. 512, 256, 128 c. 512, 512,256 d. 512,512,512
20. Prime number has exactly ……..….divisor
a. One b. two c. three d. more than two
Student Name___________________________________ Reg. No._______________________________
Q2: Answers the following questions [4+3+3+3+3+4]

i) Explain majority and conditional functions used in SHA-512 with example.

ii) Explain the difference between digital signature scheme (signing and verification) and asymmetric key
encipherment and decipherment with respect to usages of keys.
Student Name___________________________________ Reg. No._______________________________
iii) Assume that a Cipher X uses addition, multiplication, subtraction and division operations to encrypt the plain
text consisting of alphabets (A to Z), numbers (0 to 9) and special symbols (# @ & ? ! ~). Find the key domain
of the cipher X.

iv) Differentiate one-way function and trapdoor one-way function.

v) Find out the number of elements in Z*180?


Student Name___________________________________ Reg. No._______________________________
vi) Assume that Alice uses RSA algorithm and chooses two prime numbers 5 and 13. Find out her private key if
her public key is 7.
Student Name___________________________________ Reg. No._______________________________
(For Rough work)

You might also like