Q:

For an n-bit tag and a k-bit key, the level of effort required for brute force attack on a MAC algorithm is

0

For an n-bit tag and a k-bit key, the level of effort required for brute force attack on a MAC algorithm is


  1. 2^k
  2. 2^n
  3. min(2^k,2^n)
  4. 2^k/2^n

All Answers

need an explanation for this answer? contact us directly to get an explanation for this answer

 (c).min(2^k,2^n)

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

CRYPTOGRAPHY AND NETWORK SECURITY - MESSAGE AUTHENTICATION CODES AND KEY MANAGEMENT MCQ

Similar questions


need a help?


find thousands of online teachers now
Cryptographic hash functions execute faster in sof... >>
<< MAC is a...