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

mhmadesk
Save to bookmark
|
2022-06-02
|
  466 
Medium
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
Networks, MCQ Questions, Networks MCQ-questions,
login and add your own answer to this question

All Answers

mhmadesk
2022-06-02
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)

This question belongs to these collections

Similar questions

need a help?

find thousands of online teachers now