Data Integrity Algorithms Questions and Answers – Message Authentication Codes (MACs)

«
»

This set of Cryptography Multiple Choice Questions & Answers (MCQs) focuses on “Message Authentication Codes (MACs)”.

1. Which figure implements confidentiality and authentication?
cryptography-questions-answers-message-authentication-codes-q1
View Answer

Answer: a
Explanation: Figure implements both confidentiality and authentication.

advertisement

2. Which figure implements confidentiality, authentication and signature?
cryptography-questions-answers-message-authentication-codes-q1

View Answer
Answer: d
Explanation: Figure a implements confidentiality, authentication, and signature.

3. The above figure implements authentication and signature only?
cryptography-questions-answers-message-authentication-codes-q3

a) True
b) False
View Answer

Answer: a
Explanation: The system does not implement confidentiality.

4. The above figure represents internal error control.
cryptography-questions-answers-message-authentication-codes-q4

advertisement

a) True
b) False
View Answer

Answer: b
Explanation: The system is that of external error control.

5. Another name for Message authentication codes is
a) cryptographic codebreak
b) cryptographic codesum
c) cryptographic checksum
d) cryptographic checkbreak
View Answer

Answer: c
Explanation: Cryptographic checksum is another name for MACs.

6. The following figure has authentication tied to the plaintext-
cryptography-questions-answers-message-authentication-codes-q6
a) True
b) False
View Answer

Answer: b
Explanation: The figure has authentication tied to the ciphertext.

7. For a 150-bit message and a 10-bit MAC, how many values are the MAC value dependent on?
a) 2140
b) 2150
c) 215
d) 210
View Answer

Answer: a
Explanation: 2150/210 = 2140.
advertisement

8. Confidentiality can only be provided if we perform message encryption before the MAC generation.
a) True
b) False
View Answer

Answer: b
Explanation: Confidentiality can be provided even if we perform message encryption after the MAC generation.

9. MACs are also called
a) testword
b) checkword
c) testbits
d) none of the mentioned
View Answer

Answer: d
Explanation: Another term for MACs are tags(or check sum).

10. For a 100 bit key and a 32 bit tag, how many possible keys can be produced in the 3rd round?
a) 24
b) 232
c) 216
d) 264
View Answer

Answer: a
Explanation: First round: 100 – 32 = 68
Second round: 68 – 32 = 36.
Third round: 36 – 32 = 4.
Therefore 24 keys can be produced by the third round.

11. MAC is a
a) one-to-one mapping
b) many-to-one mapping
c) onto mapping
d) none of the mentioned
View Answer

Answer: b
Explanation: MACs are many to one mapping, which makes it tougher for the intruder for cryptanalysis.
advertisement

12. For an n-bit tag and a k-bit key, the level of effort required for brute force attack on a MAC algorithm is
a) 2k
b) 2n
c) min(2k,2n)
d) 2k/2n
View Answer

Answer: c
Explanation: The level of effort required for brute force attack on a MAC algorithm is min(2k,2n).

Sanfoundry Global Education & Learning Series – Cryptography and Network Security.

To practice all areas of Cryptography and Network Security, here is complete set of 1000+ Multiple Choice Questions and Answers.

Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs!

advertisement
advertisement
advertisement
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He is Linux Kernel Developer & SAN Architect and is passionate about competency developments in these areas. He lives in Bangalore and delivers focused training sessions to IT professionals in Linux Kernel, Linux Debugging, Linux Device Drivers, Linux Networking, Linux Storage, Advanced C Programming, SAN Storage Technologies, SCSI Internals & Storage Protocols such as iSCSI & Fiber Channel. Stay connected with him @ LinkedIn